{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:ZC4O7GKOQOCCPYVWSJAVTJE7BW","short_pith_number":"pith:ZC4O7GKO","schema_version":"1.0","canonical_sha256":"c8b8ef994e838427e2b6924159a49f0da33dc2f564ed1e7e1f282aad5f4d82cc","source":{"kind":"arxiv","id":"1202.0082","version":1},"attestation_state":"computed","paper":{"title":"Dynamic Shortest Path Algorithms for Hypergraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Amotz Bar-Noy, Ananthram Swami, Jianhang Gao, Qing Zhao, Ram Ramanathan, Wei Ren","submitted_at":"2012-02-01T02:19:46Z","abstract_excerpt":"A hypergraph is a set V of vertices and a set of non-empty subsets of V, called hyperedges. Unlike graphs, hypergraphs can capture higher-order interactions in social and communication networks that go beyond a simple union of pairwise relationships. In this paper, we consider the shortest path problem in hypergraphs. We develop two algorithms for finding and maintaining the shortest hyperpaths in a dynamic network with both weight and topological changes. These two algorithms are the first to address the fully dynamic shortest path problem in a general hypergraph. They complement each other b"},"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":"1202.0082","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-02-01T02:19:46Z","cross_cats_sorted":[],"title_canon_sha256":"dcd1ca39116fd72a338053e97fbfc7ab9e03a590a5c78c76a68a387331e1a7e2","abstract_canon_sha256":"ba55a798c644721ce03f003843cd4824d1ff0ed662942f7f1a8d9b1556082e5a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:03:20.560453Z","signature_b64":"VtGldRPetY76LxkSpJJBf/y7PAizZlpfMzKxqFYGbvsAr8HhKgn0jcUng8tbDR/hOj9N3HDKilKCUq7qhLkvDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c8b8ef994e838427e2b6924159a49f0da33dc2f564ed1e7e1f282aad5f4d82cc","last_reissued_at":"2026-05-18T04:03:20.560032Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:03:20.560032Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Dynamic Shortest Path Algorithms for Hypergraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Amotz Bar-Noy, Ananthram Swami, Jianhang Gao, Qing Zhao, Ram Ramanathan, Wei Ren","submitted_at":"2012-02-01T02:19:46Z","abstract_excerpt":"A hypergraph is a set V of vertices and a set of non-empty subsets of V, called hyperedges. Unlike graphs, hypergraphs can capture higher-order interactions in social and communication networks that go beyond a simple union of pairwise relationships. In this paper, we consider the shortest path problem in hypergraphs. We develop two algorithms for finding and maintaining the shortest hyperpaths in a dynamic network with both weight and topological changes. These two algorithms are the first to address the fully dynamic shortest path problem in a general hypergraph. They complement each other b"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1202.0082","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":""},"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":"1202.0082","created_at":"2026-05-18T04:03:20.560086+00:00"},{"alias_kind":"arxiv_version","alias_value":"1202.0082v1","created_at":"2026-05-18T04:03:20.560086+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1202.0082","created_at":"2026-05-18T04:03:20.560086+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZC4O7GKOQOCC","created_at":"2026-05-18T12:27:30.460161+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZC4O7GKOQOCCPYVW","created_at":"2026-05-18T12:27:30.460161+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZC4O7GKO","created_at":"2026-05-18T12:27:30.460161+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/ZC4O7GKOQOCCPYVWSJAVTJE7BW","json":"https://pith.science/pith/ZC4O7GKOQOCCPYVWSJAVTJE7BW.json","graph_json":"https://pith.science/api/pith-number/ZC4O7GKOQOCCPYVWSJAVTJE7BW/graph.json","events_json":"https://pith.science/api/pith-number/ZC4O7GKOQOCCPYVWSJAVTJE7BW/events.json","paper":"https://pith.science/paper/ZC4O7GKO"},"agent_actions":{"view_html":"https://pith.science/pith/ZC4O7GKOQOCCPYVWSJAVTJE7BW","download_json":"https://pith.science/pith/ZC4O7GKOQOCCPYVWSJAVTJE7BW.json","view_paper":"https://pith.science/paper/ZC4O7GKO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1202.0082&json=true","fetch_graph":"https://pith.science/api/pith-number/ZC4O7GKOQOCCPYVWSJAVTJE7BW/graph.json","fetch_events":"https://pith.science/api/pith-number/ZC4O7GKOQOCCPYVWSJAVTJE7BW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZC4O7GKOQOCCPYVWSJAVTJE7BW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZC4O7GKOQOCCPYVWSJAVTJE7BW/action/storage_attestation","attest_author":"https://pith.science/pith/ZC4O7GKOQOCCPYVWSJAVTJE7BW/action/author_attestation","sign_citation":"https://pith.science/pith/ZC4O7GKOQOCCPYVWSJAVTJE7BW/action/citation_signature","submit_replication":"https://pith.science/pith/ZC4O7GKOQOCCPYVWSJAVTJE7BW/action/replication_record"}},"created_at":"2026-05-18T04:03:20.560086+00:00","updated_at":"2026-05-18T04:03:20.560086+00:00"}