{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:IUWBVQ2PDHZ346QVN2UYLQDWA7","short_pith_number":"pith:IUWBVQ2P","schema_version":"1.0","canonical_sha256":"452c1ac34f19f3be7a156ea985c07607e7ada0924ff336a0ae7f1356eef97018","source":{"kind":"arxiv","id":"1907.10444","version":1},"attestation_state":"computed","paper":{"title":"Constant Delay Traversal of Grammar-Compressed Graphs with Bounded Rank","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Fabian Peternek, Sebastian Maneth","submitted_at":"2019-07-24T13:39:59Z","abstract_excerpt":"We present a pointer-based data structure for constant time traversal of the edges of an edge-labeled (alphabet $\\Sigma$) directed hypergraph (a graph where edges can be incident to more than two vertices, and the incident vertices are ordered) given as hyperedge-replacement grammar $G$. It is assumed that the grammar has a fixed rank $\\kappa$ (maximal number of vertices connected to a nonterminal hyperedge) and that each vertex of the represented graph is incident to at most one $\\sigma$-edge per direction ($\\sigma \\in \\Sigma$). Precomputing the data structure needs $O(|G||\\Sigma|\\kappa r h)$"},"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":"1907.10444","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-07-24T13:39:59Z","cross_cats_sorted":[],"title_canon_sha256":"9c9a7784d1a2821a46522d2aadd899177b8b834086fc6d139f37074e22d5a1f9","abstract_canon_sha256":"8c3b047ec7db2c701b8bac436a51694ac5e85926c7758da8017e3c7898a354cb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:39:37.905673Z","signature_b64":"9ZURzfow278/9OO+Mqb6iE8a0T9h18jbPIqile4YNag8VRNFNJSKPD0HEI4fKibTm/dhTFbuhYi6IhYvfWIAAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"452c1ac34f19f3be7a156ea985c07607e7ada0924ff336a0ae7f1356eef97018","last_reissued_at":"2026-05-17T23:39:37.905004Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:39:37.905004Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Constant Delay Traversal of Grammar-Compressed Graphs with Bounded Rank","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Fabian Peternek, Sebastian Maneth","submitted_at":"2019-07-24T13:39:59Z","abstract_excerpt":"We present a pointer-based data structure for constant time traversal of the edges of an edge-labeled (alphabet $\\Sigma$) directed hypergraph (a graph where edges can be incident to more than two vertices, and the incident vertices are ordered) given as hyperedge-replacement grammar $G$. It is assumed that the grammar has a fixed rank $\\kappa$ (maximal number of vertices connected to a nonterminal hyperedge) and that each vertex of the represented graph is incident to at most one $\\sigma$-edge per direction ($\\sigma \\in \\Sigma$). Precomputing the data structure needs $O(|G||\\Sigma|\\kappa r h)$"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.10444","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":"1907.10444","created_at":"2026-05-17T23:39:37.905113+00:00"},{"alias_kind":"arxiv_version","alias_value":"1907.10444v1","created_at":"2026-05-17T23:39:37.905113+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.10444","created_at":"2026-05-17T23:39:37.905113+00:00"},{"alias_kind":"pith_short_12","alias_value":"IUWBVQ2PDHZ3","created_at":"2026-05-18T12:33:18.533446+00:00"},{"alias_kind":"pith_short_16","alias_value":"IUWBVQ2PDHZ346QV","created_at":"2026-05-18T12:33:18.533446+00:00"},{"alias_kind":"pith_short_8","alias_value":"IUWBVQ2P","created_at":"2026-05-18T12:33:18.533446+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/IUWBVQ2PDHZ346QVN2UYLQDWA7","json":"https://pith.science/pith/IUWBVQ2PDHZ346QVN2UYLQDWA7.json","graph_json":"https://pith.science/api/pith-number/IUWBVQ2PDHZ346QVN2UYLQDWA7/graph.json","events_json":"https://pith.science/api/pith-number/IUWBVQ2PDHZ346QVN2UYLQDWA7/events.json","paper":"https://pith.science/paper/IUWBVQ2P"},"agent_actions":{"view_html":"https://pith.science/pith/IUWBVQ2PDHZ346QVN2UYLQDWA7","download_json":"https://pith.science/pith/IUWBVQ2PDHZ346QVN2UYLQDWA7.json","view_paper":"https://pith.science/paper/IUWBVQ2P","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1907.10444&json=true","fetch_graph":"https://pith.science/api/pith-number/IUWBVQ2PDHZ346QVN2UYLQDWA7/graph.json","fetch_events":"https://pith.science/api/pith-number/IUWBVQ2PDHZ346QVN2UYLQDWA7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IUWBVQ2PDHZ346QVN2UYLQDWA7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IUWBVQ2PDHZ346QVN2UYLQDWA7/action/storage_attestation","attest_author":"https://pith.science/pith/IUWBVQ2PDHZ346QVN2UYLQDWA7/action/author_attestation","sign_citation":"https://pith.science/pith/IUWBVQ2PDHZ346QVN2UYLQDWA7/action/citation_signature","submit_replication":"https://pith.science/pith/IUWBVQ2PDHZ346QVN2UYLQDWA7/action/replication_record"}},"created_at":"2026-05-17T23:39:37.905113+00:00","updated_at":"2026-05-17T23:39:37.905113+00:00"}