{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:TDCRFLL42LNK2APQS26MWVBL2C","short_pith_number":"pith:TDCRFLL4","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"},"canonical_sha256":"98c512ad7cd2daad01f096bccb542bd0892212b05a2276eead29f36c6ee6ac71","source":{"kind":"arxiv","id":"2507.07727","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2507.07727","created_at":"2026-07-05T11:35:04Z"},{"alias_kind":"arxiv_version","alias_value":"2507.07727v1","created_at":"2026-07-05T11:35:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.07727","created_at":"2026-07-05T11:35:04Z"},{"alias_kind":"pith_short_12","alias_value":"TDCRFLL42LNK","created_at":"2026-07-05T11:35:04Z"},{"alias_kind":"pith_short_16","alias_value":"TDCRFLL42LNK2APQ","created_at":"2026-07-05T11:35:04Z"},{"alias_kind":"pith_short_8","alias_value":"TDCRFLL4","created_at":"2026-07-05T11:35:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:TDCRFLL42LNK2APQS26MWVBL2C","target":"record","payload":{"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"},"canonical_sha256":"98c512ad7cd2daad01f096bccb542bd0892212b05a2276eead29f36c6ee6ac71","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"},"source_kind":"arxiv","source_id":"2507.07727","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-05T11:35:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HkTum/CS+nTFULaDUnKs8e/8LQr5AaZtB7/qlT5mOM4XGJvArmiidDBERdy9642WJfdRKhPFYusqBoi4AMJXAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-07T21:26:59.280947Z"},"content_sha256":"2395076b4b8cd22e4cb6dbc67c1c1162d2f4257373209b5d64845056999517dc","schema_version":"1.0","event_id":"sha256:2395076b4b8cd22e4cb6dbc67c1c1162d2f4257373209b5d64845056999517dc"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:TDCRFLL42LNK2APQS26MWVBL2C","target":"graph","payload":{"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"},"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-05T11:35:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4Pcdhvx5lu0mWEcFdnbNml3KkcpCUyFRDkXS+gqTjqpgLJTXlfrCit4nZAWNBAhCgLd8vJ+OqYWKWl1jo/UmAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-07T21:26:59.281811Z"},"content_sha256":"5c1a0743415ed52139df65639474ac0851443b3d9614a1545c33aac95c44277f","schema_version":"1.0","event_id":"sha256:5c1a0743415ed52139df65639474ac0851443b3d9614a1545c33aac95c44277f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TDCRFLL42LNK2APQS26MWVBL2C/bundle.json","state_url":"https://pith.science/pith/TDCRFLL42LNK2APQS26MWVBL2C/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TDCRFLL42LNK2APQS26MWVBL2C/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-07T21:26:59Z","links":{"resolver":"https://pith.science/pith/TDCRFLL42LNK2APQS26MWVBL2C","bundle":"https://pith.science/pith/TDCRFLL42LNK2APQS26MWVBL2C/bundle.json","state":"https://pith.science/pith/TDCRFLL42LNK2APQS26MWVBL2C/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TDCRFLL42LNK2APQS26MWVBL2C/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:TDCRFLL42LNK2APQS26MWVBL2C","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":"92907521d95c7b0d444ae1bb06a1d12c84c02a295ea76ca010390e6c5d25ff2d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2025-07-10T13:02:26Z","title_canon_sha256":"35e1849b69b12cf352f7123d507c08d44dafef025755c6e0009f6c07743ccc42"},"schema_version":"1.0","source":{"id":"2507.07727","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2507.07727","created_at":"2026-07-05T11:35:04Z"},{"alias_kind":"arxiv_version","alias_value":"2507.07727v1","created_at":"2026-07-05T11:35:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.07727","created_at":"2026-07-05T11:35:04Z"},{"alias_kind":"pith_short_12","alias_value":"TDCRFLL42LNK","created_at":"2026-07-05T11:35:04Z"},{"alias_kind":"pith_short_16","alias_value":"TDCRFLL42LNK2APQ","created_at":"2026-07-05T11:35:04Z"},{"alias_kind":"pith_short_8","alias_value":"TDCRFLL4","created_at":"2026-07-05T11:35:04Z"}],"graph_snapshots":[{"event_id":"sha256:5c1a0743415ed52139df65639474ac0851443b3d9614a1545c33aac95c44277f","target":"graph","created_at":"2026-07-05T11:35: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/2507.07727/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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 ","authors_text":"Chen Zhang, J\\\"urgen Hackl","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2025-07-10T13:02:26Z","title":"Beyond Connectivity: Higher-Order Network Framework for Capturing Memory-Driven Mobility Dynamics"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2507.07727","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:2395076b4b8cd22e4cb6dbc67c1c1162d2f4257373209b5d64845056999517dc","target":"record","created_at":"2026-07-05T11:35: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":"92907521d95c7b0d444ae1bb06a1d12c84c02a295ea76ca010390e6c5d25ff2d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2025-07-10T13:02:26Z","title_canon_sha256":"35e1849b69b12cf352f7123d507c08d44dafef025755c6e0009f6c07743ccc42"},"schema_version":"1.0","source":{"id":"2507.07727","kind":"arxiv","version":1}},"canonical_sha256":"98c512ad7cd2daad01f096bccb542bd0892212b05a2276eead29f36c6ee6ac71","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"98c512ad7cd2daad01f096bccb542bd0892212b05a2276eead29f36c6ee6ac71","first_computed_at":"2026-07-05T11:35:04.091333Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:35:04.091333Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"qHpXapbjGooJPoayNdhO4K5ZPc3otNs3C/8jr+HxHCULEyx6yrdeHF5G108U/3dCETdzouX1tv46PSrFo4a7Aw==","signature_status":"signed_v1","signed_at":"2026-07-05T11:35:04.091817Z","signed_message":"canonical_sha256_bytes"},"source_id":"2507.07727","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2395076b4b8cd22e4cb6dbc67c1c1162d2f4257373209b5d64845056999517dc","sha256:5c1a0743415ed52139df65639474ac0851443b3d9614a1545c33aac95c44277f"],"state_sha256":"bbe4c453a3b2477a9512099474c22a75c6df5e9d4e290d769ac0c093b2d8a86a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sCX6XNKwqxZzsZAwXzf7a4CIADKYKEZ6Upj8R4hKFJDJCRVEYGaLzPAUf+2tZ4kRSlxel772dmWZhgmZjgRNAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-07T21:26:59.287370Z","bundle_sha256":"9d644227751ed4335853ac6dba5f234912aaefc75da7bbf7fa251fbad8afd083"}}