{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:NM7KQGG6SDKMOFVS7FKVJFA3GU","short_pith_number":"pith:NM7KQGG6","schema_version":"1.0","canonical_sha256":"6b3ea818de90d4c716b2f95554941b35058448595381693a8fb382c9c9886d4b","source":{"kind":"arxiv","id":"1609.07450","version":3},"attestation_state":"computed","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."},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1609.07450","created_at":"2026-05-18T00:22:52.991009+00:00"},{"alias_kind":"arxiv_version","alias_value":"1609.07450v3","created_at":"2026-05-18T00:22:52.991009+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.07450","created_at":"2026-05-18T00:22:52.991009+00:00"},{"alias_kind":"pith_short_12","alias_value":"NM7KQGG6SDKM","created_at":"2026-05-18T12:30:32.724797+00:00"},{"alias_kind":"pith_short_16","alias_value":"NM7KQGG6SDKMOFVS","created_at":"2026-05-18T12:30:32.724797+00:00"},{"alias_kind":"pith_short_8","alias_value":"NM7KQGG6","created_at":"2026-05-18T12:30:32.724797+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/NM7KQGG6SDKMOFVS7FKVJFA3GU","json":"https://pith.science/pith/NM7KQGG6SDKMOFVS7FKVJFA3GU.json","graph_json":"https://pith.science/api/pith-number/NM7KQGG6SDKMOFVS7FKVJFA3GU/graph.json","events_json":"https://pith.science/api/pith-number/NM7KQGG6SDKMOFVS7FKVJFA3GU/events.json","paper":"https://pith.science/paper/NM7KQGG6"},"agent_actions":{"view_html":"https://pith.science/pith/NM7KQGG6SDKMOFVS7FKVJFA3GU","download_json":"https://pith.science/pith/NM7KQGG6SDKMOFVS7FKVJFA3GU.json","view_paper":"https://pith.science/paper/NM7KQGG6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1609.07450&json=true","fetch_graph":"https://pith.science/api/pith-number/NM7KQGG6SDKMOFVS7FKVJFA3GU/graph.json","fetch_events":"https://pith.science/api/pith-number/NM7KQGG6SDKMOFVS7FKVJFA3GU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NM7KQGG6SDKMOFVS7FKVJFA3GU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NM7KQGG6SDKMOFVS7FKVJFA3GU/action/storage_attestation","attest_author":"https://pith.science/pith/NM7KQGG6SDKMOFVS7FKVJFA3GU/action/author_attestation","sign_citation":"https://pith.science/pith/NM7KQGG6SDKMOFVS7FKVJFA3GU/action/citation_signature","submit_replication":"https://pith.science/pith/NM7KQGG6SDKMOFVS7FKVJFA3GU/action/replication_record"}},"created_at":"2026-05-18T00:22:52.991009+00:00","updated_at":"2026-05-18T00:22:52.991009+00:00"}