{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:AHBL3XMZYGSEN2TJROX73XMWGD","short_pith_number":"pith:AHBL3XMZ","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"},"canonical_sha256":"01c2bddd99c1a446ea698baffddd9630d4f4ea8dd2756804d9845ef6691d8a13","source":{"kind":"arxiv","id":"1112.3066","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1112.3066","created_at":"2026-05-18T04:06:20Z"},{"alias_kind":"arxiv_version","alias_value":"1112.3066v1","created_at":"2026-05-18T04:06:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1112.3066","created_at":"2026-05-18T04:06:20Z"},{"alias_kind":"pith_short_12","alias_value":"AHBL3XMZYGSE","created_at":"2026-05-18T12:26:24Z"},{"alias_kind":"pith_short_16","alias_value":"AHBL3XMZYGSEN2TJ","created_at":"2026-05-18T12:26:24Z"},{"alias_kind":"pith_short_8","alias_value":"AHBL3XMZ","created_at":"2026-05-18T12:26:24Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:AHBL3XMZYGSEN2TJROX73XMWGD","target":"record","payload":{"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"},"canonical_sha256":"01c2bddd99c1a446ea698baffddd9630d4f4ea8dd2756804d9845ef6691d8a13","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"},"source_kind":"arxiv","source_id":"1112.3066","source_version":1,"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-18T04:06:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YS/ZJw+z/1QzgdmfgRVruw/zUDhbi2032hmvEig+8IpwtwwMduEHH8j2cTCHFnfmu8oxO1T9RwQuqd/QoOnrCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T15:56:26.752703Z"},"content_sha256":"db2c20e9025905bd4cc695b14f36c8fbd74da4a52504de404dbaa719baf7eed5","schema_version":"1.0","event_id":"sha256:db2c20e9025905bd4cc695b14f36c8fbd74da4a52504de404dbaa719baf7eed5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:AHBL3XMZYGSEN2TJROX73XMWGD","target":"graph","payload":{"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"},"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-18T04:06:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vuQtXqZWCOcxV34g80ZPE9fnREpjLmvWzhD5xyUI68IUbvk6cc7N3vVwxDZRkUJKCuHAly4Aup5Xt9Pm7yanCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T15:56:26.753461Z"},"content_sha256":"38cc402f56db1dbfbabe3de874df140f90ce7022f494f29e502fd797be335300","schema_version":"1.0","event_id":"sha256:38cc402f56db1dbfbabe3de874df140f90ce7022f494f29e502fd797be335300"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/AHBL3XMZYGSEN2TJROX73XMWGD/bundle.json","state_url":"https://pith.science/pith/AHBL3XMZYGSEN2TJROX73XMWGD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/AHBL3XMZYGSEN2TJROX73XMWGD/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-06-06T15:56:26Z","links":{"resolver":"https://pith.science/pith/AHBL3XMZYGSEN2TJROX73XMWGD","bundle":"https://pith.science/pith/AHBL3XMZYGSEN2TJROX73XMWGD/bundle.json","state":"https://pith.science/pith/AHBL3XMZYGSEN2TJROX73XMWGD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/AHBL3XMZYGSEN2TJROX73XMWGD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:AHBL3XMZYGSEN2TJROX73XMWGD","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":"10e4edc765bb5ec48bbc8e00dfd2c81a5b967252270f27dd6528a3922a048458","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-12-13T22:44:23Z","title_canon_sha256":"cf46b3df53f3066b16a8d37d2e279cc3fc291d722cf2d429346893614ca37361"},"schema_version":"1.0","source":{"id":"1112.3066","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1112.3066","created_at":"2026-05-18T04:06:20Z"},{"alias_kind":"arxiv_version","alias_value":"1112.3066v1","created_at":"2026-05-18T04:06:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1112.3066","created_at":"2026-05-18T04:06:20Z"},{"alias_kind":"pith_short_12","alias_value":"AHBL3XMZYGSE","created_at":"2026-05-18T12:26:24Z"},{"alias_kind":"pith_short_16","alias_value":"AHBL3XMZYGSEN2TJ","created_at":"2026-05-18T12:26:24Z"},{"alias_kind":"pith_short_8","alias_value":"AHBL3XMZ","created_at":"2026-05-18T12:26:24Z"}],"graph_snapshots":[{"event_id":"sha256:38cc402f56db1dbfbabe3de874df140f90ce7022f494f29e502fd797be335300","target":"graph","created_at":"2026-05-18T04:06:20Z","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":"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","authors_text":"Andrew Ensor, Felipe Lillo","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-12-13T22:44:23Z","title":"Counting the Number of Minimal Paths in Weighted Coloured-Edge Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1112.3066","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:db2c20e9025905bd4cc695b14f36c8fbd74da4a52504de404dbaa719baf7eed5","target":"record","created_at":"2026-05-18T04:06:20Z","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":"10e4edc765bb5ec48bbc8e00dfd2c81a5b967252270f27dd6528a3922a048458","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-12-13T22:44:23Z","title_canon_sha256":"cf46b3df53f3066b16a8d37d2e279cc3fc291d722cf2d429346893614ca37361"},"schema_version":"1.0","source":{"id":"1112.3066","kind":"arxiv","version":1}},"canonical_sha256":"01c2bddd99c1a446ea698baffddd9630d4f4ea8dd2756804d9845ef6691d8a13","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"01c2bddd99c1a446ea698baffddd9630d4f4ea8dd2756804d9845ef6691d8a13","first_computed_at":"2026-05-18T04:06:20.269609Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:06:20.269609Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"l2ZmW3xRJiyml/6n+ERs/e5MYbPfC4bXpiMl0hRPIKlLF7EyBNyGc7XecF0P89VsU5E8LXEET2wtYHONPK5yCg==","signature_status":"signed_v1","signed_at":"2026-05-18T04:06:20.270332Z","signed_message":"canonical_sha256_bytes"},"source_id":"1112.3066","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:db2c20e9025905bd4cc695b14f36c8fbd74da4a52504de404dbaa719baf7eed5","sha256:38cc402f56db1dbfbabe3de874df140f90ce7022f494f29e502fd797be335300"],"state_sha256":"e7c8c0c0c369728bc22e70149cc942e3d0b5f11c0e96f342f7ac92b812a93738"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+2dqtGxo/fkRc4O8V/hGqvm4JEz4DwFxTp2m8m6FvCB5OXysI5Fkgu8c2Fkam0g6TajjQ03ggY3VMJUTCBnPCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T15:56:26.757329Z","bundle_sha256":"7d0ae36c835a799e88ad0abc84a85bc3a38d59f7616f3ac92c30802ba4f7e364"}}