{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:TDCRFLL42LNK2APQS26MWVBL2C","short_pith_number":"pith:TDCRFLL4","schema_version":"1.0","canonical_sha256":"98c512ad7cd2daad01f096bccb542bd0892212b05a2276eead29f36c6ee6ac71","source":{"kind":"arxiv","id":"2507.07727","version":1},"attestation_state":"computed","paper":{"title":"Beyond Connectivity: Higher-Order Network Framework for Capturing Memory-Driven Mobility Dynamics","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SI","authors_text":"Chen Zhang, J\\\"urgen Hackl","submitted_at":"2025-07-10T13:02:26Z","abstract_excerpt":"Understanding and predicting mobility dynamics in transportation networks is critical for infrastructure planning, resilience analysis, and traffic management. Traditional graph-based models typically assume memoryless movement, limiting their ability to capture sequential dependencies inherent in real-world mobility patterns. In this study, we introduce a novel higher-order network framework for modeling memory-dependent dynamics in transportation systems. By extending classical graph representations through higher-order Markov chains and de Bruijn graph structures, our framework encodes the "},"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":"2507.07727","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2025-07-10T13:02:26Z","cross_cats_sorted":[],"title_canon_sha256":"35e1849b69b12cf352f7123d507c08d44dafef025755c6e0009f6c07743ccc42","abstract_canon_sha256":"92907521d95c7b0d444ae1bb06a1d12c84c02a295ea76ca010390e6c5d25ff2d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:35:04.091817Z","signature_b64":"qHpXapbjGooJPoayNdhO4K5ZPc3otNs3C/8jr+HxHCULEyx6yrdeHF5G108U/3dCETdzouX1tv46PSrFo4a7Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"98c512ad7cd2daad01f096bccb542bd0892212b05a2276eead29f36c6ee6ac71","last_reissued_at":"2026-07-05T11:35:04.091333Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:35:04.091333Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Beyond Connectivity: Higher-Order Network Framework for Capturing Memory-Driven Mobility Dynamics","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SI","authors_text":"Chen Zhang, J\\\"urgen Hackl","submitted_at":"2025-07-10T13:02:26Z","abstract_excerpt":"Understanding and predicting mobility dynamics in transportation networks is critical for infrastructure planning, resilience analysis, and traffic management. Traditional graph-based models typically assume memoryless movement, limiting their ability to capture sequential dependencies inherent in real-world mobility patterns. In this study, we introduce a novel higher-order network framework for modeling memory-dependent dynamics in transportation systems. By extending classical graph representations through higher-order Markov chains and de Bruijn graph structures, our framework encodes the "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2507.07727","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/2507.07727/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":"2507.07727","created_at":"2026-07-05T11:35:04.091394+00:00"},{"alias_kind":"arxiv_version","alias_value":"2507.07727v1","created_at":"2026-07-05T11:35:04.091394+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.07727","created_at":"2026-07-05T11:35:04.091394+00:00"},{"alias_kind":"pith_short_12","alias_value":"TDCRFLL42LNK","created_at":"2026-07-05T11:35:04.091394+00:00"},{"alias_kind":"pith_short_16","alias_value":"TDCRFLL42LNK2APQ","created_at":"2026-07-05T11:35:04.091394+00:00"},{"alias_kind":"pith_short_8","alias_value":"TDCRFLL4","created_at":"2026-07-05T11:35:04.091394+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.00733","citing_title":"Higher-order Network Analysis of Human Mobility Data","ref_index":12,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/TDCRFLL42LNK2APQS26MWVBL2C","json":"https://pith.science/pith/TDCRFLL42LNK2APQS26MWVBL2C.json","graph_json":"https://pith.science/api/pith-number/TDCRFLL42LNK2APQS26MWVBL2C/graph.json","events_json":"https://pith.science/api/pith-number/TDCRFLL42LNK2APQS26MWVBL2C/events.json","paper":"https://pith.science/paper/TDCRFLL4"},"agent_actions":{"view_html":"https://pith.science/pith/TDCRFLL42LNK2APQS26MWVBL2C","download_json":"https://pith.science/pith/TDCRFLL42LNK2APQS26MWVBL2C.json","view_paper":"https://pith.science/paper/TDCRFLL4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2507.07727&json=true","fetch_graph":"https://pith.science/api/pith-number/TDCRFLL42LNK2APQS26MWVBL2C/graph.json","fetch_events":"https://pith.science/api/pith-number/TDCRFLL42LNK2APQS26MWVBL2C/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TDCRFLL42LNK2APQS26MWVBL2C/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TDCRFLL42LNK2APQS26MWVBL2C/action/storage_attestation","attest_author":"https://pith.science/pith/TDCRFLL42LNK2APQS26MWVBL2C/action/author_attestation","sign_citation":"https://pith.science/pith/TDCRFLL42LNK2APQS26MWVBL2C/action/citation_signature","submit_replication":"https://pith.science/pith/TDCRFLL42LNK2APQS26MWVBL2C/action/replication_record"}},"created_at":"2026-07-05T11:35:04.091394+00:00","updated_at":"2026-07-05T11:35:04.091394+00:00"}