{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:AHBL3XMZYGSEN2TJROX73XMWGD","short_pith_number":"pith:AHBL3XMZ","schema_version":"1.0","canonical_sha256":"01c2bddd99c1a446ea698baffddd9630d4f4ea8dd2756804d9845ef6691d8a13","source":{"kind":"arxiv","id":"1112.3066","version":1},"attestation_state":"computed","paper":{"title":"Counting the Number of Minimal Paths in Weighted Coloured-Edge Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Andrew Ensor, Felipe Lillo","submitted_at":"2011-12-13T22:44:23Z","abstract_excerpt":"A weighted coloured-edge graph is a graph for which each edge is assigned both a positive weight and a discrete colour, and can be used to model transportation and computer networks in which there are multiple transportation modes. In such a graph paths are compared by their total weight in each colour, resulting in a Pareto set of minimal paths from one vertex to another. This paper will give a tight upper bound on the cardinality of a minimal set of paths for any weighted coloured-edge graph. Additionally, a bound is presented on the expected number of minimal paths in weighted bicoloured-ed"},"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":"1112.3066","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-12-13T22:44:23Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"cf46b3df53f3066b16a8d37d2e279cc3fc291d722cf2d429346893614ca37361","abstract_canon_sha256":"10e4edc765bb5ec48bbc8e00dfd2c81a5b967252270f27dd6528a3922a048458"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:06:20.270332Z","signature_b64":"l2ZmW3xRJiyml/6n+ERs/e5MYbPfC4bXpiMl0hRPIKlLF7EyBNyGc7XecF0P89VsU5E8LXEET2wtYHONPK5yCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"01c2bddd99c1a446ea698baffddd9630d4f4ea8dd2756804d9845ef6691d8a13","last_reissued_at":"2026-05-18T04:06:20.269609Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:06:20.269609Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Counting the Number of Minimal Paths in Weighted Coloured-Edge Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Andrew Ensor, Felipe Lillo","submitted_at":"2011-12-13T22:44:23Z","abstract_excerpt":"A weighted coloured-edge graph is a graph for which each edge is assigned both a positive weight and a discrete colour, and can be used to model transportation and computer networks in which there are multiple transportation modes. In such a graph paths are compared by their total weight in each colour, resulting in a Pareto set of minimal paths from one vertex to another. This paper will give a tight upper bound on the cardinality of a minimal set of paths for any weighted coloured-edge graph. Additionally, a bound is presented on the expected number of minimal paths in weighted bicoloured-ed"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1112.3066","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":"1112.3066","created_at":"2026-05-18T04:06:20.269740+00:00"},{"alias_kind":"arxiv_version","alias_value":"1112.3066v1","created_at":"2026-05-18T04:06:20.269740+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1112.3066","created_at":"2026-05-18T04:06:20.269740+00:00"},{"alias_kind":"pith_short_12","alias_value":"AHBL3XMZYGSE","created_at":"2026-05-18T12:26:24.575870+00:00"},{"alias_kind":"pith_short_16","alias_value":"AHBL3XMZYGSEN2TJ","created_at":"2026-05-18T12:26:24.575870+00:00"},{"alias_kind":"pith_short_8","alias_value":"AHBL3XMZ","created_at":"2026-05-18T12:26:24.575870+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/AHBL3XMZYGSEN2TJROX73XMWGD","json":"https://pith.science/pith/AHBL3XMZYGSEN2TJROX73XMWGD.json","graph_json":"https://pith.science/api/pith-number/AHBL3XMZYGSEN2TJROX73XMWGD/graph.json","events_json":"https://pith.science/api/pith-number/AHBL3XMZYGSEN2TJROX73XMWGD/events.json","paper":"https://pith.science/paper/AHBL3XMZ"},"agent_actions":{"view_html":"https://pith.science/pith/AHBL3XMZYGSEN2TJROX73XMWGD","download_json":"https://pith.science/pith/AHBL3XMZYGSEN2TJROX73XMWGD.json","view_paper":"https://pith.science/paper/AHBL3XMZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1112.3066&json=true","fetch_graph":"https://pith.science/api/pith-number/AHBL3XMZYGSEN2TJROX73XMWGD/graph.json","fetch_events":"https://pith.science/api/pith-number/AHBL3XMZYGSEN2TJROX73XMWGD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AHBL3XMZYGSEN2TJROX73XMWGD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AHBL3XMZYGSEN2TJROX73XMWGD/action/storage_attestation","attest_author":"https://pith.science/pith/AHBL3XMZYGSEN2TJROX73XMWGD/action/author_attestation","sign_citation":"https://pith.science/pith/AHBL3XMZYGSEN2TJROX73XMWGD/action/citation_signature","submit_replication":"https://pith.science/pith/AHBL3XMZYGSEN2TJROX73XMWGD/action/replication_record"}},"created_at":"2026-05-18T04:06:20.269740+00:00","updated_at":"2026-05-18T04:06:20.269740+00:00"}