{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:R3VRS2G4J4YR33O4C6TWZZTMH5","short_pith_number":"pith:R3VRS2G4","canonical_record":{"source":{"id":"2605.16601","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2026-05-15T20:02:31Z","cross_cats_sorted":[],"title_canon_sha256":"21fe605f56876ee295bfd82d3761f32d28284bfc7b58610d70e6c99b12b8dea5","abstract_canon_sha256":"e37af294765f3332831a31b5d199d23ce5a43855b0f7246a7e9d1ecd17d50624"},"schema_version":"1.0"},"canonical_sha256":"8eeb1968dc4f311deddc17a76ce66c3f4ecd365ad020e77859a1aa07823dfd9c","source":{"kind":"arxiv","id":"2605.16601","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.16601","created_at":"2026-05-20T00:02:31Z"},{"alias_kind":"arxiv_version","alias_value":"2605.16601v1","created_at":"2026-05-20T00:02:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.16601","created_at":"2026-05-20T00:02:31Z"},{"alias_kind":"pith_short_12","alias_value":"R3VRS2G4J4YR","created_at":"2026-05-20T00:02:31Z"},{"alias_kind":"pith_short_16","alias_value":"R3VRS2G4J4YR33O4","created_at":"2026-05-20T00:02:31Z"},{"alias_kind":"pith_short_8","alias_value":"R3VRS2G4","created_at":"2026-05-20T00:02:31Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:R3VRS2G4J4YR33O4C6TWZZTMH5","target":"record","payload":{"canonical_record":{"source":{"id":"2605.16601","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2026-05-15T20:02:31Z","cross_cats_sorted":[],"title_canon_sha256":"21fe605f56876ee295bfd82d3761f32d28284bfc7b58610d70e6c99b12b8dea5","abstract_canon_sha256":"e37af294765f3332831a31b5d199d23ce5a43855b0f7246a7e9d1ecd17d50624"},"schema_version":"1.0"},"canonical_sha256":"8eeb1968dc4f311deddc17a76ce66c3f4ecd365ad020e77859a1aa07823dfd9c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-20T00:02:31.954422Z","signature_b64":"7pNpxbHI9MLXmlIEwL+vaj1s46I4YRMVSuUD0lhD5HHY5S/rAmckBAftYmZ7Zn04h22M7uYg2CkXllCuF/fmAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8eeb1968dc4f311deddc17a76ce66c3f4ecd365ad020e77859a1aa07823dfd9c","last_reissued_at":"2026-05-20T00:02:31.953562Z","signature_status":"signed_v1","first_computed_at":"2026-05-20T00:02:31.953562Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2605.16601","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:02:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lrsYwZNE1eP9Egmw3Mdwc5Z5btkCIdUlCog6dngnieqCPdHLE8cV6OgSUgRIUerJxUMILZq9QvadSjexlri8AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T02:47:35.888388Z"},"content_sha256":"2bc8ae72e7da9b5171c748f6fe8cee1882510488a3d9d6d44a675f0314934e12","schema_version":"1.0","event_id":"sha256:2bc8ae72e7da9b5171c748f6fe8cee1882510488a3d9d6d44a675f0314934e12"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:R3VRS2G4J4YR33O4C6TWZZTMH5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Online Contract Selection for Continual Coverage","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"For i.i.d. prices, quantile-threshold algorithms achieve an exact asymptotic competitive ratio of 2.472 in the deferred contract model and improve the concurrent-model bounds to 4.179.","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Qinge Chi, Sebastian Perez-Salazar","submitted_at":"2026-05-15T20:02:31Z","abstract_excerpt":"Motivated by applications where a system must remain operational via continual procurement of contracts, we study two online contract selection problems under uncertain prices. At each time step, a price drawn from a known distribution is revealed online, and the decision-maker may initiate a contract of arbitrary duration, incurring a cost equal to the product of the price and the contract length; moreover, every time period must be covered by at least one active contract. We consider two models depending on how contracts cover time: a \\emph{deferred model}, in which contracts are queued back"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"For the deferred model with i.i.d. prices, the worst-case optimal competitive ratio is exactly characterized and asymptotically ζ* ≈ 2.472; for the concurrent model a lower bound of ζ* and an asymptotic upper bound of 4.179 are proved, improving prior bounds of 2.148 and 6.052, while no finite competitive ratio exists when prices are independent but not identically distributed.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"The price distribution is known in advance and prices are i.i.d., which enables the quantile-based threshold algorithms and the LP-duality analysis in quantile space; the modeling choice that every period must be covered by at least one active contract is also load-bearing for the competitive ratio definitions.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"Derives asymptotic competitive ratio of approximately 2.472 for deferred model and bounds from 2.472 to 4.179 for concurrent model under i.i.d. prices, with no finite ratio possible for independent but non-identical prices.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"For i.i.d. prices, quantile-threshold algorithms achieve an exact asymptotic competitive ratio of 2.472 in the deferred contract model and improve the concurrent-model bounds to 4.179.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"8a92ddbc605ad9c789a842225a6b218e1012c593adfa7e37f16bb56d34649f01"},"source":{"id":"2605.16601","kind":"arxiv","version":1},"verdict":{"id":"d14f9d39-94f7-4203-bb64-515baec90490","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-19T21:06:01.862528Z","strongest_claim":"For the deferred model with i.i.d. prices, the worst-case optimal competitive ratio is exactly characterized and asymptotically ζ* ≈ 2.472; for the concurrent model a lower bound of ζ* and an asymptotic upper bound of 4.179 are proved, improving prior bounds of 2.148 and 6.052, while no finite competitive ratio exists when prices are independent but not identically distributed.","one_line_summary":"Derives asymptotic competitive ratio of approximately 2.472 for deferred model and bounds from 2.472 to 4.179 for concurrent model under i.i.d. prices, with no finite ratio possible for independent but non-identical prices.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"The price distribution is known in advance and prices are i.i.d., which enables the quantile-based threshold algorithms and the LP-duality analysis in quantile space; the modeling choice that every period must be covered by at least one active contract is also load-bearing for the competitive ratio definitions.","pith_extraction_headline":"For i.i.d. prices, quantile-threshold algorithms achieve an exact asymptotic competitive ratio of 2.472 in the deferred contract model and improve the concurrent-model bounds to 4.179."},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2605.16601/integrity.json","findings":[],"available":true,"detectors_run":[{"name":"doi_title_agreement","ran_at":"2026-05-19T21:31:19.428877Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"doi_compliance","ran_at":"2026-05-19T21:12:02.456508Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"claim_evidence","ran_at":"2026-05-19T19:21:56.813956Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"ai_meta_artifact","ran_at":"2026-05-19T18:33:26.600784Z","status":"skipped","version":"1.0.0","findings_count":0}],"snapshot_sha256":"760077da51b339d32c4b4d44fec7837845e778ffaf93209c197adb3291a9f29e"},"references":{"count":59,"sample":[{"doi":"","year":null,"title":"Hiring Secretaries over Time: The Benefit of Concurrent Employment , year=","work_id":"9df6f3c5-1f36-4bad-a79f-99f33c17ab24","ref_index":1,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2024,"title":"Optimal Guarantees for Online Selection Over Time , author=. 2024 , eprint=","work_id":"7bd725a7-c5c0-4676-b7ec-8b1c7863f753","ref_index":2,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":null,"title":"Alan S. Manne , journal=. Linear Programming and Sequential Decisions , year=","work_id":"eb5ef149-954d-4a4f-8ba2-89bbc465d6ec","ref_index":3,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":null,"title":"EC'21: Proceedings of the 22nd ACM Conference on Economics and Computation , publisher =","work_id":"9eb562be-072f-4e37-98b5-e4f28a9d8fb6","ref_index":4,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2025,"title":"ACM Transactions on Economics and Computation , volume=","work_id":"7b9bcefd-a0bc-48a6-a733-c1efcff0706c","ref_index":5,"cited_arxiv_id":"","is_internal_anchor":false}],"resolved_work":59,"snapshot_sha256":"d1e93acd2e2230ef5363c3df70088254e38194412f190cbe8b3c7514d6e183a8","internal_anchors":0},"formal_canon":{"evidence_count":2,"snapshot_sha256":"268b73f46a32ecbf90d228f5243771f4e3af1be07b8ceebca6be601be57ecc08"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"verdict_id":"d14f9d39-94f7-4203-bb64-515baec90490"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-20T00:02:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"y5hUD9Qi16HpUpDD7RCZ+A4O26B1HGyXyFN5UbJ2YiZsYJ9e8G5ygawPdJEA3U7gFoSXnOXjr2xt4JgLBxYiAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T02:47:35.889932Z"},"content_sha256":"dfc31e272d646e36b1e4a01574d2cb6d287709ff0718e011891ee9bc43af8fac","schema_version":"1.0","event_id":"sha256:dfc31e272d646e36b1e4a01574d2cb6d287709ff0718e011891ee9bc43af8fac"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/R3VRS2G4J4YR33O4C6TWZZTMH5/bundle.json","state_url":"https://pith.science/pith/R3VRS2G4J4YR33O4C6TWZZTMH5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/R3VRS2G4J4YR33O4C6TWZZTMH5/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-11T02:47:35Z","links":{"resolver":"https://pith.science/pith/R3VRS2G4J4YR33O4C6TWZZTMH5","bundle":"https://pith.science/pith/R3VRS2G4J4YR33O4C6TWZZTMH5/bundle.json","state":"https://pith.science/pith/R3VRS2G4J4YR33O4C6TWZZTMH5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/R3VRS2G4J4YR33O4C6TWZZTMH5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:R3VRS2G4J4YR33O4C6TWZZTMH5","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":"e37af294765f3332831a31b5d199d23ce5a43855b0f7246a7e9d1ecd17d50624","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2026-05-15T20:02:31Z","title_canon_sha256":"21fe605f56876ee295bfd82d3761f32d28284bfc7b58610d70e6c99b12b8dea5"},"schema_version":"1.0","source":{"id":"2605.16601","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.16601","created_at":"2026-05-20T00:02:31Z"},{"alias_kind":"arxiv_version","alias_value":"2605.16601v1","created_at":"2026-05-20T00:02:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.16601","created_at":"2026-05-20T00:02:31Z"},{"alias_kind":"pith_short_12","alias_value":"R3VRS2G4J4YR","created_at":"2026-05-20T00:02:31Z"},{"alias_kind":"pith_short_16","alias_value":"R3VRS2G4J4YR33O4","created_at":"2026-05-20T00:02:31Z"},{"alias_kind":"pith_short_8","alias_value":"R3VRS2G4","created_at":"2026-05-20T00:02:31Z"}],"graph_snapshots":[{"event_id":"sha256:dfc31e272d646e36b1e4a01574d2cb6d287709ff0718e011891ee9bc43af8fac","target":"graph","created_at":"2026-05-20T00:02: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":"For the deferred model with i.i.d. prices, the worst-case optimal competitive ratio is exactly characterized and asymptotically ζ* ≈ 2.472; for the concurrent model a lower bound of ζ* and an asymptotic upper bound of 4.179 are proved, improving prior bounds of 2.148 and 6.052, while no finite competitive ratio exists when prices are independent but not identically distributed."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"The price distribution is known in advance and prices are i.i.d., which enables the quantile-based threshold algorithms and the LP-duality analysis in quantile space; the modeling choice that every period must be covered by at least one active contract is also load-bearing for the competitive ratio definitions."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"Derives asymptotic competitive ratio of approximately 2.472 for deferred model and bounds from 2.472 to 4.179 for concurrent model under i.i.d. prices, with no finite ratio possible for independent but non-identical prices."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"For i.i.d. prices, quantile-threshold algorithms achieve an exact asymptotic competitive ratio of 2.472 in the deferred contract model and improve the concurrent-model bounds to 4.179."}],"snapshot_sha256":"8a92ddbc605ad9c789a842225a6b218e1012c593adfa7e37f16bb56d34649f01"},"formal_canon":{"evidence_count":2,"snapshot_sha256":"268b73f46a32ecbf90d228f5243771f4e3af1be07b8ceebca6be601be57ecc08"},"integrity":{"available":true,"clean":true,"detectors_run":[{"findings_count":0,"name":"doi_title_agreement","ran_at":"2026-05-19T21:31:19.428877Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"doi_compliance","ran_at":"2026-05-19T21:12:02.456508Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"claim_evidence","ran_at":"2026-05-19T19:21:56.813956Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"ai_meta_artifact","ran_at":"2026-05-19T18:33:26.600784Z","status":"skipped","version":"1.0.0"}],"endpoint":"/pith/2605.16601/integrity.json","findings":[],"snapshot_sha256":"760077da51b339d32c4b4d44fec7837845e778ffaf93209c197adb3291a9f29e","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Motivated by applications where a system must remain operational via continual procurement of contracts, we study two online contract selection problems under uncertain prices. At each time step, a price drawn from a known distribution is revealed online, and the decision-maker may initiate a contract of arbitrary duration, incurring a cost equal to the product of the price and the contract length; moreover, every time period must be covered by at least one active contract. We consider two models depending on how contracts cover time: a \\emph{deferred model}, in which contracts are queued back","authors_text":"Qinge Chi, Sebastian Perez-Salazar","cross_cats":[],"headline":"For i.i.d. prices, quantile-threshold algorithms achieve an exact asymptotic competitive ratio of 2.472 in the deferred contract model and improve the concurrent-model bounds to 4.179.","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2026-05-15T20:02:31Z","title":"Online Contract Selection for Continual Coverage"},"references":{"count":59,"internal_anchors":0,"resolved_work":59,"sample":[{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":1,"title":"Hiring Secretaries over Time: The Benefit of Concurrent Employment , year=","work_id":"9df6f3c5-1f36-4bad-a79f-99f33c17ab24","year":null},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":2,"title":"Optimal Guarantees for Online Selection Over Time , author=. 2024 , eprint=","work_id":"7bd725a7-c5c0-4676-b7ec-8b1c7863f753","year":2024},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":3,"title":"Alan S. Manne , journal=. Linear Programming and Sequential Decisions , year=","work_id":"eb5ef149-954d-4a4f-8ba2-89bbc465d6ec","year":null},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":4,"title":"EC'21: Proceedings of the 22nd ACM Conference on Economics and Computation , publisher =","work_id":"9eb562be-072f-4e37-98b5-e4f28a9d8fb6","year":null},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":5,"title":"ACM Transactions on Economics and Computation , volume=","work_id":"7b9bcefd-a0bc-48a6-a733-c1efcff0706c","year":2025}],"snapshot_sha256":"d1e93acd2e2230ef5363c3df70088254e38194412f190cbe8b3c7514d6e183a8"},"source":{"id":"2605.16601","kind":"arxiv","version":1},"verdict":{"created_at":"2026-05-19T21:06:01.862528Z","id":"d14f9d39-94f7-4203-bb64-515baec90490","model_set":{"reader":"grok-4.3"},"one_line_summary":"Derives asymptotic competitive ratio of approximately 2.472 for deferred model and bounds from 2.472 to 4.179 for concurrent model under i.i.d. prices, with no finite ratio possible for independent but non-identical prices.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"For i.i.d. prices, quantile-threshold algorithms achieve an exact asymptotic competitive ratio of 2.472 in the deferred contract model and improve the concurrent-model bounds to 4.179.","strongest_claim":"For the deferred model with i.i.d. prices, the worst-case optimal competitive ratio is exactly characterized and asymptotically ζ* ≈ 2.472; for the concurrent model a lower bound of ζ* and an asymptotic upper bound of 4.179 are proved, improving prior bounds of 2.148 and 6.052, while no finite competitive ratio exists when prices are independent but not identically distributed.","weakest_assumption":"The price distribution is known in advance and prices are i.i.d., which enables the quantile-based threshold algorithms and the LP-duality analysis in quantile space; the modeling choice that every period must be covered by at least one active contract is also load-bearing for the competitive ratio definitions."}},"verdict_id":"d14f9d39-94f7-4203-bb64-515baec90490"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:2bc8ae72e7da9b5171c748f6fe8cee1882510488a3d9d6d44a675f0314934e12","target":"record","created_at":"2026-05-20T00:02: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":"e37af294765f3332831a31b5d199d23ce5a43855b0f7246a7e9d1ecd17d50624","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2026-05-15T20:02:31Z","title_canon_sha256":"21fe605f56876ee295bfd82d3761f32d28284bfc7b58610d70e6c99b12b8dea5"},"schema_version":"1.0","source":{"id":"2605.16601","kind":"arxiv","version":1}},"canonical_sha256":"8eeb1968dc4f311deddc17a76ce66c3f4ecd365ad020e77859a1aa07823dfd9c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8eeb1968dc4f311deddc17a76ce66c3f4ecd365ad020e77859a1aa07823dfd9c","first_computed_at":"2026-05-20T00:02:31.953562Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-20T00:02:31.953562Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"7pNpxbHI9MLXmlIEwL+vaj1s46I4YRMVSuUD0lhD5HHY5S/rAmckBAftYmZ7Zn04h22M7uYg2CkXllCuF/fmAw==","signature_status":"signed_v1","signed_at":"2026-05-20T00:02:31.954422Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.16601","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2bc8ae72e7da9b5171c748f6fe8cee1882510488a3d9d6d44a675f0314934e12","sha256:dfc31e272d646e36b1e4a01574d2cb6d287709ff0718e011891ee9bc43af8fac"],"state_sha256":"d9e8e05d496a4b424b72d2f155c0072f4f200f0663a6f8cab57a9ad03de97250"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zliqDdKkm3ixWyT7VZFmyauo8YpNxV3tRrXF/1eA+JXPQzbi/hxOeEHNR4uIDAAo2vtMngq1Fv6Mvk9Bxs1aBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T02:47:35.895856Z","bundle_sha256":"2345bc228932663ad2967961d54ffd061adcb81c45d7ad2b5f14c0d4e3e8a3b9"}}