{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:NM7KQGG6SDKMOFVS7FKVJFA3GU","short_pith_number":"pith:NM7KQGG6","canonical_record":{"source":{"id":"1609.07450","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2016-09-23T18:02:36Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"acaa55b59489e32a94df7661265e742ab408d72cd58e40d42ecaafa48bfdbb1d","abstract_canon_sha256":"f815bb3e99c32ec48a2886d0f6e494a41cb02ad7999d2d262d2c82c954679195"},"schema_version":"1.0"},"canonical_sha256":"6b3ea818de90d4c716b2f95554941b35058448595381693a8fb382c9c9886d4b","source":{"kind":"arxiv","id":"1609.07450","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1609.07450","created_at":"2026-05-18T00:22:52Z"},{"alias_kind":"arxiv_version","alias_value":"1609.07450v3","created_at":"2026-05-18T00:22:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.07450","created_at":"2026-05-18T00:22:52Z"},{"alias_kind":"pith_short_12","alias_value":"NM7KQGG6SDKM","created_at":"2026-05-18T12:30:32Z"},{"alias_kind":"pith_short_16","alias_value":"NM7KQGG6SDKMOFVS","created_at":"2026-05-18T12:30:32Z"},{"alias_kind":"pith_short_8","alias_value":"NM7KQGG6","created_at":"2026-05-18T12:30:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:NM7KQGG6SDKMOFVS7FKVJFA3GU","target":"record","payload":{"canonical_record":{"source":{"id":"1609.07450","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2016-09-23T18:02:36Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"acaa55b59489e32a94df7661265e742ab408d72cd58e40d42ecaafa48bfdbb1d","abstract_canon_sha256":"f815bb3e99c32ec48a2886d0f6e494a41cb02ad7999d2d262d2c82c954679195"},"schema_version":"1.0"},"canonical_sha256":"6b3ea818de90d4c716b2f95554941b35058448595381693a8fb382c9c9886d4b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:22:52.991324Z","signature_b64":"/Zegbxl1dIgstQKl3AyzJSMbCbSFl6gm4zmivrN/E3VhNUtsGYNJN/9spWbOnMTv2TlGD7UYUv5iJnk2HKerCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6b3ea818de90d4c716b2f95554941b35058448595381693a8fb382c9c9886d4b","last_reissued_at":"2026-05-18T00:22:52.990954Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:22:52.990954Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1609.07450","source_version":3,"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-18T00:22:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"trD14YbFEzwxqynB6cwOMCKFGIlrPY2OQ+wPCxttNhbij6KZ1RzTyht8M+y0iSFwJeXmAR7xthaV628rlgfhAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-23T04:24:29.082936Z"},"content_sha256":"64edf44ad84900044b0b07599a14c013babf989896270fa48ddd9890c5c68f4e","schema_version":"1.0","event_id":"sha256:64edf44ad84900044b0b07599a14c013babf989896270fa48ddd9890c5c68f4e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:NM7KQGG6SDKMOFVS7FKVJFA3GU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Finding long simple paths in a weighted digraph using pseudo-topological orderings","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.DM","authors_text":"Miguel Raggi","submitted_at":"2016-09-23T18:02:36Z","abstract_excerpt":"Given a weighted digraph D, finding the longest simple path is well known to be NP-hard. Furthermore, even giving an approximation algorithm is known to be NP-hard. In this paper we describe an efficient heuristic algorithm for finding long simple paths, using an hybrid approach of DFS and pseudo-topological orders, a a generalization of topological orders to non acyclic graphs, via a process we call \"opening edges\". An implementation of this algorithm won the Oracle MDC 2015 coding competition."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.07450","kind":"arxiv","version":3},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"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-18T00:22:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sPmLsbMUwH0j9GGhjxBFF/gqJhnEgBRPFbKfOl6pLeXpz5+5Eu9HBY1Pmh0+W29JHrkuGRcL+e16yHKprffeDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-23T04:24:29.083645Z"},"content_sha256":"34a303f6c614ea92011e62b8652613d7e1896df6b15c47edc7d9b12839923cd2","schema_version":"1.0","event_id":"sha256:34a303f6c614ea92011e62b8652613d7e1896df6b15c47edc7d9b12839923cd2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NM7KQGG6SDKMOFVS7FKVJFA3GU/bundle.json","state_url":"https://pith.science/pith/NM7KQGG6SDKMOFVS7FKVJFA3GU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NM7KQGG6SDKMOFVS7FKVJFA3GU/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-23T04:24:29Z","links":{"resolver":"https://pith.science/pith/NM7KQGG6SDKMOFVS7FKVJFA3GU","bundle":"https://pith.science/pith/NM7KQGG6SDKMOFVS7FKVJFA3GU/bundle.json","state":"https://pith.science/pith/NM7KQGG6SDKMOFVS7FKVJFA3GU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NM7KQGG6SDKMOFVS7FKVJFA3GU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:NM7KQGG6SDKMOFVS7FKVJFA3GU","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":"f815bb3e99c32ec48a2886d0f6e494a41cb02ad7999d2d262d2c82c954679195","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2016-09-23T18:02:36Z","title_canon_sha256":"acaa55b59489e32a94df7661265e742ab408d72cd58e40d42ecaafa48bfdbb1d"},"schema_version":"1.0","source":{"id":"1609.07450","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1609.07450","created_at":"2026-05-18T00:22:52Z"},{"alias_kind":"arxiv_version","alias_value":"1609.07450v3","created_at":"2026-05-18T00:22:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.07450","created_at":"2026-05-18T00:22:52Z"},{"alias_kind":"pith_short_12","alias_value":"NM7KQGG6SDKM","created_at":"2026-05-18T12:30:32Z"},{"alias_kind":"pith_short_16","alias_value":"NM7KQGG6SDKMOFVS","created_at":"2026-05-18T12:30:32Z"},{"alias_kind":"pith_short_8","alias_value":"NM7KQGG6","created_at":"2026-05-18T12:30:32Z"}],"graph_snapshots":[{"event_id":"sha256:34a303f6c614ea92011e62b8652613d7e1896df6b15c47edc7d9b12839923cd2","target":"graph","created_at":"2026-05-18T00:22:52Z","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":"Given a weighted digraph D, finding the longest simple path is well known to be NP-hard. Furthermore, even giving an approximation algorithm is known to be NP-hard. In this paper we describe an efficient heuristic algorithm for finding long simple paths, using an hybrid approach of DFS and pseudo-topological orders, a a generalization of topological orders to non acyclic graphs, via a process we call \"opening edges\". An implementation of this algorithm won the Oracle MDC 2015 coding competition.","authors_text":"Miguel Raggi","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2016-09-23T18:02:36Z","title":"Finding long simple paths in a weighted digraph using pseudo-topological orderings"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.07450","kind":"arxiv","version":3},"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:64edf44ad84900044b0b07599a14c013babf989896270fa48ddd9890c5c68f4e","target":"record","created_at":"2026-05-18T00:22:52Z","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":"f815bb3e99c32ec48a2886d0f6e494a41cb02ad7999d2d262d2c82c954679195","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2016-09-23T18:02:36Z","title_canon_sha256":"acaa55b59489e32a94df7661265e742ab408d72cd58e40d42ecaafa48bfdbb1d"},"schema_version":"1.0","source":{"id":"1609.07450","kind":"arxiv","version":3}},"canonical_sha256":"6b3ea818de90d4c716b2f95554941b35058448595381693a8fb382c9c9886d4b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6b3ea818de90d4c716b2f95554941b35058448595381693a8fb382c9c9886d4b","first_computed_at":"2026-05-18T00:22:52.990954Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:22:52.990954Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"/Zegbxl1dIgstQKl3AyzJSMbCbSFl6gm4zmivrN/E3VhNUtsGYNJN/9spWbOnMTv2TlGD7UYUv5iJnk2HKerCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:22:52.991324Z","signed_message":"canonical_sha256_bytes"},"source_id":"1609.07450","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:64edf44ad84900044b0b07599a14c013babf989896270fa48ddd9890c5c68f4e","sha256:34a303f6c614ea92011e62b8652613d7e1896df6b15c47edc7d9b12839923cd2"],"state_sha256":"82144d517956e8872362978eaadf022a5dc9096a3937ddb347636736af8e7846"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8QUHbGxwguUvBj99K9aOpDbBu34BgxaK5610aL/hdl3IJ6QA6j8YpCpeEtk7Odnjyd/NOVzycfXuU0HXpcmrDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-23T04:24:29.087044Z","bundle_sha256":"18ed2687f9e0afc8181444c12f1b64ce805cc8423e603f34b66df1db3b5081b0"}}