{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:PW24FTBIMS2MBFJU4DKAWN3Y5X","short_pith_number":"pith:PW24FTBI","schema_version":"1.0","canonical_sha256":"7db5c2cc2864b4c09534e0d40b3778edf17e750717bb745072ef507fcad27ee1","source":{"kind":"arxiv","id":"1507.06865","version":1},"attestation_state":"computed","paper":{"title":"All Colors Shortest Path Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Beg\\\"um Gen\\c{c}, Cem Evrendilek, Do\\u{g}ukan \\c{C}a\\u{g}atay, H\\\"useyin Akcan, Mecit Sar{\\i}, Yunus Can Bilge","submitted_at":"2015-07-24T14:57:02Z","abstract_excerpt":"All Colors Shortest Path problem defined on an undirected graph aims at finding a shortest, possibly non-simple, path where every color occurs at least once, assuming that each vertex in the graph is associated with a color known in advance. To the best of our knowledge, this paper is the first to define and investigate this problem. Even though the problem is computationally similar to generalized minimum spanning tree, and the generalized traveling salesman problems, allowing for non-simple paths where a node may be visited multiple times makes All Colors Shortest Path problem novel and comp"},"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":"1507.06865","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-07-24T14:57:02Z","cross_cats_sorted":[],"title_canon_sha256":"1c36fbc45841447ee6dbe7d858bfec99f111b03c774f232fd2bfdfeb6eec8d8d","abstract_canon_sha256":"4f043113e5a4d8831a00382dbc1716e6edcf9ed6e8b2724aed5ffd2b2391dc12"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:36:21.845183Z","signature_b64":"sI2XEcwIj12iFEpgw66iwXqekdJBJwklzOcL6h+RPmoNA6kSjpDqs0GlTVcNEHFiD3nWvKzULd8tG24QNt2TBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7db5c2cc2864b4c09534e0d40b3778edf17e750717bb745072ef507fcad27ee1","last_reissued_at":"2026-05-18T01:36:21.844529Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:36:21.844529Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"All Colors Shortest Path Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Beg\\\"um Gen\\c{c}, Cem Evrendilek, Do\\u{g}ukan \\c{C}a\\u{g}atay, H\\\"useyin Akcan, Mecit Sar{\\i}, Yunus Can Bilge","submitted_at":"2015-07-24T14:57:02Z","abstract_excerpt":"All Colors Shortest Path problem defined on an undirected graph aims at finding a shortest, possibly non-simple, path where every color occurs at least once, assuming that each vertex in the graph is associated with a color known in advance. To the best of our knowledge, this paper is the first to define and investigate this problem. Even though the problem is computationally similar to generalized minimum spanning tree, and the generalized traveling salesman problems, allowing for non-simple paths where a node may be visited multiple times makes All Colors Shortest Path problem novel and comp"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.06865","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":""},"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":"1507.06865","created_at":"2026-05-18T01:36:21.844644+00:00"},{"alias_kind":"arxiv_version","alias_value":"1507.06865v1","created_at":"2026-05-18T01:36:21.844644+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.06865","created_at":"2026-05-18T01:36:21.844644+00:00"},{"alias_kind":"pith_short_12","alias_value":"PW24FTBIMS2M","created_at":"2026-05-18T12:29:37.295048+00:00"},{"alias_kind":"pith_short_16","alias_value":"PW24FTBIMS2MBFJU","created_at":"2026-05-18T12:29:37.295048+00:00"},{"alias_kind":"pith_short_8","alias_value":"PW24FTBI","created_at":"2026-05-18T12:29:37.295048+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/PW24FTBIMS2MBFJU4DKAWN3Y5X","json":"https://pith.science/pith/PW24FTBIMS2MBFJU4DKAWN3Y5X.json","graph_json":"https://pith.science/api/pith-number/PW24FTBIMS2MBFJU4DKAWN3Y5X/graph.json","events_json":"https://pith.science/api/pith-number/PW24FTBIMS2MBFJU4DKAWN3Y5X/events.json","paper":"https://pith.science/paper/PW24FTBI"},"agent_actions":{"view_html":"https://pith.science/pith/PW24FTBIMS2MBFJU4DKAWN3Y5X","download_json":"https://pith.science/pith/PW24FTBIMS2MBFJU4DKAWN3Y5X.json","view_paper":"https://pith.science/paper/PW24FTBI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1507.06865&json=true","fetch_graph":"https://pith.science/api/pith-number/PW24FTBIMS2MBFJU4DKAWN3Y5X/graph.json","fetch_events":"https://pith.science/api/pith-number/PW24FTBIMS2MBFJU4DKAWN3Y5X/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PW24FTBIMS2MBFJU4DKAWN3Y5X/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PW24FTBIMS2MBFJU4DKAWN3Y5X/action/storage_attestation","attest_author":"https://pith.science/pith/PW24FTBIMS2MBFJU4DKAWN3Y5X/action/author_attestation","sign_citation":"https://pith.science/pith/PW24FTBIMS2MBFJU4DKAWN3Y5X/action/citation_signature","submit_replication":"https://pith.science/pith/PW24FTBIMS2MBFJU4DKAWN3Y5X/action/replication_record"}},"created_at":"2026-05-18T01:36:21.844644+00:00","updated_at":"2026-05-18T01:36:21.844644+00:00"}