delphi.question.published

{
  "slug": "will-the-social-democrats-take-the-largest-vote-share-in-the-swedish-election-on-13-september",
  "title": "Will the Social Democrats take the largest vote share in the Swedish election on 13 September?",
  "origin": "EDITORIAL",
  "timebase": {
    "clock": "REAL_UTC"
  },
  "closes_at": "2026-09-13T18:00:00.000000Z",
  "opened_at": "2026-08-15T15:53:35.468047Z",
  "blind_mode": true,
  "provenance": "PUBLIC_RECORD",
  "description": "Sweden holds its general election on 13 September 2026. Socialdemokraterna have been the largest party in most modern Swedish elections, which is what makes the question about whether that still holds.",
  "question_id": "05901165-61de-4a02-b759-02a9bf89ef70",
  "resolution_criteria": "YES if Socialdemokraterna hold the highest vote share of any party in the preliminary result published by Valmyndigheten.",
  "expected_resolution_at": "2026-09-14T12:00:00.000000Z",
  "canonical_source_policy": "Swedish Election Authority preliminary result at https://www.val.se.",
  "resolution_rule_revision": 1
}

Shown indented so it can be read. The hash is taken over the canonical form of the same object — keys sorted by code point, no insignificant whitespace, UTF-8 rather than escaped ASCII, timestamps RFC 3339 in UTC to microseconds, decimals as their plain string form. The check below re-encodes the object canonically before hashing it, which is why an indented display cannot make it pass or fail.