{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:JGWWSK5OF5UBCCL2APPTMA2CAL","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":"51398e3224d147a85b87dfef2ba4fff55b674ec19067898c384aa6adfea4c441","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-02-14T12:05:58Z","title_canon_sha256":"8f0334b559a8efa279bb3caa60cb06705c8b763637e84ead8d8fd2c22a2501fd"},"schema_version":"1.0","source":{"id":"1702.04170","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.04170","created_at":"2026-05-18T00:50:48Z"},{"alias_kind":"arxiv_version","alias_value":"1702.04170v1","created_at":"2026-05-18T00:50:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.04170","created_at":"2026-05-18T00:50:48Z"},{"alias_kind":"pith_short_12","alias_value":"JGWWSK5OF5UB","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_16","alias_value":"JGWWSK5OF5UBCCL2","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_8","alias_value":"JGWWSK5O","created_at":"2026-05-18T12:31:24Z"}],"graph_snapshots":[{"event_id":"sha256:30d01ecb9b9b907bf7e11d80d1616642c0e3e14cbb032f58a6f28215638b12ae","target":"graph","created_at":"2026-05-18T00:50:48Z","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"},"paper":{"abstract_excerpt":"We propose an optimal algorithm for solving the longest path problem in undirected weighted graphs. By using graph partitioning and dynamic programming, we obtain an algorithm that is significantly faster than other state-of-the-art methods. This enables us to solve instances that have previously been unsolved.","authors_text":"Christian Schulz, Kai Fieger, Tomas Balyo","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-02-14T12:05:58Z","title":"Optimal Longest Paths by Dynamic Programming"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.04170","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:586919e4232488a0b3e61ee1c5017b064cb5f92abb07f0bae7a391224c2448c7","target":"record","created_at":"2026-05-18T00:50:48Z","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":"51398e3224d147a85b87dfef2ba4fff55b674ec19067898c384aa6adfea4c441","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-02-14T12:05:58Z","title_canon_sha256":"8f0334b559a8efa279bb3caa60cb06705c8b763637e84ead8d8fd2c22a2501fd"},"schema_version":"1.0","source":{"id":"1702.04170","kind":"arxiv","version":1}},"canonical_sha256":"49ad692bae2f6811097a03df36034202cd4dd88444486fe2e43128987295033f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"49ad692bae2f6811097a03df36034202cd4dd88444486fe2e43128987295033f","first_computed_at":"2026-05-18T00:50:48.897073Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:50:48.897073Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"i9EkjxogGSnklhZFSROzrZIGuEKy1UVETh6is7BcQ8fiektklwDWiKLFtymxDZlaPhdvpQAKGKfJHxstYCzCCw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:50:48.897546Z","signed_message":"canonical_sha256_bytes"},"source_id":"1702.04170","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:586919e4232488a0b3e61ee1c5017b064cb5f92abb07f0bae7a391224c2448c7","sha256:30d01ecb9b9b907bf7e11d80d1616642c0e3e14cbb032f58a6f28215638b12ae"],"state_sha256":"e7b964f8bb296d21b879e0ca827215f0f4d6c25efc01816a670fff3a92392f3b"}