{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:QZEGLJK3QZ66X3XP2R7FJSJGRS","short_pith_number":"pith:QZEGLJK3","canonical_record":{"source":{"id":"2605.15513","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.AI","submitted_at":"2026-05-15T01:16:12Z","cross_cats_sorted":[],"title_canon_sha256":"54277e13d70bd6b643130666afa2e5fd9126a0145533b2ddd8d918e440a12a3b","abstract_canon_sha256":"6ace4a5c8d287c180dc64f30324a82de6ef52b94149ced58c899fe87c0ef5975"},"schema_version":"1.0"},"canonical_sha256":"864865a55b867debeeefd47e54c9268c8ce8b74cc647b64978e1626506c02943","source":{"kind":"arxiv","id":"2605.15513","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.15513","created_at":"2026-05-20T00:01:02Z"},{"alias_kind":"arxiv_version","alias_value":"2605.15513v1","created_at":"2026-05-20T00:01:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.15513","created_at":"2026-05-20T00:01:02Z"},{"alias_kind":"pith_short_12","alias_value":"QZEGLJK3QZ66","created_at":"2026-05-20T00:01:02Z"},{"alias_kind":"pith_short_16","alias_value":"QZEGLJK3QZ66X3XP","created_at":"2026-05-20T00:01:02Z"},{"alias_kind":"pith_short_8","alias_value":"QZEGLJK3","created_at":"2026-05-20T00:01:02Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:QZEGLJK3QZ66X3XP2R7FJSJGRS","target":"record","payload":{"canonical_record":{"source":{"id":"2605.15513","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.AI","submitted_at":"2026-05-15T01:16:12Z","cross_cats_sorted":[],"title_canon_sha256":"54277e13d70bd6b643130666afa2e5fd9126a0145533b2ddd8d918e440a12a3b","abstract_canon_sha256":"6ace4a5c8d287c180dc64f30324a82de6ef52b94149ced58c899fe87c0ef5975"},"schema_version":"1.0"},"canonical_sha256":"864865a55b867debeeefd47e54c9268c8ce8b74cc647b64978e1626506c02943","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-20T00:01:02.526096Z","signature_b64":"c8V3m4lrvnCgQzR78k4lHCuSpnGUr8ZH2V2y7CK8Wm5l2q3c6gSwhAmdOjha92yJZA2jPMyV1JdbA0PqS8bnCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"864865a55b867debeeefd47e54c9268c8ce8b74cc647b64978e1626506c02943","last_reissued_at":"2026-05-20T00:01:02.525081Z","signature_status":"signed_v1","first_computed_at":"2026-05-20T00:01:02.525081Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2605.15513","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-05-20T00:01:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iWaOU27zdRwEUfc9TxZiY36fM3l83q4DrX4C0FoVbVe42MA/7M9NLYd8enV2m+2zKyc2DbTZ7ZmncOooj1GAAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T18:02:47.371751Z"},"content_sha256":"ab1693ae54f7a52713b7b45b59c4610ae552edb41f91445f213d5866aa1f42ac","schema_version":"1.0","event_id":"sha256:ab1693ae54f7a52713b7b45b59c4610ae552edb41f91445f213d5866aa1f42ac"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:QZEGLJK3QZ66X3XP2R7FJSJGRS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"CAPS: Cascaded Adaptive Pairwise Selection for Efficient Parallel Reasoning","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"CAPS uses a four-stage cascade to adapt evidence and pair selection so pairwise verification costs far less while selecting better answers.","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Fangzhou Lin, Haichong Zhang, Kazunori Yamada, Peiran Li, Qianwen Ge, Shuo Xing, Siyuan Yang, Zhengzhong Tu, Ziming Zhang","submitted_at":"2026-05-15T01:16:12Z","abstract_excerpt":"Parallel reasoning, where a generator samples many candidate solutions and an aggregator selects the best, is one of the most effective forms of test-time scaling in large language models, and pairwise self-verification has become its strongest aggregation primitive. Yet pairwise verification carries a heavy cost: each judgment reads two complete solutions in full, and existing methods perform tens of such judgments per problem regardless of whether the comparison is informative. We introduce CAPS (Cascaded Adaptive Pairwise Selection), an inference-only framework that allocates verifier compu"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"On four self-verifying models and five reasoning benchmarks, CAPS outperforms the leading pairwise verifier on 14 of 20 suites while using 25.4% of its verifier-token budget on code, and outperforms pointwise self-verification on all 20.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"The verifier's accuracy at partial versus full evidence remains high enough that early-stage decisions in the cascade do not introduce irrecoverable errors; this is invoked in the description of the four-stage cascade and the optional rescue subroutine.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"CAPS is a four-stage inference-only cascade that adapts how much of each solution the verifier sees and how comparisons are distributed, halving per-candidate verifier tokens while outperforming uniform pairwise verification on most benchmarks.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"CAPS uses a four-stage cascade to adapt evidence and pair selection so pairwise verification costs far less while selecting better answers.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"fa52d563f5c2074a329110afe165bbc1e9cb6b47f8186194196e49ba6b253ce0"},"source":{"id":"2605.15513","kind":"arxiv","version":1},"verdict":{"id":"1e7c6be4-fdec-4581-9810-d919ab83f054","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-19T15:35:05.163741Z","strongest_claim":"On four self-verifying models and five reasoning benchmarks, CAPS outperforms the leading pairwise verifier on 14 of 20 suites while using 25.4% of its verifier-token budget on code, and outperforms pointwise self-verification on all 20.","one_line_summary":"CAPS is a four-stage inference-only cascade that adapts how much of each solution the verifier sees and how comparisons are distributed, halving per-candidate verifier tokens while outperforming uniform pairwise verification on most benchmarks.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"The verifier's accuracy at partial versus full evidence remains high enough that early-stage decisions in the cascade do not introduce irrecoverable errors; this is invoked in the description of the four-stage cascade and the optional rescue subroutine.","pith_extraction_headline":"CAPS uses a four-stage cascade to adapt evidence and pair selection so pairwise verification costs far less while selecting better answers."},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2605.15513/integrity.json","findings":[],"available":true,"detectors_run":[{"name":"doi_title_agreement","ran_at":"2026-05-19T16:01:17.907021Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"doi_compliance","ran_at":"2026-05-19T15:40:36.388206Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"cited_work_retraction","ran_at":"2026-05-19T14:51:54.858393Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"claim_evidence","ran_at":"2026-05-19T14:21:54.054171Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"shingle_duplication","ran_at":"2026-05-19T13:49:41.847657Z","status":"skipped","version":"0.1.0","findings_count":0},{"name":"citation_quote_validity","ran_at":"2026-05-19T13:49:41.386573Z","status":"skipped","version":"0.1.0","findings_count":0},{"name":"ai_meta_artifact","ran_at":"2026-05-19T13:33:22.633955Z","status":"skipped","version":"1.0.0","findings_count":0}],"snapshot_sha256":"f186245df29a376fe5507fc0165a6508f61fea085b0e689e42042119ec005bc6"},"references":{"count":65,"sample":[{"doi":"","year":2025,"title":"gpt-oss-120b & gpt-oss-20b Model Card","work_id":"178c1f7e-4f19-4392-a45d-45a6dfa88ead","ref_index":1,"cited_arxiv_id":"2508.10925","is_internal_anchor":true},{"doi":"","year":2025,"title":"MathArena: Evaluating LLMs on Uncontaminated Math Competitions","work_id":"61e8d872-ccc7-46b8-8ec1-94008704c941","ref_index":2,"cited_arxiv_id":"2505.23281","is_internal_anchor":true},{"doi":"","year":2024,"title":"Large Language Monkeys: Scaling Inference Compute with Repeated Sampling","work_id":"b124064d-5a56-42ad-86f5-3cc349b86a3a","ref_index":3,"cited_arxiv_id":"2407.21787","is_internal_anchor":true},{"doi":"","year":2021,"title":"Evaluating Large Language Models Trained on Code","work_id":"042493e9-b26f-4b4e-bbde-382072ca9b08","ref_index":4,"cited_arxiv_id":"2107.03374","is_internal_anchor":true},{"doi":"","year":2023,"title":"Universal self-consistency for large language model generation","work_id":"9d1484c2-6ca2-4421-8b90-995b3adbc93c","ref_index":5,"cited_arxiv_id":"","is_internal_anchor":false}],"resolved_work":65,"snapshot_sha256":"9e5587cf4c45924fc63fbd018d43586f2e82ae000c6c7bee07a67e2963e273d5","internal_anchors":13},"formal_canon":{"evidence_count":1,"snapshot_sha256":"2e3d77ff6ce5f06414233c54cbf8b1da1f15c0b3bd96ad386323edc93ce00f19"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"verdict_id":"1e7c6be4-fdec-4581-9810-d919ab83f054"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-20T00:01:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qvt6qF1M0aB//qVO0gBpLDxSN37GGGDOV4GbNnQgZU5evWuc6SU8IKKlWKlvKIUKvAjsrAOXxS0pSdjz03r4BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T18:02:47.372840Z"},"content_sha256":"3c2d831db87a1502713ad0251e5f23e95375de5fff309526c8eb023aedc5f110","schema_version":"1.0","event_id":"sha256:3c2d831db87a1502713ad0251e5f23e95375de5fff309526c8eb023aedc5f110"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QZEGLJK3QZ66X3XP2R7FJSJGRS/bundle.json","state_url":"https://pith.science/pith/QZEGLJK3QZ66X3XP2R7FJSJGRS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QZEGLJK3QZ66X3XP2R7FJSJGRS/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-05-25T18:02:47Z","links":{"resolver":"https://pith.science/pith/QZEGLJK3QZ66X3XP2R7FJSJGRS","bundle":"https://pith.science/pith/QZEGLJK3QZ66X3XP2R7FJSJGRS/bundle.json","state":"https://pith.science/pith/QZEGLJK3QZ66X3XP2R7FJSJGRS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QZEGLJK3QZ66X3XP2R7FJSJGRS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:QZEGLJK3QZ66X3XP2R7FJSJGRS","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":"6ace4a5c8d287c180dc64f30324a82de6ef52b94149ced58c899fe87c0ef5975","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.AI","submitted_at":"2026-05-15T01:16:12Z","title_canon_sha256":"54277e13d70bd6b643130666afa2e5fd9126a0145533b2ddd8d918e440a12a3b"},"schema_version":"1.0","source":{"id":"2605.15513","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.15513","created_at":"2026-05-20T00:01:02Z"},{"alias_kind":"arxiv_version","alias_value":"2605.15513v1","created_at":"2026-05-20T00:01:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.15513","created_at":"2026-05-20T00:01:02Z"},{"alias_kind":"pith_short_12","alias_value":"QZEGLJK3QZ66","created_at":"2026-05-20T00:01:02Z"},{"alias_kind":"pith_short_16","alias_value":"QZEGLJK3QZ66X3XP","created_at":"2026-05-20T00:01:02Z"},{"alias_kind":"pith_short_8","alias_value":"QZEGLJK3","created_at":"2026-05-20T00:01:02Z"}],"graph_snapshots":[{"event_id":"sha256:3c2d831db87a1502713ad0251e5f23e95375de5fff309526c8eb023aedc5f110","target":"graph","created_at":"2026-05-20T00:01:02Z","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":"On four self-verifying models and five reasoning benchmarks, CAPS outperforms the leading pairwise verifier on 14 of 20 suites while using 25.4% of its verifier-token budget on code, and outperforms pointwise self-verification on all 20."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"The verifier's accuracy at partial versus full evidence remains high enough that early-stage decisions in the cascade do not introduce irrecoverable errors; this is invoked in the description of the four-stage cascade and the optional rescue subroutine."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"CAPS is a four-stage inference-only cascade that adapts how much of each solution the verifier sees and how comparisons are distributed, halving per-candidate verifier tokens while outperforming uniform pairwise verification on most benchmarks."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"CAPS uses a four-stage cascade to adapt evidence and pair selection so pairwise verification costs far less while selecting better answers."}],"snapshot_sha256":"fa52d563f5c2074a329110afe165bbc1e9cb6b47f8186194196e49ba6b253ce0"},"formal_canon":{"evidence_count":1,"snapshot_sha256":"2e3d77ff6ce5f06414233c54cbf8b1da1f15c0b3bd96ad386323edc93ce00f19"},"integrity":{"available":true,"clean":true,"detectors_run":[{"findings_count":0,"name":"doi_title_agreement","ran_at":"2026-05-19T16:01:17.907021Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"doi_compliance","ran_at":"2026-05-19T15:40:36.388206Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"cited_work_retraction","ran_at":"2026-05-19T14:51:54.858393Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"claim_evidence","ran_at":"2026-05-19T14:21:54.054171Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"shingle_duplication","ran_at":"2026-05-19T13:49:41.847657Z","status":"skipped","version":"0.1.0"},{"findings_count":0,"name":"citation_quote_validity","ran_at":"2026-05-19T13:49:41.386573Z","status":"skipped","version":"0.1.0"},{"findings_count":0,"name":"ai_meta_artifact","ran_at":"2026-05-19T13:33:22.633955Z","status":"skipped","version":"1.0.0"}],"endpoint":"/pith/2605.15513/integrity.json","findings":[],"snapshot_sha256":"f186245df29a376fe5507fc0165a6508f61fea085b0e689e42042119ec005bc6","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Parallel reasoning, where a generator samples many candidate solutions and an aggregator selects the best, is one of the most effective forms of test-time scaling in large language models, and pairwise self-verification has become its strongest aggregation primitive. Yet pairwise verification carries a heavy cost: each judgment reads two complete solutions in full, and existing methods perform tens of such judgments per problem regardless of whether the comparison is informative. We introduce CAPS (Cascaded Adaptive Pairwise Selection), an inference-only framework that allocates verifier compu","authors_text":"Fangzhou Lin, Haichong Zhang, Kazunori Yamada, Peiran Li, Qianwen Ge, Shuo Xing, Siyuan Yang, Zhengzhong Tu, Ziming Zhang","cross_cats":[],"headline":"CAPS uses a four-stage cascade to adapt evidence and pair selection so pairwise verification costs far less while selecting better answers.","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.AI","submitted_at":"2026-05-15T01:16:12Z","title":"CAPS: Cascaded Adaptive Pairwise Selection for Efficient Parallel Reasoning"},"references":{"count":65,"internal_anchors":13,"resolved_work":65,"sample":[{"cited_arxiv_id":"2508.10925","doi":"","is_internal_anchor":true,"ref_index":1,"title":"gpt-oss-120b & gpt-oss-20b Model Card","work_id":"178c1f7e-4f19-4392-a45d-45a6dfa88ead","year":2025},{"cited_arxiv_id":"2505.23281","doi":"","is_internal_anchor":true,"ref_index":2,"title":"MathArena: Evaluating LLMs on Uncontaminated Math Competitions","work_id":"61e8d872-ccc7-46b8-8ec1-94008704c941","year":2025},{"cited_arxiv_id":"2407.21787","doi":"","is_internal_anchor":true,"ref_index":3,"title":"Large Language Monkeys: Scaling Inference Compute with Repeated Sampling","work_id":"b124064d-5a56-42ad-86f5-3cc349b86a3a","year":2024},{"cited_arxiv_id":"2107.03374","doi":"","is_internal_anchor":true,"ref_index":4,"title":"Evaluating Large Language Models Trained on Code","work_id":"042493e9-b26f-4b4e-bbde-382072ca9b08","year":2021},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":5,"title":"Universal self-consistency for large language model generation","work_id":"9d1484c2-6ca2-4421-8b90-995b3adbc93c","year":2023}],"snapshot_sha256":"9e5587cf4c45924fc63fbd018d43586f2e82ae000c6c7bee07a67e2963e273d5"},"source":{"id":"2605.15513","kind":"arxiv","version":1},"verdict":{"created_at":"2026-05-19T15:35:05.163741Z","id":"1e7c6be4-fdec-4581-9810-d919ab83f054","model_set":{"reader":"grok-4.3"},"one_line_summary":"CAPS is a four-stage inference-only cascade that adapts how much of each solution the verifier sees and how comparisons are distributed, halving per-candidate verifier tokens while outperforming uniform pairwise verification on most benchmarks.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"CAPS uses a four-stage cascade to adapt evidence and pair selection so pairwise verification costs far less while selecting better answers.","strongest_claim":"On four self-verifying models and five reasoning benchmarks, CAPS outperforms the leading pairwise verifier on 14 of 20 suites while using 25.4% of its verifier-token budget on code, and outperforms pointwise self-verification on all 20.","weakest_assumption":"The verifier's accuracy at partial versus full evidence remains high enough that early-stage decisions in the cascade do not introduce irrecoverable errors; this is invoked in the description of the four-stage cascade and the optional rescue subroutine."}},"verdict_id":"1e7c6be4-fdec-4581-9810-d919ab83f054"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:ab1693ae54f7a52713b7b45b59c4610ae552edb41f91445f213d5866aa1f42ac","target":"record","created_at":"2026-05-20T00:01:02Z","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":"6ace4a5c8d287c180dc64f30324a82de6ef52b94149ced58c899fe87c0ef5975","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.AI","submitted_at":"2026-05-15T01:16:12Z","title_canon_sha256":"54277e13d70bd6b643130666afa2e5fd9126a0145533b2ddd8d918e440a12a3b"},"schema_version":"1.0","source":{"id":"2605.15513","kind":"arxiv","version":1}},"canonical_sha256":"864865a55b867debeeefd47e54c9268c8ce8b74cc647b64978e1626506c02943","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"864865a55b867debeeefd47e54c9268c8ce8b74cc647b64978e1626506c02943","first_computed_at":"2026-05-20T00:01:02.525081Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-20T00:01:02.525081Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"c8V3m4lrvnCgQzR78k4lHCuSpnGUr8ZH2V2y7CK8Wm5l2q3c6gSwhAmdOjha92yJZA2jPMyV1JdbA0PqS8bnCQ==","signature_status":"signed_v1","signed_at":"2026-05-20T00:01:02.526096Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.15513","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ab1693ae54f7a52713b7b45b59c4610ae552edb41f91445f213d5866aa1f42ac","sha256:3c2d831db87a1502713ad0251e5f23e95375de5fff309526c8eb023aedc5f110"],"state_sha256":"5085809cc97f1db594165f310aaf3509d50ea14eac3f63b0a2b79cc8535958d4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"A/bgBNwItAjpSHvGnC08iOzRdbXa1/wFJIKrfzlt8gnETFZhcMkOoJayYpEw+jCZwHP+z52GVZBXbJTK8vQSCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T18:02:47.376897Z","bundle_sha256":"8e9f77853ddeac1610af6c63c9b8e54730a84bffe151c1039d296bc5d5412028"}}