{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:XVMZFKRQNJ7GLEFFAHTWHOKATZ","short_pith_number":"pith:XVMZFKRQ","canonical_record":{"source":{"id":"2605.22879","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2026-05-20T17:43:56Z","cross_cats_sorted":[],"title_canon_sha256":"a91a3b87862cd2b230ed42c99556f7693112cf03fb0fd2a871e27841bab4cc70","abstract_canon_sha256":"f1736a82e367971dce6b062c4cff3647c8da2d432522a38666bb5d3c567b747f"},"schema_version":"1.0"},"canonical_sha256":"bd5992aa306a7e6590a501e763b9409e7814a475b72e25bbffe51300b82ee9d9","source":{"kind":"arxiv","id":"2605.22879","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.22879","created_at":"2026-05-25T02:01:28Z"},{"alias_kind":"arxiv_version","alias_value":"2605.22879v1","created_at":"2026-05-25T02:01:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.22879","created_at":"2026-05-25T02:01:28Z"},{"alias_kind":"pith_short_12","alias_value":"XVMZFKRQNJ7G","created_at":"2026-05-25T02:01:28Z"},{"alias_kind":"pith_short_16","alias_value":"XVMZFKRQNJ7GLEFF","created_at":"2026-05-25T02:01:28Z"},{"alias_kind":"pith_short_8","alias_value":"XVMZFKRQ","created_at":"2026-05-25T02:01:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:XVMZFKRQNJ7GLEFFAHTWHOKATZ","target":"record","payload":{"canonical_record":{"source":{"id":"2605.22879","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2026-05-20T17:43:56Z","cross_cats_sorted":[],"title_canon_sha256":"a91a3b87862cd2b230ed42c99556f7693112cf03fb0fd2a871e27841bab4cc70","abstract_canon_sha256":"f1736a82e367971dce6b062c4cff3647c8da2d432522a38666bb5d3c567b747f"},"schema_version":"1.0"},"canonical_sha256":"bd5992aa306a7e6590a501e763b9409e7814a475b72e25bbffe51300b82ee9d9","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-25T02:01:28.359467Z","signature_b64":"MI+xfSv2aJKqh6bfOs2Bts7ymOBv2l5naIrIwCZGoWWiBZOxWEmZ3AzKaJFbEq3her/tKHYJhdAQh5GznA2nDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bd5992aa306a7e6590a501e763b9409e7814a475b72e25bbffe51300b82ee9d9","last_reissued_at":"2026-05-25T02:01:28.358758Z","signature_status":"signed_v1","first_computed_at":"2026-05-25T02:01:28.358758Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2605.22879","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-25T02:01:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"r5SsXAjp2bvO/BNhuL/BmCisA1/uGFy6ny0LrI8amUr74kkDzsV/vcGQ+OKdh/efHDsuh3t0v+9a1AUQvOFXCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T22:07:59.994645Z"},"content_sha256":"4921cff6563dbabe849c578e88d5a5592a1a7ea0843d42365a9120aba2a45fa8","schema_version":"1.0","event_id":"sha256:4921cff6563dbabe849c578e88d5a5592a1a7ea0843d42365a9120aba2a45fa8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:XVMZFKRQNJ7GLEFFAHTWHOKATZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Budgeted Dynamic Trace Structures for Token-Efficient Sequential Computation","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Faruk Alpay, Levent Sarioglu","submitted_at":"2026-05-20T17:43:56Z","abstract_excerpt":"Sequential computation increasingly produces long traces containing nested branches, status transitions, textual payloads, and compact summaries of earlier execution. This paper introduces budgeted dynamic trace structures (BDTS), a data-structural framework for maintaining rooted trace graphs and append-only histories under an explicit byte or token budget. BDTS combines status-filtered reachability, cursor pagination, soft-capped recency logs, reference-counted observation keys, delta overlays, bounded cost caches, and summary-plus-suffix compaction. We give formal invariants, asymptotic bou"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.22879","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/2605.22879/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-05-25T02:01:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Xv13PZpurdW0dl2ZtUTvo36BI4MFhJ2s79TENwtMCDG9XHVYyzrPyQAypWi7q8BEbeq/4fnLFbX95c9hEgI4AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T22:07:59.995104Z"},"content_sha256":"bf9c96d45f0aaea7b9b7d03cb85fca96b5e26a4717618d99c5b0caf5013fbdd6","schema_version":"1.0","event_id":"sha256:bf9c96d45f0aaea7b9b7d03cb85fca96b5e26a4717618d99c5b0caf5013fbdd6"},{"event_type":"integrity_finding","subject_pith_number":"pith:2026:XVMZFKRQNJ7GLEFFAHTWHOKATZ","target":"integrity","payload":{"note":"DOI in the printed bibliography is fragmented by whitespace or line breaks. A longer candidate (10.1109/FOCS.2004.25.21) was visible in the surrounding text but could not be confirmed against doi.org as printed.","snippet":"Piotr Sankowski. Dynamic transitive closure via dynamic matrix inverse. In45th Annual IEEE Symposium on Foundations of Computer Science, pages 509–517, 2004. doi: 10.1109/FOCS. 2004.25. 21","arxiv_id":"2605.22879","detector":"doi_compliance","evidence":{"ref_index":22,"verdict_class":"incontrovertible","resolved_title":null,"printed_excerpt":"Piotr Sankowski. Dynamic transitive closure via dynamic matrix inverse. In45th Annual IEEE Symposium on Foundations of Computer Science, pages 509–517, 2004. doi: 10.1109/FOCS. 2004.25. 21","reconstructed_doi":"10.1109/FOCS.2004.25.21"},"severity":"advisory","ref_index":22,"audited_at":"2026-05-25T06:19:53.265024Z","event_type":"pith.integrity.v1","detected_doi":"10.1109/FOCS.2004.25.21","detector_url":"https://pith.science/pith-integrity-protocol#doi_compliance","external_url":null,"finding_type":"recoverable_identifier","evidence_hash":"a2b56dcc5239147505d311acbc082191ad107b75ba834724abb7bc7c3a47e2c8","paper_version":1,"verdict_class":"incontrovertible","resolved_title":null,"detector_version":"1.0.0","detected_arxiv_id":null,"integrity_event_id":7508,"payload_sha256":"4a8590dc1e10909e619f0b631ed9ef05264c93a943d3dc9ad29ed5dad3c07d42","signature_b64":"c/tg/26JJh+VQkTBctyGCsfHk4DuLIbham14OaVuBt/eVxf0NYwdx0SnGtTA71TbxWxaCDidPAVDwAKiA/o6CA==","signing_key_id":"pith-v1-2026-05"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-25T06:19:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UueNQmFZH1CP1sPHR1Z9u9s2aACNhrshLiIO/8ZqOficK7ol9tBbVe2MJDzOtLLS3XtugczoVxorMvmoQKkuCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T22:07:59.996732Z"},"content_sha256":"d59012e6573f17adaeb143878c83378b41f6633feb684a754e3228e631846098","schema_version":"1.0","event_id":"sha256:d59012e6573f17adaeb143878c83378b41f6633feb684a754e3228e631846098"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XVMZFKRQNJ7GLEFFAHTWHOKATZ/bundle.json","state_url":"https://pith.science/pith/XVMZFKRQNJ7GLEFFAHTWHOKATZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XVMZFKRQNJ7GLEFFAHTWHOKATZ/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-30T22:07:59Z","links":{"resolver":"https://pith.science/pith/XVMZFKRQNJ7GLEFFAHTWHOKATZ","bundle":"https://pith.science/pith/XVMZFKRQNJ7GLEFFAHTWHOKATZ/bundle.json","state":"https://pith.science/pith/XVMZFKRQNJ7GLEFFAHTWHOKATZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XVMZFKRQNJ7GLEFFAHTWHOKATZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:XVMZFKRQNJ7GLEFFAHTWHOKATZ","merge_version":"pith-open-graph-merge-v1","event_count":3,"valid_event_count":3,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"f1736a82e367971dce6b062c4cff3647c8da2d432522a38666bb5d3c567b747f","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2026-05-20T17:43:56Z","title_canon_sha256":"a91a3b87862cd2b230ed42c99556f7693112cf03fb0fd2a871e27841bab4cc70"},"schema_version":"1.0","source":{"id":"2605.22879","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.22879","created_at":"2026-05-25T02:01:28Z"},{"alias_kind":"arxiv_version","alias_value":"2605.22879v1","created_at":"2026-05-25T02:01:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.22879","created_at":"2026-05-25T02:01:28Z"},{"alias_kind":"pith_short_12","alias_value":"XVMZFKRQNJ7G","created_at":"2026-05-25T02:01:28Z"},{"alias_kind":"pith_short_16","alias_value":"XVMZFKRQNJ7GLEFF","created_at":"2026-05-25T02:01:28Z"},{"alias_kind":"pith_short_8","alias_value":"XVMZFKRQ","created_at":"2026-05-25T02:01:28Z"}],"graph_snapshots":[{"event_id":"sha256:bf9c96d45f0aaea7b9b7d03cb85fca96b5e26a4717618d99c5b0caf5013fbdd6","target":"graph","created_at":"2026-05-25T02:01:28Z","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/2605.22879/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Sequential computation increasingly produces long traces containing nested branches, status transitions, textual payloads, and compact summaries of earlier execution. This paper introduces budgeted dynamic trace structures (BDTS), a data-structural framework for maintaining rooted trace graphs and append-only histories under an explicit byte or token budget. BDTS combines status-filtered reachability, cursor pagination, soft-capped recency logs, reference-counted observation keys, delta overlays, bounded cost caches, and summary-plus-suffix compaction. We give formal invariants, asymptotic bou","authors_text":"Faruk Alpay, Levent Sarioglu","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2026-05-20T17:43:56Z","title":"Budgeted Dynamic Trace Structures for Token-Efficient Sequential Computation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.22879","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:4921cff6563dbabe849c578e88d5a5592a1a7ea0843d42365a9120aba2a45fa8","target":"record","created_at":"2026-05-25T02:01:28Z","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":"f1736a82e367971dce6b062c4cff3647c8da2d432522a38666bb5d3c567b747f","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2026-05-20T17:43:56Z","title_canon_sha256":"a91a3b87862cd2b230ed42c99556f7693112cf03fb0fd2a871e27841bab4cc70"},"schema_version":"1.0","source":{"id":"2605.22879","kind":"arxiv","version":1}},"canonical_sha256":"bd5992aa306a7e6590a501e763b9409e7814a475b72e25bbffe51300b82ee9d9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"bd5992aa306a7e6590a501e763b9409e7814a475b72e25bbffe51300b82ee9d9","first_computed_at":"2026-05-25T02:01:28.358758Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-25T02:01:28.358758Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"MI+xfSv2aJKqh6bfOs2Bts7ymOBv2l5naIrIwCZGoWWiBZOxWEmZ3AzKaJFbEq3her/tKHYJhdAQh5GznA2nDw==","signature_status":"signed_v1","signed_at":"2026-05-25T02:01:28.359467Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.22879","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4921cff6563dbabe849c578e88d5a5592a1a7ea0843d42365a9120aba2a45fa8","sha256:bf9c96d45f0aaea7b9b7d03cb85fca96b5e26a4717618d99c5b0caf5013fbdd6","sha256:d59012e6573f17adaeb143878c83378b41f6633feb684a754e3228e631846098"],"state_sha256":"4aa81a5105b4fdc6d89779d172706ff9ba4ad8699107f4cc9999dd818c929c86"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SIqLnE+akxomX3DGj3WDWlUElKkGBcpE9oqi7XJHfxXufkwkyyRFN1eg65NJ13e/MwiBDJQMBe0+/WRGAVeuCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T22:08:00.000931Z","bundle_sha256":"070be2fe4f9807f91008a9a8f84990fba94163d9d6680afd0ef9caa26fa2080e"}}