{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:NOU7KHXGUTF4I227BAS7KXA6EX","short_pith_number":"pith:NOU7KHXG","canonical_record":{"source":{"id":"2008.12259","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2020-08-27T16:56:12Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"f277afad110c2f976b2b954d69d761d126bb2de4412a0e506817b7442cdb6559","abstract_canon_sha256":"321fa40b44a1b4823a3ac87e616089bd5f95eea49febce454b249f32f4acbe03"},"schema_version":"1.0"},"canonical_sha256":"6ba9f51ee6a4cbc46b5f0825f55c1e25d58f6ba49a89e133f35d64c04f0a0a72","source":{"kind":"arxiv","id":"2008.12259","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2008.12259","created_at":"2026-07-05T01:31:04Z"},{"alias_kind":"arxiv_version","alias_value":"2008.12259v1","created_at":"2026-07-05T01:31:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2008.12259","created_at":"2026-07-05T01:31:04Z"},{"alias_kind":"pith_short_12","alias_value":"NOU7KHXGUTF4","created_at":"2026-07-05T01:31:04Z"},{"alias_kind":"pith_short_16","alias_value":"NOU7KHXGUTF4I227","created_at":"2026-07-05T01:31:04Z"},{"alias_kind":"pith_short_8","alias_value":"NOU7KHXG","created_at":"2026-07-05T01:31:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:NOU7KHXGUTF4I227BAS7KXA6EX","target":"record","payload":{"canonical_record":{"source":{"id":"2008.12259","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2020-08-27T16:56:12Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"f277afad110c2f976b2b954d69d761d126bb2de4412a0e506817b7442cdb6559","abstract_canon_sha256":"321fa40b44a1b4823a3ac87e616089bd5f95eea49febce454b249f32f4acbe03"},"schema_version":"1.0"},"canonical_sha256":"6ba9f51ee6a4cbc46b5f0825f55c1e25d58f6ba49a89e133f35d64c04f0a0a72","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:31:04.381809Z","signature_b64":"XjIDmf1ydX928IEXpqbDf6Mo5aFXrtRWRy717LSAODXrpNFu1WrTmhSjIojm6u2ScTQagXfR9/zdKQ5kCJeUDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6ba9f51ee6a4cbc46b5f0825f55c1e25d58f6ba49a89e133f35d64c04f0a0a72","last_reissued_at":"2026-07-05T01:31:04.381360Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:31:04.381360Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2008.12259","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-07-05T01:31:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"520O7xn9pIVH/Gi5QGIXbE0DpnPGdkhc/LyTtAlFoTmCivTZbF8XXVM7sqmXJN4UTtYZfUnx/23ZsPGHiigRDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T21:48:29.073173Z"},"content_sha256":"b58b3f5a26da1aa2385ff5ced0e8b59106e1cb24e236a62ffa45471f39f1ee67","schema_version":"1.0","event_id":"sha256:b58b3f5a26da1aa2385ff5ced0e8b59106e1cb24e236a62ffa45471f39f1ee67"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:NOU7KHXGUTF4I227BAS7KXA6EX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The k-interchange-constrained diameter of a transit network: A connectedness indicator that accounts for travel convenience","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.DS","authors_text":"Nassim Dehouche","submitted_at":"2020-08-27T16:56:12Z","abstract_excerpt":"We study two variants of the shortest path problem. Given an integer k, the k-color-constrained and the k-interchange-constrained shortest path problems, respectively seek a shortest path that uses no more than k colors and one that makes no more than k - 1 alternations of colors. We show that the former problem is NP-hard, when the latter is tractable. The study of these problems is motivated by some limitations in the use of diameter-based metrics to evaluate the topological structure of transit networks. We notably show that indicators such as the diameter or directness of a transit network"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2008.12259","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2008.12259/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T01:31:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MJqvXM20ifJBfsM4rHbW8geYn1Y1IxA+GJjb/SORsCPG7P9bgE/3Joy9zut6lTnCjWu+YHEmOGW+uMHA+ZgdBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T21:48:29.073683Z"},"content_sha256":"17370e96d45a43c4b0aede88c8a2d5e5f169c8244ecc96c271efabf9c0ccdb80","schema_version":"1.0","event_id":"sha256:17370e96d45a43c4b0aede88c8a2d5e5f169c8244ecc96c271efabf9c0ccdb80"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NOU7KHXGUTF4I227BAS7KXA6EX/bundle.json","state_url":"https://pith.science/pith/NOU7KHXGUTF4I227BAS7KXA6EX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NOU7KHXGUTF4I227BAS7KXA6EX/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-08-04T21:48:29Z","links":{"resolver":"https://pith.science/pith/NOU7KHXGUTF4I227BAS7KXA6EX","bundle":"https://pith.science/pith/NOU7KHXGUTF4I227BAS7KXA6EX/bundle.json","state":"https://pith.science/pith/NOU7KHXGUTF4I227BAS7KXA6EX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NOU7KHXGUTF4I227BAS7KXA6EX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:NOU7KHXGUTF4I227BAS7KXA6EX","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":"321fa40b44a1b4823a3ac87e616089bd5f95eea49febce454b249f32f4acbe03","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2020-08-27T16:56:12Z","title_canon_sha256":"f277afad110c2f976b2b954d69d761d126bb2de4412a0e506817b7442cdb6559"},"schema_version":"1.0","source":{"id":"2008.12259","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2008.12259","created_at":"2026-07-05T01:31:04Z"},{"alias_kind":"arxiv_version","alias_value":"2008.12259v1","created_at":"2026-07-05T01:31:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2008.12259","created_at":"2026-07-05T01:31:04Z"},{"alias_kind":"pith_short_12","alias_value":"NOU7KHXGUTF4","created_at":"2026-07-05T01:31:04Z"},{"alias_kind":"pith_short_16","alias_value":"NOU7KHXGUTF4I227","created_at":"2026-07-05T01:31:04Z"},{"alias_kind":"pith_short_8","alias_value":"NOU7KHXG","created_at":"2026-07-05T01:31:04Z"}],"graph_snapshots":[{"event_id":"sha256:17370e96d45a43c4b0aede88c8a2d5e5f169c8244ecc96c271efabf9c0ccdb80","target":"graph","created_at":"2026-07-05T01:31:04Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2008.12259/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We study two variants of the shortest path problem. Given an integer k, the k-color-constrained and the k-interchange-constrained shortest path problems, respectively seek a shortest path that uses no more than k colors and one that makes no more than k - 1 alternations of colors. We show that the former problem is NP-hard, when the latter is tractable. The study of these problems is motivated by some limitations in the use of diameter-based metrics to evaluate the topological structure of transit networks. We notably show that indicators such as the diameter or directness of a transit network","authors_text":"Nassim Dehouche","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2020-08-27T16:56:12Z","title":"The k-interchange-constrained diameter of a transit network: A connectedness indicator that accounts for travel convenience"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2008.12259","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:b58b3f5a26da1aa2385ff5ced0e8b59106e1cb24e236a62ffa45471f39f1ee67","target":"record","created_at":"2026-07-05T01:31:04Z","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":"321fa40b44a1b4823a3ac87e616089bd5f95eea49febce454b249f32f4acbe03","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2020-08-27T16:56:12Z","title_canon_sha256":"f277afad110c2f976b2b954d69d761d126bb2de4412a0e506817b7442cdb6559"},"schema_version":"1.0","source":{"id":"2008.12259","kind":"arxiv","version":1}},"canonical_sha256":"6ba9f51ee6a4cbc46b5f0825f55c1e25d58f6ba49a89e133f35d64c04f0a0a72","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6ba9f51ee6a4cbc46b5f0825f55c1e25d58f6ba49a89e133f35d64c04f0a0a72","first_computed_at":"2026-07-05T01:31:04.381360Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T01:31:04.381360Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"XjIDmf1ydX928IEXpqbDf6Mo5aFXrtRWRy717LSAODXrpNFu1WrTmhSjIojm6u2ScTQagXfR9/zdKQ5kCJeUDA==","signature_status":"signed_v1","signed_at":"2026-07-05T01:31:04.381809Z","signed_message":"canonical_sha256_bytes"},"source_id":"2008.12259","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b58b3f5a26da1aa2385ff5ced0e8b59106e1cb24e236a62ffa45471f39f1ee67","sha256:17370e96d45a43c4b0aede88c8a2d5e5f169c8244ecc96c271efabf9c0ccdb80"],"state_sha256":"dad5c999f9c254ee76db3abf9256680a2c83d2086d710e1b8f0b3a8792101d44"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"I/JJxzaA8mX3KfU84WALlgF8RHK2xP0iCc01kuanx2IiRQfwjONqQgYAwxnLwJO0gvB3Y2/bBm0vuvontiuCBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-04T21:48:29.077942Z","bundle_sha256":"cf937cabf5f869b5d45164945a511ea09b3a3738b0b97ac9f43d79a6721a09e7"}}