{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:E52E6VHAGHDD4G7VNWAIPYBZ2I","short_pith_number":"pith:E52E6VHA","canonical_record":{"source":{"id":"2606.24980","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.LG","submitted_at":"2026-06-23T13:02:06Z","cross_cats_sorted":[],"title_canon_sha256":"843da95197b48894b726c4d69cd97204a3268e2f0bb9d8dd545490fb2f8d4356","abstract_canon_sha256":"27203b55e2f3255b86decdfb2a008a1a756b3805105b7dd568c18972cfa00258"},"schema_version":"1.0"},"canonical_sha256":"27744f54e031c63e1bf56d8087e039d208f70e5e9319040e6b44a35e5090295b","source":{"kind":"arxiv","id":"2606.24980","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.24980","created_at":"2026-06-25T00:17:47Z"},{"alias_kind":"arxiv_version","alias_value":"2606.24980v1","created_at":"2026-06-25T00:17:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.24980","created_at":"2026-06-25T00:17:47Z"},{"alias_kind":"pith_short_12","alias_value":"E52E6VHAGHDD","created_at":"2026-06-25T00:17:47Z"},{"alias_kind":"pith_short_16","alias_value":"E52E6VHAGHDD4G7V","created_at":"2026-06-25T00:17:47Z"},{"alias_kind":"pith_short_8","alias_value":"E52E6VHA","created_at":"2026-06-25T00:17:47Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:E52E6VHAGHDD4G7VNWAIPYBZ2I","target":"record","payload":{"canonical_record":{"source":{"id":"2606.24980","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.LG","submitted_at":"2026-06-23T13:02:06Z","cross_cats_sorted":[],"title_canon_sha256":"843da95197b48894b726c4d69cd97204a3268e2f0bb9d8dd545490fb2f8d4356","abstract_canon_sha256":"27203b55e2f3255b86decdfb2a008a1a756b3805105b7dd568c18972cfa00258"},"schema_version":"1.0"},"canonical_sha256":"27744f54e031c63e1bf56d8087e039d208f70e5e9319040e6b44a35e5090295b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-25T00:17:47.410919Z","signature_b64":"EZwY9TlSwtluR3VWXXGYXT/+bpTSvCxI/NYAHgxUD5Jrms1/iCHiNPX0qHTt5xo8OUk7NhalaifpJhBQJXWKDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"27744f54e031c63e1bf56d8087e039d208f70e5e9319040e6b44a35e5090295b","last_reissued_at":"2026-06-25T00:17:47.410479Z","signature_status":"signed_v1","first_computed_at":"2026-06-25T00:17:47.410479Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2606.24980","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-25T00:17:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HH5NEYmCeGewlH4AMwib9I9MoYi7XN5CT8l2VsK6oSsiCWnxB0B7kSOmYwVoRMQ24Rm7+2S3bvFKCFZB6RJRDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-03T19:45:33.270797Z"},"content_sha256":"54422184393ddd40d8cdc24dbd6e74c5db2fc58ab39fbdfa27a6c91f7cb5d2fb","schema_version":"1.0","event_id":"sha256:54422184393ddd40d8cdc24dbd6e74c5db2fc58ab39fbdfa27a6c91f7cb5d2fb"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:E52E6VHAGHDD4G7VNWAIPYBZ2I","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Closed-Loop Graph Algorithm Execution with Small Language Models: Step Accuracy and Rollout Reliability","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Michal Podstawski","submitted_at":"2026-06-23T13:02:06Z","abstract_excerpt":"Small language models offer an efficient alternative to large-scale systems, but their ability to execute structured algorithms over multiple dependent decisions remains poorly understood. We study graph algorithm execution as a closed-loop prediction problem in which a model repeatedly selects the next action from the current graph and algorithmic state. Our evaluation framework covers several classical graph procedures, multiple synthetic graph families, and disjoint training, validation, and test partitions. It assesses both local decision quality and global execution behaviour using step a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.24980","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.24980/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-25T00:17:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QgKGIJ0mNhTfbIut4GReRqk4BK3dkM0Oq97jzu+AJIeq/Nn+72jTw90/Jxuk1VWagoXk2tSFciaTZ+yR5LyiAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-03T19:45:33.271648Z"},"content_sha256":"b256e438e4fdb8ab6f792801ea72d4e43670ad229fb1b11aea65dcede220f7fd","schema_version":"1.0","event_id":"sha256:b256e438e4fdb8ab6f792801ea72d4e43670ad229fb1b11aea65dcede220f7fd"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/E52E6VHAGHDD4G7VNWAIPYBZ2I/bundle.json","state_url":"https://pith.science/pith/E52E6VHAGHDD4G7VNWAIPYBZ2I/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/E52E6VHAGHDD4G7VNWAIPYBZ2I/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-08-03T19:45:33Z","links":{"resolver":"https://pith.science/pith/E52E6VHAGHDD4G7VNWAIPYBZ2I","bundle":"https://pith.science/pith/E52E6VHAGHDD4G7VNWAIPYBZ2I/bundle.json","state":"https://pith.science/pith/E52E6VHAGHDD4G7VNWAIPYBZ2I/state.json","well_known_bundle":"https://pith.science/.well-known/pith/E52E6VHAGHDD4G7VNWAIPYBZ2I/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:E52E6VHAGHDD4G7VNWAIPYBZ2I","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":"27203b55e2f3255b86decdfb2a008a1a756b3805105b7dd568c18972cfa00258","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.LG","submitted_at":"2026-06-23T13:02:06Z","title_canon_sha256":"843da95197b48894b726c4d69cd97204a3268e2f0bb9d8dd545490fb2f8d4356"},"schema_version":"1.0","source":{"id":"2606.24980","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.24980","created_at":"2026-06-25T00:17:47Z"},{"alias_kind":"arxiv_version","alias_value":"2606.24980v1","created_at":"2026-06-25T00:17:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.24980","created_at":"2026-06-25T00:17:47Z"},{"alias_kind":"pith_short_12","alias_value":"E52E6VHAGHDD","created_at":"2026-06-25T00:17:47Z"},{"alias_kind":"pith_short_16","alias_value":"E52E6VHAGHDD4G7V","created_at":"2026-06-25T00:17:47Z"},{"alias_kind":"pith_short_8","alias_value":"E52E6VHA","created_at":"2026-06-25T00:17:47Z"}],"graph_snapshots":[{"event_id":"sha256:b256e438e4fdb8ab6f792801ea72d4e43670ad229fb1b11aea65dcede220f7fd","target":"graph","created_at":"2026-06-25T00:17:47Z","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.24980/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Small language models offer an efficient alternative to large-scale systems, but their ability to execute structured algorithms over multiple dependent decisions remains poorly understood. We study graph algorithm execution as a closed-loop prediction problem in which a model repeatedly selects the next action from the current graph and algorithmic state. Our evaluation framework covers several classical graph procedures, multiple synthetic graph families, and disjoint training, validation, and test partitions. It assesses both local decision quality and global execution behaviour using step a","authors_text":"Michal Podstawski","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.LG","submitted_at":"2026-06-23T13:02:06Z","title":"Closed-Loop Graph Algorithm Execution with Small Language Models: Step Accuracy and Rollout Reliability"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.24980","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:54422184393ddd40d8cdc24dbd6e74c5db2fc58ab39fbdfa27a6c91f7cb5d2fb","target":"record","created_at":"2026-06-25T00:17:47Z","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":"27203b55e2f3255b86decdfb2a008a1a756b3805105b7dd568c18972cfa00258","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.LG","submitted_at":"2026-06-23T13:02:06Z","title_canon_sha256":"843da95197b48894b726c4d69cd97204a3268e2f0bb9d8dd545490fb2f8d4356"},"schema_version":"1.0","source":{"id":"2606.24980","kind":"arxiv","version":1}},"canonical_sha256":"27744f54e031c63e1bf56d8087e039d208f70e5e9319040e6b44a35e5090295b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"27744f54e031c63e1bf56d8087e039d208f70e5e9319040e6b44a35e5090295b","first_computed_at":"2026-06-25T00:17:47.410479Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-25T00:17:47.410479Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"EZwY9TlSwtluR3VWXXGYXT/+bpTSvCxI/NYAHgxUD5Jrms1/iCHiNPX0qHTt5xo8OUk7NhalaifpJhBQJXWKDw==","signature_status":"signed_v1","signed_at":"2026-06-25T00:17:47.410919Z","signed_message":"canonical_sha256_bytes"},"source_id":"2606.24980","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:54422184393ddd40d8cdc24dbd6e74c5db2fc58ab39fbdfa27a6c91f7cb5d2fb","sha256:b256e438e4fdb8ab6f792801ea72d4e43670ad229fb1b11aea65dcede220f7fd"],"state_sha256":"87128952676d46047500f188283adc485c2c3f47adbf3d9b2275a06b5eaee885"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PTo5kgvapnjbMeo1Ia9eebv3UtIyOEazu92CY5iLgtHgnX5wV7/GKViGkRG4X957VT3Eqhp+CNVnyKU4SlEDCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-03T19:45:33.278445Z","bundle_sha256":"1f63b09f7c9963ba7f1318fc76ca232468f170b952f694d565d9c6b79e3f6744"}}