{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:XQ42QTGS75E4PMVAWVRB47BNW7","short_pith_number":"pith:XQ42QTGS","canonical_record":{"source":{"id":"1709.05948","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-09-13T13:41:59Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"6dc831c5f2f8dd29a7a1c75cb364d2dd43d006024b116c30b337211b5ba3611f","abstract_canon_sha256":"84b8a74e74dbf30d88c8dd9a6893a3972859e3228b082a733c2409ada51a1881"},"schema_version":"1.0"},"canonical_sha256":"bc39a84cd2ff49c7b2a0b5621e7c2db7df2b2d787aead907aabd1a4594726c97","source":{"kind":"arxiv","id":"1709.05948","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.05948","created_at":"2026-05-18T00:18:53Z"},{"alias_kind":"arxiv_version","alias_value":"1709.05948v3","created_at":"2026-05-18T00:18:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.05948","created_at":"2026-05-18T00:18:53Z"},{"alias_kind":"pith_short_12","alias_value":"XQ42QTGS75E4","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_16","alias_value":"XQ42QTGS75E4PMVA","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_8","alias_value":"XQ42QTGS","created_at":"2026-05-18T12:31:56Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:XQ42QTGS75E4PMVAWVRB47BNW7","target":"record","payload":{"canonical_record":{"source":{"id":"1709.05948","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-09-13T13:41:59Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"6dc831c5f2f8dd29a7a1c75cb364d2dd43d006024b116c30b337211b5ba3611f","abstract_canon_sha256":"84b8a74e74dbf30d88c8dd9a6893a3972859e3228b082a733c2409ada51a1881"},"schema_version":"1.0"},"canonical_sha256":"bc39a84cd2ff49c7b2a0b5621e7c2db7df2b2d787aead907aabd1a4594726c97","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:18:53.338971Z","signature_b64":"5+h2qKrzDLw72dUlDicBIRvsAeqABxfpS9+Q5Pmw2Lf5VAA5US9iAcjASJUCMsOVwlznqfrUoa4yLmIzk1ZuAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bc39a84cd2ff49c7b2a0b5621e7c2db7df2b2d787aead907aabd1a4594726c97","last_reissued_at":"2026-05-18T00:18:53.338416Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:18:53.338416Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1709.05948","source_version":3,"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-18T00:18:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1pDKy3COXPijVW8hSiOdEGDB7j20BH6OWd+my8TdrW48eJKeRmgDoVD1Fp0mOkEDHpcvg3fjZ6SOMjvTD00+AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T04:41:33.641096Z"},"content_sha256":"6017a291063de90142be1c84030c25c1bb9e13de31d95756d3e72e8b7ae2c9a6","schema_version":"1.0","event_id":"sha256:6017a291063de90142be1c84030c25c1bb9e13de31d95756d3e72e8b7ae2c9a6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:XQ42QTGS75E4PMVAWVRB47BNW7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The shortest way to visit all metro lines in a city","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.AI","authors_text":"Florian Sikora","submitted_at":"2017-09-13T13:41:59Z","abstract_excerpt":"What if $\\{$a tourist, a train addict, Dr. Sheldon Cooper, somebody who likes to waste time$\\}$ wants to visit all metro lines or carriages in a given network in a minimum number of steps? We study this problem with an application to the metro network of Paris and Tokyo, proposing optimal solutions thanks to mathematical programming tools. Quite surprisingly, it appears that you can visit all 16 Parisian metro lines in only 26 steps (we denote by a step the act of taking the metro from one station to an adjacent one). Perhaps even more surprisingly, adding the 5 RER lines to these 16 lines doe"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.05948","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"},"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-18T00:18:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9jYXV0crmiTwyg8IQK+DDyw2U3VvmC5Ph8asfKPb8uX42s22NLQYvAGU2WyXsQtdmSRw89bC/ChI/tW58AftCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T04:41:33.641814Z"},"content_sha256":"e177e1a94e2e3b637da214e57b76d7c79b0aa1011bc5e84fdbaf764017c635c8","schema_version":"1.0","event_id":"sha256:e177e1a94e2e3b637da214e57b76d7c79b0aa1011bc5e84fdbaf764017c635c8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XQ42QTGS75E4PMVAWVRB47BNW7/bundle.json","state_url":"https://pith.science/pith/XQ42QTGS75E4PMVAWVRB47BNW7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XQ42QTGS75E4PMVAWVRB47BNW7/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-05-31T04:41:33Z","links":{"resolver":"https://pith.science/pith/XQ42QTGS75E4PMVAWVRB47BNW7","bundle":"https://pith.science/pith/XQ42QTGS75E4PMVAWVRB47BNW7/bundle.json","state":"https://pith.science/pith/XQ42QTGS75E4PMVAWVRB47BNW7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XQ42QTGS75E4PMVAWVRB47BNW7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:XQ42QTGS75E4PMVAWVRB47BNW7","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":"84b8a74e74dbf30d88c8dd9a6893a3972859e3228b082a733c2409ada51a1881","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-09-13T13:41:59Z","title_canon_sha256":"6dc831c5f2f8dd29a7a1c75cb364d2dd43d006024b116c30b337211b5ba3611f"},"schema_version":"1.0","source":{"id":"1709.05948","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.05948","created_at":"2026-05-18T00:18:53Z"},{"alias_kind":"arxiv_version","alias_value":"1709.05948v3","created_at":"2026-05-18T00:18:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.05948","created_at":"2026-05-18T00:18:53Z"},{"alias_kind":"pith_short_12","alias_value":"XQ42QTGS75E4","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_16","alias_value":"XQ42QTGS75E4PMVA","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_8","alias_value":"XQ42QTGS","created_at":"2026-05-18T12:31:56Z"}],"graph_snapshots":[{"event_id":"sha256:e177e1a94e2e3b637da214e57b76d7c79b0aa1011bc5e84fdbaf764017c635c8","target":"graph","created_at":"2026-05-18T00:18:53Z","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":"What if $\\{$a tourist, a train addict, Dr. Sheldon Cooper, somebody who likes to waste time$\\}$ wants to visit all metro lines or carriages in a given network in a minimum number of steps? We study this problem with an application to the metro network of Paris and Tokyo, proposing optimal solutions thanks to mathematical programming tools. Quite surprisingly, it appears that you can visit all 16 Parisian metro lines in only 26 steps (we denote by a step the act of taking the metro from one station to an adjacent one). Perhaps even more surprisingly, adding the 5 RER lines to these 16 lines doe","authors_text":"Florian Sikora","cross_cats":["math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-09-13T13:41:59Z","title":"The shortest way to visit all metro lines in a city"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.05948","kind":"arxiv","version":3},"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:6017a291063de90142be1c84030c25c1bb9e13de31d95756d3e72e8b7ae2c9a6","target":"record","created_at":"2026-05-18T00:18:53Z","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":"84b8a74e74dbf30d88c8dd9a6893a3972859e3228b082a733c2409ada51a1881","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-09-13T13:41:59Z","title_canon_sha256":"6dc831c5f2f8dd29a7a1c75cb364d2dd43d006024b116c30b337211b5ba3611f"},"schema_version":"1.0","source":{"id":"1709.05948","kind":"arxiv","version":3}},"canonical_sha256":"bc39a84cd2ff49c7b2a0b5621e7c2db7df2b2d787aead907aabd1a4594726c97","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"bc39a84cd2ff49c7b2a0b5621e7c2db7df2b2d787aead907aabd1a4594726c97","first_computed_at":"2026-05-18T00:18:53.338416Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:18:53.338416Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"5+h2qKrzDLw72dUlDicBIRvsAeqABxfpS9+Q5Pmw2Lf5VAA5US9iAcjASJUCMsOVwlznqfrUoa4yLmIzk1ZuAg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:18:53.338971Z","signed_message":"canonical_sha256_bytes"},"source_id":"1709.05948","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6017a291063de90142be1c84030c25c1bb9e13de31d95756d3e72e8b7ae2c9a6","sha256:e177e1a94e2e3b637da214e57b76d7c79b0aa1011bc5e84fdbaf764017c635c8"],"state_sha256":"ff4deb10ffd7f242a78cb0943bf2cda54914aea9a61cfb69250d51f2af92996d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WAeQZms6CCHAluHhxGIYzkuOjUC1QCZXplNmqgmdWOT4nXx0sfDNtamWW4KGKyvyLR2yRjyJjxhkwRc1jYyTAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T04:41:33.645258Z","bundle_sha256":"c357304e9f3044dc10e66983738a56fe3ea4fd9b417b4bd8aa8cb429460fa3b5"}}