{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:WLFR52F4XKJNFUYQWRY7ADM24X","short_pith_number":"pith:WLFR52F4","canonical_record":{"source":{"id":"2606.18121","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MA","submitted_at":"2026-06-16T16:21:52Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"7fa59020152af10a65d2e93b4c44487b69731822cbdd1ead3403e90b3afe37a7","abstract_canon_sha256":"f38745d1acc734ec834f004e8c1d7b83fc14b56273fb38175dc0ae1c43ef1a8b"},"schema_version":"1.0"},"canonical_sha256":"b2cb1ee8bcba92d2d310b471f00d9ae5c1f6bccab4175f5dcbc208f2a0254a6a","source":{"kind":"arxiv","id":"2606.18121","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.18121","created_at":"2026-06-19T16:10:48Z"},{"alias_kind":"arxiv_version","alias_value":"2606.18121v1","created_at":"2026-06-19T16:10:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.18121","created_at":"2026-06-19T16:10:48Z"},{"alias_kind":"pith_short_12","alias_value":"WLFR52F4XKJN","created_at":"2026-06-19T16:10:48Z"},{"alias_kind":"pith_short_16","alias_value":"WLFR52F4XKJNFUYQ","created_at":"2026-06-19T16:10:48Z"},{"alias_kind":"pith_short_8","alias_value":"WLFR52F4","created_at":"2026-06-19T16:10:48Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:WLFR52F4XKJNFUYQWRY7ADM24X","target":"record","payload":{"canonical_record":{"source":{"id":"2606.18121","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MA","submitted_at":"2026-06-16T16:21:52Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"7fa59020152af10a65d2e93b4c44487b69731822cbdd1ead3403e90b3afe37a7","abstract_canon_sha256":"f38745d1acc734ec834f004e8c1d7b83fc14b56273fb38175dc0ae1c43ef1a8b"},"schema_version":"1.0"},"canonical_sha256":"b2cb1ee8bcba92d2d310b471f00d9ae5c1f6bccab4175f5dcbc208f2a0254a6a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-19T16:10:48.894981Z","signature_b64":"2+fInlaeKcxLgqHGApyrg7x9Znn4nG05nEM1/hLCws5C3nNJ85dCZw5Wbt096PrlDeTmbT8F/wrXxmMDfo1cCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b2cb1ee8bcba92d2d310b471f00d9ae5c1f6bccab4175f5dcbc208f2a0254a6a","last_reissued_at":"2026-06-19T16:10:48.894584Z","signature_status":"signed_v1","first_computed_at":"2026-06-19T16:10:48.894584Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2606.18121","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-06-19T16:10:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VFtRn4wPma8y7NofdWLRy8wbB2Gw57Cs3kYULxGpgVw6HX25H46vJU68nW/tgzLSPFTPzJP/bSZqd7211OH/Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-29T09:27:41.498168Z"},"content_sha256":"9084fcc23e1c7360ef422055e57a9b94b468e98e6ee7d3f677d5dac4c3ed3e1b","schema_version":"1.0","event_id":"sha256:9084fcc23e1c7360ef422055e57a9b94b468e98e6ee7d3f677d5dac4c3ed3e1b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:WLFR52F4XKJNFUYQWRY7ADM24X","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the Reliability of Networks of AI Agents: Density Evolution, Stopping Sets, and Architecture Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"cs.MA","authors_text":"Ehsan Aghazadeh, Hossein Pishro-Nik","submitted_at":"2026-06-16T16:21:52Z","abstract_excerpt":"Modern AI systems increasingly solve a task not with a single model call but with several imperfect agents working together: some propose pieces of a solution, others verify them, and the results are combined. These systems often outperform any single model, yet it is rarely clear why they succeed or when they will fail. We model such a system as message passing on a sparse graph, the structure that underlies low-density parity-check (LDPC) codes, and extend the density-evolution machinery of coding theory to this richer setting. In our model a task is a set of coupled binary subclaims, and an"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.18121","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/2606.18121/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-06-19T16:10:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"x0imeuPL2nyRr7Uqui0izySnDRK1QC6CBxuhTJhNyIAv9YORgFKCaw5Ld2a+WuLBu8/7OBRv7nd2Vm1CGvPBDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-29T09:27:41.498555Z"},"content_sha256":"720498f1f41a1d58c071e6c55e6aa11937ff17451e14986da7b109ba24b4f729","schema_version":"1.0","event_id":"sha256:720498f1f41a1d58c071e6c55e6aa11937ff17451e14986da7b109ba24b4f729"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WLFR52F4XKJNFUYQWRY7ADM24X/bundle.json","state_url":"https://pith.science/pith/WLFR52F4XKJNFUYQWRY7ADM24X/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WLFR52F4XKJNFUYQWRY7ADM24X/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-06-29T09:27:41Z","links":{"resolver":"https://pith.science/pith/WLFR52F4XKJNFUYQWRY7ADM24X","bundle":"https://pith.science/pith/WLFR52F4XKJNFUYQWRY7ADM24X/bundle.json","state":"https://pith.science/pith/WLFR52F4XKJNFUYQWRY7ADM24X/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WLFR52F4XKJNFUYQWRY7ADM24X/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:WLFR52F4XKJNFUYQWRY7ADM24X","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":"f38745d1acc734ec834f004e8c1d7b83fc14b56273fb38175dc0ae1c43ef1a8b","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MA","submitted_at":"2026-06-16T16:21:52Z","title_canon_sha256":"7fa59020152af10a65d2e93b4c44487b69731822cbdd1ead3403e90b3afe37a7"},"schema_version":"1.0","source":{"id":"2606.18121","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.18121","created_at":"2026-06-19T16:10:48Z"},{"alias_kind":"arxiv_version","alias_value":"2606.18121v1","created_at":"2026-06-19T16:10:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.18121","created_at":"2026-06-19T16:10:48Z"},{"alias_kind":"pith_short_12","alias_value":"WLFR52F4XKJN","created_at":"2026-06-19T16:10:48Z"},{"alias_kind":"pith_short_16","alias_value":"WLFR52F4XKJNFUYQ","created_at":"2026-06-19T16:10:48Z"},{"alias_kind":"pith_short_8","alias_value":"WLFR52F4","created_at":"2026-06-19T16:10:48Z"}],"graph_snapshots":[{"event_id":"sha256:720498f1f41a1d58c071e6c55e6aa11937ff17451e14986da7b109ba24b4f729","target":"graph","created_at":"2026-06-19T16:10:48Z","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/2606.18121/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Modern AI systems increasingly solve a task not with a single model call but with several imperfect agents working together: some propose pieces of a solution, others verify them, and the results are combined. These systems often outperform any single model, yet it is rarely clear why they succeed or when they will fail. We model such a system as message passing on a sparse graph, the structure that underlies low-density parity-check (LDPC) codes, and extend the density-evolution machinery of coding theory to this richer setting. In our model a task is a set of coupled binary subclaims, and an","authors_text":"Ehsan Aghazadeh, Hossein Pishro-Nik","cross_cats":["cs.IT","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MA","submitted_at":"2026-06-16T16:21:52Z","title":"On the Reliability of Networks of AI Agents: Density Evolution, Stopping Sets, and Architecture Optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.18121","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:9084fcc23e1c7360ef422055e57a9b94b468e98e6ee7d3f677d5dac4c3ed3e1b","target":"record","created_at":"2026-06-19T16:10:48Z","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":"f38745d1acc734ec834f004e8c1d7b83fc14b56273fb38175dc0ae1c43ef1a8b","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MA","submitted_at":"2026-06-16T16:21:52Z","title_canon_sha256":"7fa59020152af10a65d2e93b4c44487b69731822cbdd1ead3403e90b3afe37a7"},"schema_version":"1.0","source":{"id":"2606.18121","kind":"arxiv","version":1}},"canonical_sha256":"b2cb1ee8bcba92d2d310b471f00d9ae5c1f6bccab4175f5dcbc208f2a0254a6a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b2cb1ee8bcba92d2d310b471f00d9ae5c1f6bccab4175f5dcbc208f2a0254a6a","first_computed_at":"2026-06-19T16:10:48.894584Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-19T16:10:48.894584Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"2+fInlaeKcxLgqHGApyrg7x9Znn4nG05nEM1/hLCws5C3nNJ85dCZw5Wbt096PrlDeTmbT8F/wrXxmMDfo1cCQ==","signature_status":"signed_v1","signed_at":"2026-06-19T16:10:48.894981Z","signed_message":"canonical_sha256_bytes"},"source_id":"2606.18121","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9084fcc23e1c7360ef422055e57a9b94b468e98e6ee7d3f677d5dac4c3ed3e1b","sha256:720498f1f41a1d58c071e6c55e6aa11937ff17451e14986da7b109ba24b4f729"],"state_sha256":"20842e7a0e213c3e7051ba1b16acb8e33f76fe9f6d02bf0427b9e75915a0769f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"t+Lrtdw6Wm/1OKQz8sN8fLKkVBY2kkuMXsyaU++bujxbgAxUJOrldkRvZUTXi/wz/QRrZzqLz82O5hzDsAepAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-29T09:27:41.500474Z","bundle_sha256":"80873724d46dc9168e18a1414225732548af93edaa474037ed8deb7d4f420c5e"}}