{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:DMR6H7AVVDUIBJLOZOB5UX2BNF","short_pith_number":"pith:DMR6H7AV","canonical_record":{"source":{"id":"2607.17005","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AR","submitted_at":"2026-07-18T23:42:59Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"124d73b5e0a1c5fb58a48cc4461749297a1acdea72bdaacc9d96ace67c862da0","abstract_canon_sha256":"7bde515782abca2888180e8ca0cff49ab7a1b35c0f87c110eb2ad0783c338e5c"},"schema_version":"1.0"},"canonical_sha256":"1b23e3fc15a8e880a56ecb83da5f4169499f2bbe2089681a40f3b8860fb3928e","source":{"kind":"arxiv","id":"2607.17005","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.17005","created_at":"2026-07-21T01:21:10Z"},{"alias_kind":"arxiv_version","alias_value":"2607.17005v1","created_at":"2026-07-21T01:21:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.17005","created_at":"2026-07-21T01:21:10Z"},{"alias_kind":"pith_short_12","alias_value":"DMR6H7AVVDUI","created_at":"2026-07-21T01:21:10Z"},{"alias_kind":"pith_short_16","alias_value":"DMR6H7AVVDUIBJLO","created_at":"2026-07-21T01:21:10Z"},{"alias_kind":"pith_short_8","alias_value":"DMR6H7AV","created_at":"2026-07-21T01:21:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:DMR6H7AVVDUIBJLOZOB5UX2BNF","target":"record","payload":{"canonical_record":{"source":{"id":"2607.17005","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AR","submitted_at":"2026-07-18T23:42:59Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"124d73b5e0a1c5fb58a48cc4461749297a1acdea72bdaacc9d96ace67c862da0","abstract_canon_sha256":"7bde515782abca2888180e8ca0cff49ab7a1b35c0f87c110eb2ad0783c338e5c"},"schema_version":"1.0"},"canonical_sha256":"1b23e3fc15a8e880a56ecb83da5f4169499f2bbe2089681a40f3b8860fb3928e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-21T01:21:10.313686Z","signature_b64":"+o0aSiuna1epGBJSSQ28XZAQbXf2JH/h4UZOmc7AfVbPMtIJdns3r/PTIPSEPwnt9D1pV7n7CZ9x9oqYDBvRCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1b23e3fc15a8e880a56ecb83da5f4169499f2bbe2089681a40f3b8860fb3928e","last_reissued_at":"2026-07-21T01:21:10.312814Z","signature_status":"signed_v1","first_computed_at":"2026-07-21T01:21:10.312814Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2607.17005","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-07-21T01:21:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ioTpqF/inJvCP+leGqimp5/ffedhmAsW7UVk7tEud5+Xjp5VRkEBPKiaRDYkIHdWxB9fyesSFdCUrdB0V/LcBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-23T16:11:08.606432Z"},"content_sha256":"9fd5db1f11c6c8eb41890366153bcff9851dff7d5a8e5376aecd31e7b97991fb","schema_version":"1.0","event_id":"sha256:9fd5db1f11c6c8eb41890366153bcff9851dff7d5a8e5376aecd31e7b97991fb"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:DMR6H7AVVDUIBJLOZOB5UX2BNF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Provably Good Prim-Dijkstra Revisited: New Theory and a Practical Algorithm for a Classical VLSI Routing Problem with LLMs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.AR","authors_text":"Keren Zhu","submitted_at":"2026-07-18T23:42:59Z","abstract_excerpt":"Large language models may make precise but dormant algorithmic problems practical to revisit, and may expose new paths toward fundamental ones. We demonstrate this possibility through Prim-Dijkstra routing, a classic VLSI problem whose terminal-only Manhattan complexity remained open despite decades of practical work. We prove weak NP-completeness, derive a continuous cost-radius tradeoff with a balanced (2,2) guarantee, and build HP-RCRST, a height-partition-based multi-mode solver. On 28 development instances, its stronger modes Pareto-dominate the published-method union on 23 and tie on fiv"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.17005","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/2607.17005/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-07-21T01:21:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1m1HEycWISebpCYhZorT2JwjPo+USiAmHLvbP37ezeUoOfVaARpgHHmwgghzwR0tyWSUJcPSRsoRA6t5OeF7DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-23T16:11:08.606958Z"},"content_sha256":"26da445b81c30fb7617600e05e9fe5c2dc0d3efe6b46ac1016f5413309aa4b97","schema_version":"1.0","event_id":"sha256:26da445b81c30fb7617600e05e9fe5c2dc0d3efe6b46ac1016f5413309aa4b97"},{"event_type":"integrity_finding","subject_pith_number":"pith:2026:DMR6H7AVVDUIBJLOZOB5UX2BNF","target":"integrity","payload":{"note":"DOI is split by whitespace or line breaks in the printed bibliography. Reconstructed DOI 10.1016/j.cor.2006.03.022 resolves to 'Modeling and solving the rooted distance-constrained minimum spanning tree problem'. A reader following the printed text alone cannot reach it.","snippet":"Luis Gouveia, Ana Paias, and Dushyant Sharma. 2008. Modeling and Solving the Rooted Distance-Constrained Minimum Spanning Tree Problem.Computers & Operations Research35, 2 (2008), 600–613. https://doi.org/10.1016/j.cor.2006.03. 022","arxiv_id":"2607.17005","detector":"doi_compliance","evidence":{"ref_index":12,"verdict_class":"incontrovertible","resolved_title":"Modeling and solving the rooted distance-constrained minimum spanning tree problem","printed_excerpt":"10.1016/j.cor.2006.03","reconstructed_doi":"10.1016/j.cor.2006.03.022"},"severity":"advisory","ref_index":12,"audited_at":"2026-08-01T19:39:17.201087Z","event_type":"pith.integrity.v1","detected_doi":"10.1016/j.cor.2006.03.022","detector_url":"https://pith.science/pith-integrity-protocol#doi_compliance","external_url":null,"finding_type":"recoverable_identifier","evidence_hash":"5d201d552b2753c5ce0380c80db6ad13cae88da584f14d4e222e2679c0b94b66","paper_version":1,"verdict_class":"incontrovertible","resolved_title":"Modeling and solving the rooted distance-constrained minimum spanning tree problem","detector_version":"1.1.0","detected_arxiv_id":null,"integrity_event_id":16473,"payload_sha256":"1a53aea7fde21848fa4ba90140d42336ce324078e63997192128e64189525a2d","signature_b64":"/WdefzK66zxiIdQXxX/SheSAX8e/rhngqaNc3720qEsyRQJCzSSAfeQxHhs3aBbtZzdeo2IY/0PDXm6OJ/+7BA==","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-08-01T19:43:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Z4dOvFDd4MTnpHSs+PqMnP6jbwyjhnG11kfhu7902GNIslJwDCRldg7jbZwGhH/8SxSPEAb1yGB3XLvKwOSLBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-23T16:11:08.610832Z"},"content_sha256":"8e035a27004151b4895a946924cae663f756a6edda9078ee92b4b1d187b82ebf","schema_version":"1.0","event_id":"sha256:8e035a27004151b4895a946924cae663f756a6edda9078ee92b4b1d187b82ebf"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DMR6H7AVVDUIBJLOZOB5UX2BNF/bundle.json","state_url":"https://pith.science/pith/DMR6H7AVVDUIBJLOZOB5UX2BNF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DMR6H7AVVDUIBJLOZOB5UX2BNF/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-23T16:11:08Z","links":{"resolver":"https://pith.science/pith/DMR6H7AVVDUIBJLOZOB5UX2BNF","bundle":"https://pith.science/pith/DMR6H7AVVDUIBJLOZOB5UX2BNF/bundle.json","state":"https://pith.science/pith/DMR6H7AVVDUIBJLOZOB5UX2BNF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DMR6H7AVVDUIBJLOZOB5UX2BNF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:DMR6H7AVVDUIBJLOZOB5UX2BNF","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":"7bde515782abca2888180e8ca0cff49ab7a1b35c0f87c110eb2ad0783c338e5c","cross_cats_sorted":["cs.DS"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AR","submitted_at":"2026-07-18T23:42:59Z","title_canon_sha256":"124d73b5e0a1c5fb58a48cc4461749297a1acdea72bdaacc9d96ace67c862da0"},"schema_version":"1.0","source":{"id":"2607.17005","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.17005","created_at":"2026-07-21T01:21:10Z"},{"alias_kind":"arxiv_version","alias_value":"2607.17005v1","created_at":"2026-07-21T01:21:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.17005","created_at":"2026-07-21T01:21:10Z"},{"alias_kind":"pith_short_12","alias_value":"DMR6H7AVVDUI","created_at":"2026-07-21T01:21:10Z"},{"alias_kind":"pith_short_16","alias_value":"DMR6H7AVVDUIBJLO","created_at":"2026-07-21T01:21:10Z"},{"alias_kind":"pith_short_8","alias_value":"DMR6H7AV","created_at":"2026-07-21T01:21:10Z"}],"graph_snapshots":[{"event_id":"sha256:26da445b81c30fb7617600e05e9fe5c2dc0d3efe6b46ac1016f5413309aa4b97","target":"graph","created_at":"2026-07-21T01:21:10Z","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/2607.17005/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Large language models may make precise but dormant algorithmic problems practical to revisit, and may expose new paths toward fundamental ones. We demonstrate this possibility through Prim-Dijkstra routing, a classic VLSI problem whose terminal-only Manhattan complexity remained open despite decades of practical work. We prove weak NP-completeness, derive a continuous cost-radius tradeoff with a balanced (2,2) guarantee, and build HP-RCRST, a height-partition-based multi-mode solver. On 28 development instances, its stronger modes Pareto-dominate the published-method union on 23 and tie on fiv","authors_text":"Keren Zhu","cross_cats":["cs.DS"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AR","submitted_at":"2026-07-18T23:42:59Z","title":"Provably Good Prim-Dijkstra Revisited: New Theory and a Practical Algorithm for a Classical VLSI Routing Problem with LLMs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.17005","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:9fd5db1f11c6c8eb41890366153bcff9851dff7d5a8e5376aecd31e7b97991fb","target":"record","created_at":"2026-07-21T01:21:10Z","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":"7bde515782abca2888180e8ca0cff49ab7a1b35c0f87c110eb2ad0783c338e5c","cross_cats_sorted":["cs.DS"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AR","submitted_at":"2026-07-18T23:42:59Z","title_canon_sha256":"124d73b5e0a1c5fb58a48cc4461749297a1acdea72bdaacc9d96ace67c862da0"},"schema_version":"1.0","source":{"id":"2607.17005","kind":"arxiv","version":1}},"canonical_sha256":"1b23e3fc15a8e880a56ecb83da5f4169499f2bbe2089681a40f3b8860fb3928e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1b23e3fc15a8e880a56ecb83da5f4169499f2bbe2089681a40f3b8860fb3928e","first_computed_at":"2026-07-21T01:21:10.312814Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-21T01:21:10.312814Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"+o0aSiuna1epGBJSSQ28XZAQbXf2JH/h4UZOmc7AfVbPMtIJdns3r/PTIPSEPwnt9D1pV7n7CZ9x9oqYDBvRCA==","signature_status":"signed_v1","signed_at":"2026-07-21T01:21:10.313686Z","signed_message":"canonical_sha256_bytes"},"source_id":"2607.17005","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9fd5db1f11c6c8eb41890366153bcff9851dff7d5a8e5376aecd31e7b97991fb","sha256:26da445b81c30fb7617600e05e9fe5c2dc0d3efe6b46ac1016f5413309aa4b97","sha256:8e035a27004151b4895a946924cae663f756a6edda9078ee92b4b1d187b82ebf"],"state_sha256":"8771aa4094367f5b1f1101a10aea4917ab2f405c960bb50fd731e4f5f3296971"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SBmL8wZiLCpyKvUFnwAxOPds0iWwH5VKL9Qf/X4XyzfgviaZ8FaDtoGgFmgov0y4VFAZotuV7wy3OJ+3G90PAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-23T16:11:08.613205Z","bundle_sha256":"a8ca08a8649c21e738687375c01f39611b05c66b1edf210dc24df7f3b5a062b0"}}