{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:Y4PL2FS753CZI7YXKO5BTZBDPY","short_pith_number":"pith:Y4PL2FS7","schema_version":"1.0","canonical_sha256":"c71ebd165feec5947f1753ba19e4237e3b601df0ce95cacc065a3cef718e7427","source":{"kind":"arxiv","id":"1802.09515","version":1},"attestation_state":"computed","paper":{"title":"Representations of Sparse Distributed Networks: A Locality-Sensitive Approach","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Haim Kaplan, Shay Solomon","submitted_at":"2018-02-26T18:59:54Z","abstract_excerpt":"In 1999, Brodal and Fagerberg (BF) gave an algorithm for maintaining a low outdegree orientation of a dynamic uniformly sparse graph. Specifically, for a dynamic graph on $n$-vertices, with arboricity bounded by $\\alpha$ at all times, the BF algorithm supports edge updates in $O(\\log n)$ amortized update time, while keeping the maximum outdegree in the graph bounded by $O(\\alpha)$. Such an orientation provides a basic data structure for uniformly sparse graphs, which found applications to a plethora of dynamic graph algorithms.\n  A significant weakness of the BF algorithm is the possible \\emph"},"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":"1802.09515","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-02-26T18:59:54Z","cross_cats_sorted":[],"title_canon_sha256":"791491b67243bd5eac2f24e059a14cbfb86547160fc2c7419418abc30de1fe8c","abstract_canon_sha256":"b584f7d3bd9c4cc2a85719e04dc51e578d640758b1235d226e17a09c1552442d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:22:33.572851Z","signature_b64":"6+Ejx3M3eyd5CcbxBSAmqjQgQHAgcx4N23chEc/f+0QNnNskUbWeWkNdOKfgXkhnSzjMpYFR+W+plwUqGQh7AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c71ebd165feec5947f1753ba19e4237e3b601df0ce95cacc065a3cef718e7427","last_reissued_at":"2026-05-18T00:22:33.572144Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:22:33.572144Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Representations of Sparse Distributed Networks: A Locality-Sensitive Approach","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Haim Kaplan, Shay Solomon","submitted_at":"2018-02-26T18:59:54Z","abstract_excerpt":"In 1999, Brodal and Fagerberg (BF) gave an algorithm for maintaining a low outdegree orientation of a dynamic uniformly sparse graph. Specifically, for a dynamic graph on $n$-vertices, with arboricity bounded by $\\alpha$ at all times, the BF algorithm supports edge updates in $O(\\log n)$ amortized update time, while keeping the maximum outdegree in the graph bounded by $O(\\alpha)$. Such an orientation provides a basic data structure for uniformly sparse graphs, which found applications to a plethora of dynamic graph algorithms.\n  A significant weakness of the BF algorithm is the possible \\emph"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.09515","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":"1802.09515","created_at":"2026-05-18T00:22:33.572263+00:00"},{"alias_kind":"arxiv_version","alias_value":"1802.09515v1","created_at":"2026-05-18T00:22:33.572263+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.09515","created_at":"2026-05-18T00:22:33.572263+00:00"},{"alias_kind":"pith_short_12","alias_value":"Y4PL2FS753CZ","created_at":"2026-05-18T12:33:04.347982+00:00"},{"alias_kind":"pith_short_16","alias_value":"Y4PL2FS753CZI7YX","created_at":"2026-05-18T12:33:04.347982+00:00"},{"alias_kind":"pith_short_8","alias_value":"Y4PL2FS7","created_at":"2026-05-18T12:33:04.347982+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/Y4PL2FS753CZI7YXKO5BTZBDPY","json":"https://pith.science/pith/Y4PL2FS753CZI7YXKO5BTZBDPY.json","graph_json":"https://pith.science/api/pith-number/Y4PL2FS753CZI7YXKO5BTZBDPY/graph.json","events_json":"https://pith.science/api/pith-number/Y4PL2FS753CZI7YXKO5BTZBDPY/events.json","paper":"https://pith.science/paper/Y4PL2FS7"},"agent_actions":{"view_html":"https://pith.science/pith/Y4PL2FS753CZI7YXKO5BTZBDPY","download_json":"https://pith.science/pith/Y4PL2FS753CZI7YXKO5BTZBDPY.json","view_paper":"https://pith.science/paper/Y4PL2FS7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1802.09515&json=true","fetch_graph":"https://pith.science/api/pith-number/Y4PL2FS753CZI7YXKO5BTZBDPY/graph.json","fetch_events":"https://pith.science/api/pith-number/Y4PL2FS753CZI7YXKO5BTZBDPY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Y4PL2FS753CZI7YXKO5BTZBDPY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Y4PL2FS753CZI7YXKO5BTZBDPY/action/storage_attestation","attest_author":"https://pith.science/pith/Y4PL2FS753CZI7YXKO5BTZBDPY/action/author_attestation","sign_citation":"https://pith.science/pith/Y4PL2FS753CZI7YXKO5BTZBDPY/action/citation_signature","submit_replication":"https://pith.science/pith/Y4PL2FS753CZI7YXKO5BTZBDPY/action/replication_record"}},"created_at":"2026-05-18T00:22:33.572263+00:00","updated_at":"2026-05-18T00:22:33.572263+00:00"}