{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:JXJOI62YHA3B22KJ7H4GNILLCD","short_pith_number":"pith:JXJOI62Y","schema_version":"1.0","canonical_sha256":"4dd2e47b5838361d6949f9f866a16b10feba031dd9e3a9e48ddd1738205df4a6","source":{"kind":"arxiv","id":"2105.04991","version":1},"attestation_state":"computed","paper":{"title":"Graph Theory for Metro Traffic Modelling","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Anthony G. Constantinides, Bruno Scalzo Dees, Danilo P. Mandic, Yao Lei Xu","submitted_at":"2021-05-11T12:52:52Z","abstract_excerpt":"A unifying graph theoretic framework for the modelling of metro transportation networks is proposed. This is achieved by first introducing a basic graph framework for the modelling of the London underground system from a diffusion law point of view. This forms a basis for the analysis of both station importance and their vulnerability, whereby the concept of graph vertex centrality plays a key role. We next explore k-edge augmentation of a graph topology, and illustrate its usefulness both for improving the network robustness and as a planning tool. Upon establishing the graph theoretic attrib"},"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":"2105.04991","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2021-05-11T12:52:52Z","cross_cats_sorted":[],"title_canon_sha256":"a7c24ddaf8f7a25ba071557e55bcf5e2214de31c56ee5035407947bd82dcf679","abstract_canon_sha256":"d94c01feeb93d21d8dd3fc8b5e1fb5d62ad90dc5574716dd93b527dfe238fb16"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:39:26.403549Z","signature_b64":"eWciaRWH6AOhjBiM4bfShXu/09E6NwWCm5S5m6t/8E3oQkIpwPMVBXzKuU8IB5HvwwxaoevTpzM1E19IFFZpDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4dd2e47b5838361d6949f9f866a16b10feba031dd9e3a9e48ddd1738205df4a6","last_reissued_at":"2026-07-05T02:39:26.403159Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:39:26.403159Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Graph Theory for Metro Traffic Modelling","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Anthony G. Constantinides, Bruno Scalzo Dees, Danilo P. Mandic, Yao Lei Xu","submitted_at":"2021-05-11T12:52:52Z","abstract_excerpt":"A unifying graph theoretic framework for the modelling of metro transportation networks is proposed. This is achieved by first introducing a basic graph framework for the modelling of the London underground system from a diffusion law point of view. This forms a basis for the analysis of both station importance and their vulnerability, whereby the concept of graph vertex centrality plays a key role. We next explore k-edge augmentation of a graph topology, and illustrate its usefulness both for improving the network robustness and as a planning tool. Upon establishing the graph theoretic attrib"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2105.04991","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/2105.04991/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2105.04991","created_at":"2026-07-05T02:39:26.403215+00:00"},{"alias_kind":"arxiv_version","alias_value":"2105.04991v1","created_at":"2026-07-05T02:39:26.403215+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2105.04991","created_at":"2026-07-05T02:39:26.403215+00:00"},{"alias_kind":"pith_short_12","alias_value":"JXJOI62YHA3B","created_at":"2026-07-05T02:39:26.403215+00:00"},{"alias_kind":"pith_short_16","alias_value":"JXJOI62YHA3B22KJ","created_at":"2026-07-05T02:39:26.403215+00:00"},{"alias_kind":"pith_short_8","alias_value":"JXJOI62Y","created_at":"2026-07-05T02:39:26.403215+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/JXJOI62YHA3B22KJ7H4GNILLCD","json":"https://pith.science/pith/JXJOI62YHA3B22KJ7H4GNILLCD.json","graph_json":"https://pith.science/api/pith-number/JXJOI62YHA3B22KJ7H4GNILLCD/graph.json","events_json":"https://pith.science/api/pith-number/JXJOI62YHA3B22KJ7H4GNILLCD/events.json","paper":"https://pith.science/paper/JXJOI62Y"},"agent_actions":{"view_html":"https://pith.science/pith/JXJOI62YHA3B22KJ7H4GNILLCD","download_json":"https://pith.science/pith/JXJOI62YHA3B22KJ7H4GNILLCD.json","view_paper":"https://pith.science/paper/JXJOI62Y","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2105.04991&json=true","fetch_graph":"https://pith.science/api/pith-number/JXJOI62YHA3B22KJ7H4GNILLCD/graph.json","fetch_events":"https://pith.science/api/pith-number/JXJOI62YHA3B22KJ7H4GNILLCD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JXJOI62YHA3B22KJ7H4GNILLCD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JXJOI62YHA3B22KJ7H4GNILLCD/action/storage_attestation","attest_author":"https://pith.science/pith/JXJOI62YHA3B22KJ7H4GNILLCD/action/author_attestation","sign_citation":"https://pith.science/pith/JXJOI62YHA3B22KJ7H4GNILLCD/action/citation_signature","submit_replication":"https://pith.science/pith/JXJOI62YHA3B22KJ7H4GNILLCD/action/replication_record"}},"created_at":"2026-07-05T02:39:26.403215+00:00","updated_at":"2026-07-05T02:39:26.403215+00:00"}