{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:S7LT2ECB3AZFHZ72G5IB6GOUON","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"ee2ad43727b88d99af8d6430aece4906b78d2cfbf6db14fcce9360f6c16e20cd","cross_cats_sorted":["cs.GT"],"license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"cs.LG","submitted_at":"2026-04-27T14:18:57Z","title_canon_sha256":"99521a12005be5d2398f2d07f4dd353f2fc34f35c10a104c29a4f51a5ccf9fa0"},"schema_version":"1.0","source":{"id":"2604.24517","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2604.24517","created_at":"2026-05-26T01:03:31Z"},{"alias_kind":"arxiv_version","alias_value":"2604.24517v2","created_at":"2026-05-26T01:03:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2604.24517","created_at":"2026-05-26T01:03:31Z"},{"alias_kind":"pith_short_12","alias_value":"S7LT2ECB3AZF","created_at":"2026-05-26T01:03:31Z"},{"alias_kind":"pith_short_16","alias_value":"S7LT2ECB3AZFHZ72","created_at":"2026-05-26T01:03:31Z"},{"alias_kind":"pith_short_8","alias_value":"S7LT2ECB","created_at":"2026-05-26T01:03:31Z"}],"graph_snapshots":[{"event_id":"sha256:6eab1f7389e2144569ca4ef45d238ea8dcbd82f2193e0ebd77a014c6d5aaf523","target":"graph","created_at":"2026-05-26T01:03:31Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":4,"items":[{"attestation":"unclaimed","claim_id":"C1","kind":"strongest_claim","source":"verdict.strongest_claim","status":"machine_extracted","text":"Our main contribution is a simple, explicit, closed-form log-odds aggregator that linearly pools forecasts in logit space, together with (nearly-)tight minimax-regret guarantees across three knowledge regimes."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"The analysis relies on binary states and conditionally independent signals to obtain the stated regret numbers."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"A log-odds pooling rule achieves minimax regret of 0.0255 for conditionally independent signals under prior-agnostic robust forecast aggregation with unknown state space."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"A closed-form log-odds aggregator pools expert forecasts in logit space to achieve minimax regret bounds below 0.026 even when the prior and state space are unknown."}],"snapshot_sha256":"9382d64f3fdf1f44b2e6282077719810c030ad850bb8f1ac1afa2da6ca7ffa0e"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[{"findings_count":0,"name":"ai_meta_artifact","ran_at":"2026-05-21T06:39:11.486129Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"doi_compliance","ran_at":"2026-05-19T22:02:21.451745Z","status":"completed","version":"1.0.0"}],"endpoint":"/pith/2604.24517/integrity.json","findings":[],"snapshot_sha256":"1759a5dfbfef4e8216623aa5de56a234e07ebf36efdd2252ba8fe4587e45250d","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Robust forecast aggregation combines the predictions of multiple information sources to perform well in the worst case across all possible information structures. Previous work largely focuses on settings with a known binary state space, where the state is either 0 or 1. We study prior-agnostic robust forecast aggregation in which the aggregator observes only experts' reports, yet is ignorant of both the underlying joint information structure and the full prior, including the underlying state space. Unlike the standard model that fixes the binary state space {0, 1}, we allow the (binary) unkno","authors_text":"Cheng Peng, Wei Tang, Zhi Chen","cross_cats":["cs.GT"],"headline":"A closed-form log-odds aggregator pools expert forecasts in logit space to achieve minimax regret bounds below 0.026 even when the prior and state space are unknown.","license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"cs.LG","submitted_at":"2026-04-27T14:18:57Z","title":"Prior-Agnostic Robust Forecast Aggregation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2604.24517","kind":"arxiv","version":2},"verdict":{"created_at":"2026-05-08T04:06:16.440282Z","id":"90db6a0f-f08c-46a5-8a77-ea0f7fb62377","model_set":{"reader":"grok-4.3"},"one_line_summary":"A log-odds pooling rule achieves minimax regret of 0.0255 for conditionally independent signals under prior-agnostic robust forecast aggregation with unknown state space.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"A closed-form log-odds aggregator pools expert forecasts in logit space to achieve minimax regret bounds below 0.026 even when the prior and state space are unknown.","strongest_claim":"Our main contribution is a simple, explicit, closed-form log-odds aggregator that linearly pools forecasts in logit space, together with (nearly-)tight minimax-regret guarantees across three knowledge regimes.","weakest_assumption":"The analysis relies on binary states and conditionally independent signals to obtain the stated regret numbers."}},"verdict_id":"90db6a0f-f08c-46a5-8a77-ea0f7fb62377"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:600507fdd419b0b1fb3bc58d053ea226aa52debab328e798ad96f0d8bbbc192d","target":"record","created_at":"2026-05-26T01:03:31Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"ee2ad43727b88d99af8d6430aece4906b78d2cfbf6db14fcce9360f6c16e20cd","cross_cats_sorted":["cs.GT"],"license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"cs.LG","submitted_at":"2026-04-27T14:18:57Z","title_canon_sha256":"99521a12005be5d2398f2d07f4dd353f2fc34f35c10a104c29a4f51a5ccf9fa0"},"schema_version":"1.0","source":{"id":"2604.24517","kind":"arxiv","version":2}},"canonical_sha256":"97d73d1041d83253e7fa37501f19d4737e51184f9df9f5210f618ee993f819a7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"97d73d1041d83253e7fa37501f19d4737e51184f9df9f5210f618ee993f819a7","first_computed_at":"2026-05-26T01:03:31.230487Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-26T01:03:31.230487Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"DRIc9iwlLU4o4xAbq+hTns571jiF53XSBAcunogl1dJwPeEdJCu/O5EgOTxvLLAWMzCPXSACemGCnNpkJDuTBQ==","signature_status":"signed_v1","signed_at":"2026-05-26T01:03:31.234340Z","signed_message":"canonical_sha256_bytes"},"source_id":"2604.24517","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:600507fdd419b0b1fb3bc58d053ea226aa52debab328e798ad96f0d8bbbc192d","sha256:6eab1f7389e2144569ca4ef45d238ea8dcbd82f2193e0ebd77a014c6d5aaf523"],"state_sha256":"b323d02d8026544b6d2b04f764e2e927b3f8311712a429fe0f842d56d08f398f"}