{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:35DDEVNYII4I24CJXWC4XUHRFG","short_pith_number":"pith:35DDEVNY","canonical_record":{"source":{"id":"2007.02861","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-07-06T16:27:02Z","cross_cats_sorted":["cs.SI","stat.ME","stat.ML"],"title_canon_sha256":"12c84031c88fb7020720e47d09984d370cebf3a56d18bde4b9f768dc6b16d476","abstract_canon_sha256":"e2efd83d0c0e2b95289507715cc6fcd3d15fe6d7783370f59cedf2893f32ed69"},"schema_version":"1.0"},"canonical_sha256":"df463255b842388d7049bd85cbd0f129ade26793992986e97e41f8243ef32461","source":{"kind":"arxiv","id":"2007.02861","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2007.02861","created_at":"2026-07-05T01:16:35Z"},{"alias_kind":"arxiv_version","alias_value":"2007.02861v1","created_at":"2026-07-05T01:16:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2007.02861","created_at":"2026-07-05T01:16:35Z"},{"alias_kind":"pith_short_12","alias_value":"35DDEVNYII4I","created_at":"2026-07-05T01:16:35Z"},{"alias_kind":"pith_short_16","alias_value":"35DDEVNYII4I24CJ","created_at":"2026-07-05T01:16:35Z"},{"alias_kind":"pith_short_8","alias_value":"35DDEVNY","created_at":"2026-07-05T01:16:35Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:35DDEVNYII4I24CJXWC4XUHRFG","target":"record","payload":{"canonical_record":{"source":{"id":"2007.02861","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-07-06T16:27:02Z","cross_cats_sorted":["cs.SI","stat.ME","stat.ML"],"title_canon_sha256":"12c84031c88fb7020720e47d09984d370cebf3a56d18bde4b9f768dc6b16d476","abstract_canon_sha256":"e2efd83d0c0e2b95289507715cc6fcd3d15fe6d7783370f59cedf2893f32ed69"},"schema_version":"1.0"},"canonical_sha256":"df463255b842388d7049bd85cbd0f129ade26793992986e97e41f8243ef32461","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:16:35.545971Z","signature_b64":"Iqo+tH2g0sLAvbnmSBMAg+WBxvENi5aFe41HMIjqdZBes2P4k0qTe69hBHAYvsPbT/DjFTW7HRDBMiJndL2BBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"df463255b842388d7049bd85cbd0f129ade26793992986e97e41f8243ef32461","last_reissued_at":"2026-07-05T01:16:35.545384Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:16:35.545384Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2007.02861","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:16:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wcRStlk56rPD+fdsJ+w1r2HvcTwyGWAW2sT4XFfN67Ycsm0X6jgkKyKrdN7MiALBnrZkB2eiftM+7F6NgR0CDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T17:16:41.957336Z"},"content_sha256":"b5e751ba2694ddb5e0268e5af8cfadd3b53868d4a83c761fd576c6d270be0794","schema_version":"1.0","event_id":"sha256:b5e751ba2694ddb5e0268e5af8cfadd3b53868d4a83c761fd576c6d270be0794"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:35DDEVNYII4I24CJXWC4XUHRFG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Learning the Markov order of paths in a network","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SI","stat.ME","stat.ML"],"primary_cat":"cs.LG","authors_text":"Ingo Scholtes, Luka V. Petrovi\\'c","submitted_at":"2020-07-06T16:27:02Z","abstract_excerpt":"We study the problem of learning the Markov order in categorical sequences that represent paths in a network, i.e. sequences of variable lengths where transitions between states are constrained to a known graph. Such data pose challenges for standard Markov order detection methods and demand modelling techniques that explicitly account for the graph constraint. Adopting a multi-order modelling framework for paths, we develop a Bayesian learning technique that (i) more reliably detects the correct Markov order compared to a competing method based on the likelihood ratio test, (ii) requires cons"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2007.02861","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/2007.02861/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:16:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QwnvRUoUYd8VVEfbLsPXFA+BVsYr7PvMYyrlw4VAOVYH+syegiOYZDb3I86hL1Wbf3eh1fHEr/c/1tRAgd+uAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T17:16:41.957873Z"},"content_sha256":"395c692ecfd9c326da1c6060b28b1fc7f1dea3aa67c26e0f3bb79b7353b45886","schema_version":"1.0","event_id":"sha256:395c692ecfd9c326da1c6060b28b1fc7f1dea3aa67c26e0f3bb79b7353b45886"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/35DDEVNYII4I24CJXWC4XUHRFG/bundle.json","state_url":"https://pith.science/pith/35DDEVNYII4I24CJXWC4XUHRFG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/35DDEVNYII4I24CJXWC4XUHRFG/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-16T17:16:41Z","links":{"resolver":"https://pith.science/pith/35DDEVNYII4I24CJXWC4XUHRFG","bundle":"https://pith.science/pith/35DDEVNYII4I24CJXWC4XUHRFG/bundle.json","state":"https://pith.science/pith/35DDEVNYII4I24CJXWC4XUHRFG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/35DDEVNYII4I24CJXWC4XUHRFG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:35DDEVNYII4I24CJXWC4XUHRFG","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":"e2efd83d0c0e2b95289507715cc6fcd3d15fe6d7783370f59cedf2893f32ed69","cross_cats_sorted":["cs.SI","stat.ME","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-07-06T16:27:02Z","title_canon_sha256":"12c84031c88fb7020720e47d09984d370cebf3a56d18bde4b9f768dc6b16d476"},"schema_version":"1.0","source":{"id":"2007.02861","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2007.02861","created_at":"2026-07-05T01:16:35Z"},{"alias_kind":"arxiv_version","alias_value":"2007.02861v1","created_at":"2026-07-05T01:16:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2007.02861","created_at":"2026-07-05T01:16:35Z"},{"alias_kind":"pith_short_12","alias_value":"35DDEVNYII4I","created_at":"2026-07-05T01:16:35Z"},{"alias_kind":"pith_short_16","alias_value":"35DDEVNYII4I24CJ","created_at":"2026-07-05T01:16:35Z"},{"alias_kind":"pith_short_8","alias_value":"35DDEVNY","created_at":"2026-07-05T01:16:35Z"}],"graph_snapshots":[{"event_id":"sha256:395c692ecfd9c326da1c6060b28b1fc7f1dea3aa67c26e0f3bb79b7353b45886","target":"graph","created_at":"2026-07-05T01:16:35Z","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/2007.02861/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We study the problem of learning the Markov order in categorical sequences that represent paths in a network, i.e. sequences of variable lengths where transitions between states are constrained to a known graph. Such data pose challenges for standard Markov order detection methods and demand modelling techniques that explicitly account for the graph constraint. Adopting a multi-order modelling framework for paths, we develop a Bayesian learning technique that (i) more reliably detects the correct Markov order compared to a competing method based on the likelihood ratio test, (ii) requires cons","authors_text":"Ingo Scholtes, Luka V. Petrovi\\'c","cross_cats":["cs.SI","stat.ME","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-07-06T16:27:02Z","title":"Learning the Markov order of paths in a network"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2007.02861","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:b5e751ba2694ddb5e0268e5af8cfadd3b53868d4a83c761fd576c6d270be0794","target":"record","created_at":"2026-07-05T01:16:35Z","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":"e2efd83d0c0e2b95289507715cc6fcd3d15fe6d7783370f59cedf2893f32ed69","cross_cats_sorted":["cs.SI","stat.ME","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-07-06T16:27:02Z","title_canon_sha256":"12c84031c88fb7020720e47d09984d370cebf3a56d18bde4b9f768dc6b16d476"},"schema_version":"1.0","source":{"id":"2007.02861","kind":"arxiv","version":1}},"canonical_sha256":"df463255b842388d7049bd85cbd0f129ade26793992986e97e41f8243ef32461","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"df463255b842388d7049bd85cbd0f129ade26793992986e97e41f8243ef32461","first_computed_at":"2026-07-05T01:16:35.545384Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T01:16:35.545384Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Iqo+tH2g0sLAvbnmSBMAg+WBxvENi5aFe41HMIjqdZBes2P4k0qTe69hBHAYvsPbT/DjFTW7HRDBMiJndL2BBQ==","signature_status":"signed_v1","signed_at":"2026-07-05T01:16:35.545971Z","signed_message":"canonical_sha256_bytes"},"source_id":"2007.02861","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b5e751ba2694ddb5e0268e5af8cfadd3b53868d4a83c761fd576c6d270be0794","sha256:395c692ecfd9c326da1c6060b28b1fc7f1dea3aa67c26e0f3bb79b7353b45886"],"state_sha256":"132994f6b81d35b2acb0d41e4f530c702e954466b2421b7d579d9c5692c441ae"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"noJjs4jUJduLwCPSvRt8wg7DP5ova2/1+k9J5xeQKqm+VF7oqw00Q3EgOa+iXXj5wJju8reR28Zj9KGXBic/Ag==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-16T17:16:41.962294Z","bundle_sha256":"6e1cf2d5bb0a5841cc2306cf804bb940adab332f6a95a724a81d1ac050bd7e51"}}