{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:DCREHSNOM257CBD4D7375SIL6V","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":"2ab6a37b1c21b6b1f887eca2273c79b00117db2c1655f503e3e8c063fdc906a9","cross_cats_sorted":["math.CO"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.SI","submitted_at":"2024-05-07T14:42:06Z","title_canon_sha256":"cf955947735bc026eee66f2147b475ebe63d8cecffca9ce55afac912aa1d37e7"},"schema_version":"1.0","source":{"id":"2405.04559","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2405.04559","created_at":"2026-07-05T08:16:50Z"},{"alias_kind":"arxiv_version","alias_value":"2405.04559v1","created_at":"2026-07-05T08:16:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2405.04559","created_at":"2026-07-05T08:16:50Z"},{"alias_kind":"pith_short_12","alias_value":"DCREHSNOM257","created_at":"2026-07-05T08:16:50Z"},{"alias_kind":"pith_short_16","alias_value":"DCREHSNOM257CBD4","created_at":"2026-07-05T08:16:50Z"},{"alias_kind":"pith_short_8","alias_value":"DCREHSNO","created_at":"2026-07-05T08:16:50Z"}],"graph_snapshots":[{"event_id":"sha256:1e5a7632d2bfcf1312ea5472589f9731f11e915a372fb6a620cdf806369e73b1","target":"graph","created_at":"2026-07-05T08:16:50Z","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/2405.04559/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Hypergraphs have been a recent focus of study in mathematical data science as a tool to understand complex networks with high-order connections. One question of particular relevance is how to leverage information carried in hypergraph attributions when doing walk-based techniques. In this work, we focus on a new generalization of a walk in a network that recovers previous approaches and allows for a description of permissible walks in hypergraphs. Permissible walk graphs are constructed by intersecting the attributed $s$-line graph of a hypergraph with a relation respecting graph. The attribut","authors_text":"Audun Myers, Cliff Joslyn, Enzo Battistella, Evan D. Nash, Evgeniya Lagoda, Michael Robinson, Robert Green, Sean English, Van Magnan","cross_cats":["math.CO"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.SI","submitted_at":"2024-05-07T14:42:06Z","title":"Understanding High-Order Network Structure using Permissible Walks on Attributed Hypergraphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2405.04559","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:2d2ebcbf43670c6fdda90bc36ebfd8c44bc83a8f072139bce899edb2fdc9a7c2","target":"record","created_at":"2026-07-05T08:16:50Z","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":"2ab6a37b1c21b6b1f887eca2273c79b00117db2c1655f503e3e8c063fdc906a9","cross_cats_sorted":["math.CO"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.SI","submitted_at":"2024-05-07T14:42:06Z","title_canon_sha256":"cf955947735bc026eee66f2147b475ebe63d8cecffca9ce55afac912aa1d37e7"},"schema_version":"1.0","source":{"id":"2405.04559","kind":"arxiv","version":1}},"canonical_sha256":"18a243c9ae66bbf1047c1ff7fec90bf56b3aa6ba29e3ba311c58da3fd9e90ce9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"18a243c9ae66bbf1047c1ff7fec90bf56b3aa6ba29e3ba311c58da3fd9e90ce9","first_computed_at":"2026-07-05T08:16:50.546140Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T08:16:50.546140Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"T6R6IYAx5jo+K91vggIzNN99fF8LaaWHlaBoaoEcTfcAXsI1b6oyyoxVTum7Zxeftq4PrvlUjb8oi0CY9YILDg==","signature_status":"signed_v1","signed_at":"2026-07-05T08:16:50.546606Z","signed_message":"canonical_sha256_bytes"},"source_id":"2405.04559","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2d2ebcbf43670c6fdda90bc36ebfd8c44bc83a8f072139bce899edb2fdc9a7c2","sha256:1e5a7632d2bfcf1312ea5472589f9731f11e915a372fb6a620cdf806369e73b1"],"state_sha256":"09ad2fe2d217fca793d6d6b664b25b00a3a904f61e3749d0c3c686d57904619c"}