{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:DCREHSNOM257CBD4D7375SIL6V","short_pith_number":"pith:DCREHSNO","schema_version":"1.0","canonical_sha256":"18a243c9ae66bbf1047c1ff7fec90bf56b3aa6ba29e3ba311c58da3fd9e90ce9","source":{"kind":"arxiv","id":"2405.04559","version":1},"attestation_state":"computed","paper":{"title":"Understanding High-Order Network Structure using Permissible Walks on Attributed Hypergraphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.SI","authors_text":"Audun Myers, Cliff Joslyn, Enzo Battistella, Evan D. Nash, Evgeniya Lagoda, Michael Robinson, Robert Green, Sean English, Van Magnan","submitted_at":"2024-05-07T14:42:06Z","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"},"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":"2405.04559","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.SI","submitted_at":"2024-05-07T14:42:06Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"cf955947735bc026eee66f2147b475ebe63d8cecffca9ce55afac912aa1d37e7","abstract_canon_sha256":"2ab6a37b1c21b6b1f887eca2273c79b00117db2c1655f503e3e8c063fdc906a9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:16:50.546606Z","signature_b64":"T6R6IYAx5jo+K91vggIzNN99fF8LaaWHlaBoaoEcTfcAXsI1b6oyyoxVTum7Zxeftq4PrvlUjb8oi0CY9YILDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"18a243c9ae66bbf1047c1ff7fec90bf56b3aa6ba29e3ba311c58da3fd9e90ce9","last_reissued_at":"2026-07-05T08:16:50.546140Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:16:50.546140Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Understanding High-Order Network Structure using Permissible Walks on Attributed Hypergraphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.SI","authors_text":"Audun Myers, Cliff Joslyn, Enzo Battistella, Evan D. Nash, Evgeniya Lagoda, Michael Robinson, Robert Green, Sean English, Van Magnan","submitted_at":"2024-05-07T14:42:06Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2405.04559","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/2405.04559/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":"2405.04559","created_at":"2026-07-05T08:16:50.546203+00:00"},{"alias_kind":"arxiv_version","alias_value":"2405.04559v1","created_at":"2026-07-05T08:16:50.546203+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2405.04559","created_at":"2026-07-05T08:16:50.546203+00:00"},{"alias_kind":"pith_short_12","alias_value":"DCREHSNOM257","created_at":"2026-07-05T08:16:50.546203+00:00"},{"alias_kind":"pith_short_16","alias_value":"DCREHSNOM257CBD4","created_at":"2026-07-05T08:16:50.546203+00:00"},{"alias_kind":"pith_short_8","alias_value":"DCREHSNO","created_at":"2026-07-05T08:16:50.546203+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/DCREHSNOM257CBD4D7375SIL6V","json":"https://pith.science/pith/DCREHSNOM257CBD4D7375SIL6V.json","graph_json":"https://pith.science/api/pith-number/DCREHSNOM257CBD4D7375SIL6V/graph.json","events_json":"https://pith.science/api/pith-number/DCREHSNOM257CBD4D7375SIL6V/events.json","paper":"https://pith.science/paper/DCREHSNO"},"agent_actions":{"view_html":"https://pith.science/pith/DCREHSNOM257CBD4D7375SIL6V","download_json":"https://pith.science/pith/DCREHSNOM257CBD4D7375SIL6V.json","view_paper":"https://pith.science/paper/DCREHSNO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2405.04559&json=true","fetch_graph":"https://pith.science/api/pith-number/DCREHSNOM257CBD4D7375SIL6V/graph.json","fetch_events":"https://pith.science/api/pith-number/DCREHSNOM257CBD4D7375SIL6V/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DCREHSNOM257CBD4D7375SIL6V/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DCREHSNOM257CBD4D7375SIL6V/action/storage_attestation","attest_author":"https://pith.science/pith/DCREHSNOM257CBD4D7375SIL6V/action/author_attestation","sign_citation":"https://pith.science/pith/DCREHSNOM257CBD4D7375SIL6V/action/citation_signature","submit_replication":"https://pith.science/pith/DCREHSNOM257CBD4D7375SIL6V/action/replication_record"}},"created_at":"2026-07-05T08:16:50.546203+00:00","updated_at":"2026-07-05T08:16:50.546203+00:00"}