{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2004:5HZDGTMOLFRXH43WENVBPLJ7LA","short_pith_number":"pith:5HZDGTMO","canonical_record":{"source":{"id":"cs/0406061","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"cs.CC","submitted_at":"2004-06-30T06:28:35Z","cross_cats_sorted":["cs.GT"],"title_canon_sha256":"7a9712a949c209ccd48f15235e73d99f3034bbab541cad7b0bef511b3230d405","abstract_canon_sha256":"6a55add0970995f6eeb6f21d13657bb517d88300c2de6af3fc4d360b818846b2"},"schema_version":"1.0"},"canonical_sha256":"e9f2334d8e596373f376236a17ad3f58252e9de153e57984bddcc99e58cd49b3","source":{"kind":"arxiv","id":"cs/0406061","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"cs/0406061","created_at":"2026-07-04T14:24:44Z"},{"alias_kind":"arxiv_version","alias_value":"cs/0406061v1","created_at":"2026-07-04T14:24:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cs/0406061","created_at":"2026-07-04T14:24:44Z"},{"alias_kind":"pith_short_12","alias_value":"5HZDGTMOLFRX","created_at":"2026-07-04T14:24:44Z"},{"alias_kind":"pith_short_16","alias_value":"5HZDGTMOLFRXH43W","created_at":"2026-07-04T14:24:44Z"},{"alias_kind":"pith_short_8","alias_value":"5HZDGTMO","created_at":"2026-07-04T14:24:44Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2004:5HZDGTMOLFRXH43WENVBPLJ7LA","target":"record","payload":{"canonical_record":{"source":{"id":"cs/0406061","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"cs.CC","submitted_at":"2004-06-30T06:28:35Z","cross_cats_sorted":["cs.GT"],"title_canon_sha256":"7a9712a949c209ccd48f15235e73d99f3034bbab541cad7b0bef511b3230d405","abstract_canon_sha256":"6a55add0970995f6eeb6f21d13657bb517d88300c2de6af3fc4d360b818846b2"},"schema_version":"1.0"},"canonical_sha256":"e9f2334d8e596373f376236a17ad3f58252e9de153e57984bddcc99e58cd49b3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T14:24:44.706596Z","signature_b64":"4ZNFNkhScONYI0zhh0TVLk7rzUXwzdNodqwGCLT0MPJfDYaeI/On3NGwyzG54x0nbcteuHhEiqPhZ14jfpBwAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e9f2334d8e596373f376236a17ad3f58252e9de153e57984bddcc99e58cd49b3","last_reissued_at":"2026-07-04T14:24:44.706215Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T14:24:44.706215Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"cs/0406061","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-04T14:24:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1KOokS3zoTk/bL9+rGcKzbmj8Mky31xcSWVH1piH8d73MG/KPnUEojOGff8PBFS9cefW9qdhGO/UFSC9zRDuDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T10:28:06.049656Z"},"content_sha256":"2929d9a565c8b4a53b41f8eeb189d49fe42a18d83d60056626931990e13f5334","schema_version":"1.0","event_id":"sha256:2929d9a565c8b4a53b41f8eeb189d49fe42a18d83d60056626931990e13f5334"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2004:5HZDGTMOLFRXH43WENVBPLJ7LA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The Complexity of Agreement","license":"","headline":"","cross_cats":["cs.GT"],"primary_cat":"cs.CC","authors_text":"Scott Aaronson","submitted_at":"2004-06-30T06:28:35Z","abstract_excerpt":"A celebrated 1976 theorem of Aumann asserts that honest, rational Bayesian agents with common priors will never \"agree to disagree\": if their opinions about any topic are common knowledge, then those opinions must be equal. Economists have written numerous papers examining the assumptions behind this theorem. But two key questions went unaddressed: first, can the agents reach agreement after a conversation of reasonable length? Second, can the computations needed for that conversation be performed efficiently? This paper answers both questions in the affirmative, thereby strengthening Aumann's"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"cs/0406061","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/cs/0406061/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-04T14:24:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hDOVyI3foEkSGbBM+eLNjKBL1bPkHiaBLXQVAtpNcs0azoQooz/Y6xpr3FzzpOGjvOt9IbVSAkgYdIb2fQcpAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T10:28:06.050039Z"},"content_sha256":"2dd883566395d190cc0b1fc0cb84a69b5c98510082a664b9264975f066149e26","schema_version":"1.0","event_id":"sha256:2dd883566395d190cc0b1fc0cb84a69b5c98510082a664b9264975f066149e26"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5HZDGTMOLFRXH43WENVBPLJ7LA/bundle.json","state_url":"https://pith.science/pith/5HZDGTMOLFRXH43WENVBPLJ7LA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5HZDGTMOLFRXH43WENVBPLJ7LA/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-07-07T10:28:06Z","links":{"resolver":"https://pith.science/pith/5HZDGTMOLFRXH43WENVBPLJ7LA","bundle":"https://pith.science/pith/5HZDGTMOLFRXH43WENVBPLJ7LA/bundle.json","state":"https://pith.science/pith/5HZDGTMOLFRXH43WENVBPLJ7LA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5HZDGTMOLFRXH43WENVBPLJ7LA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2004:5HZDGTMOLFRXH43WENVBPLJ7LA","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":"6a55add0970995f6eeb6f21d13657bb517d88300c2de6af3fc4d360b818846b2","cross_cats_sorted":["cs.GT"],"license":"","primary_cat":"cs.CC","submitted_at":"2004-06-30T06:28:35Z","title_canon_sha256":"7a9712a949c209ccd48f15235e73d99f3034bbab541cad7b0bef511b3230d405"},"schema_version":"1.0","source":{"id":"cs/0406061","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"cs/0406061","created_at":"2026-07-04T14:24:44Z"},{"alias_kind":"arxiv_version","alias_value":"cs/0406061v1","created_at":"2026-07-04T14:24:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cs/0406061","created_at":"2026-07-04T14:24:44Z"},{"alias_kind":"pith_short_12","alias_value":"5HZDGTMOLFRX","created_at":"2026-07-04T14:24:44Z"},{"alias_kind":"pith_short_16","alias_value":"5HZDGTMOLFRXH43W","created_at":"2026-07-04T14:24:44Z"},{"alias_kind":"pith_short_8","alias_value":"5HZDGTMO","created_at":"2026-07-04T14:24:44Z"}],"graph_snapshots":[{"event_id":"sha256:2dd883566395d190cc0b1fc0cb84a69b5c98510082a664b9264975f066149e26","target":"graph","created_at":"2026-07-04T14:24:44Z","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":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/cs/0406061/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"A celebrated 1976 theorem of Aumann asserts that honest, rational Bayesian agents with common priors will never \"agree to disagree\": if their opinions about any topic are common knowledge, then those opinions must be equal. Economists have written numerous papers examining the assumptions behind this theorem. But two key questions went unaddressed: first, can the agents reach agreement after a conversation of reasonable length? Second, can the computations needed for that conversation be performed efficiently? This paper answers both questions in the affirmative, thereby strengthening Aumann's","authors_text":"Scott Aaronson","cross_cats":["cs.GT"],"headline":"","license":"","primary_cat":"cs.CC","submitted_at":"2004-06-30T06:28:35Z","title":"The Complexity of Agreement"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"cs/0406061","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:2929d9a565c8b4a53b41f8eeb189d49fe42a18d83d60056626931990e13f5334","target":"record","created_at":"2026-07-04T14:24:44Z","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":"6a55add0970995f6eeb6f21d13657bb517d88300c2de6af3fc4d360b818846b2","cross_cats_sorted":["cs.GT"],"license":"","primary_cat":"cs.CC","submitted_at":"2004-06-30T06:28:35Z","title_canon_sha256":"7a9712a949c209ccd48f15235e73d99f3034bbab541cad7b0bef511b3230d405"},"schema_version":"1.0","source":{"id":"cs/0406061","kind":"arxiv","version":1}},"canonical_sha256":"e9f2334d8e596373f376236a17ad3f58252e9de153e57984bddcc99e58cd49b3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e9f2334d8e596373f376236a17ad3f58252e9de153e57984bddcc99e58cd49b3","first_computed_at":"2026-07-04T14:24:44.706215Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-04T14:24:44.706215Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"4ZNFNkhScONYI0zhh0TVLk7rzUXwzdNodqwGCLT0MPJfDYaeI/On3NGwyzG54x0nbcteuHhEiqPhZ14jfpBwAA==","signature_status":"signed_v1","signed_at":"2026-07-04T14:24:44.706596Z","signed_message":"canonical_sha256_bytes"},"source_id":"cs/0406061","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2929d9a565c8b4a53b41f8eeb189d49fe42a18d83d60056626931990e13f5334","sha256:2dd883566395d190cc0b1fc0cb84a69b5c98510082a664b9264975f066149e26"],"state_sha256":"429a5449d3e2662dd71782ea53911e04233102621d14919e04ba8573eca76828"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NK4UdD33tPrEX97UGPfohxv5k6Npj73n2nZAX1rsDwKsQhkvtKaK53ahLILyn8ixuEnSY0xdHNLciEnIG/UGBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-07T10:28:06.051933Z","bundle_sha256":"8646f307714eea5bea16e922b7151890ded09c8b5c56156817c8e8fc43005605"}}