{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:Y4PL2FS753CZI7YXKO5BTZBDPY","short_pith_number":"pith:Y4PL2FS7","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"},"canonical_sha256":"c71ebd165feec5947f1753ba19e4237e3b601df0ce95cacc065a3cef718e7427","source":{"kind":"arxiv","id":"1802.09515","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.09515","created_at":"2026-05-18T00:22:33Z"},{"alias_kind":"arxiv_version","alias_value":"1802.09515v1","created_at":"2026-05-18T00:22:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.09515","created_at":"2026-05-18T00:22:33Z"},{"alias_kind":"pith_short_12","alias_value":"Y4PL2FS753CZ","created_at":"2026-05-18T12:33:04Z"},{"alias_kind":"pith_short_16","alias_value":"Y4PL2FS753CZI7YX","created_at":"2026-05-18T12:33:04Z"},{"alias_kind":"pith_short_8","alias_value":"Y4PL2FS7","created_at":"2026-05-18T12:33:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:Y4PL2FS753CZI7YXKO5BTZBDPY","target":"record","payload":{"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"},"canonical_sha256":"c71ebd165feec5947f1753ba19e4237e3b601df0ce95cacc065a3cef718e7427","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"},"source_kind":"arxiv","source_id":"1802.09515","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:22:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"laPtRNVJ61xF9Me7q6ytoUDYKtilCjMkOX0+QlPwSFGWknBqW2TzQlYCxO4RHps2YskkZP47p0z41Vxtjnv1CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T07:34:45.896394Z"},"content_sha256":"d5c1028e8e18d1b9fc95ff27ef7f8a77bf6a3632662a6e8e201b922478f6390e","schema_version":"1.0","event_id":"sha256:d5c1028e8e18d1b9fc95ff27ef7f8a77bf6a3632662a6e8e201b922478f6390e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:Y4PL2FS753CZI7YXKO5BTZBDPY","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:22:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8wwuVQs6ghykCA9OiPN+SRdMSyNS/fjE0VVqafDXeIoq7XZsLRtbYkXyf/eU4d5sARJ+8W8aCfJmDGWiLU4YCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T07:34:45.897029Z"},"content_sha256":"9cb42038ddddd619d1b286d8ace2eb31b2ad2710ac18f1ed7ecdff0c5c13a90e","schema_version":"1.0","event_id":"sha256:9cb42038ddddd619d1b286d8ace2eb31b2ad2710ac18f1ed7ecdff0c5c13a90e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/Y4PL2FS753CZI7YXKO5BTZBDPY/bundle.json","state_url":"https://pith.science/pith/Y4PL2FS753CZI7YXKO5BTZBDPY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/Y4PL2FS753CZI7YXKO5BTZBDPY/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-27T07:34:45Z","links":{"resolver":"https://pith.science/pith/Y4PL2FS753CZI7YXKO5BTZBDPY","bundle":"https://pith.science/pith/Y4PL2FS753CZI7YXKO5BTZBDPY/bundle.json","state":"https://pith.science/pith/Y4PL2FS753CZI7YXKO5BTZBDPY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/Y4PL2FS753CZI7YXKO5BTZBDPY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:Y4PL2FS753CZI7YXKO5BTZBDPY","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":"b584f7d3bd9c4cc2a85719e04dc51e578d640758b1235d226e17a09c1552442d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-02-26T18:59:54Z","title_canon_sha256":"791491b67243bd5eac2f24e059a14cbfb86547160fc2c7419418abc30de1fe8c"},"schema_version":"1.0","source":{"id":"1802.09515","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.09515","created_at":"2026-05-18T00:22:33Z"},{"alias_kind":"arxiv_version","alias_value":"1802.09515v1","created_at":"2026-05-18T00:22:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.09515","created_at":"2026-05-18T00:22:33Z"},{"alias_kind":"pith_short_12","alias_value":"Y4PL2FS753CZ","created_at":"2026-05-18T12:33:04Z"},{"alias_kind":"pith_short_16","alias_value":"Y4PL2FS753CZI7YX","created_at":"2026-05-18T12:33:04Z"},{"alias_kind":"pith_short_8","alias_value":"Y4PL2FS7","created_at":"2026-05-18T12:33:04Z"}],"graph_snapshots":[{"event_id":"sha256:9cb42038ddddd619d1b286d8ace2eb31b2ad2710ac18f1ed7ecdff0c5c13a90e","target":"graph","created_at":"2026-05-18T00:22:33Z","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"},"paper":{"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","authors_text":"Haim Kaplan, Shay Solomon","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-02-26T18:59:54Z","title":"Representations of Sparse Distributed Networks: A Locality-Sensitive Approach"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.09515","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:d5c1028e8e18d1b9fc95ff27ef7f8a77bf6a3632662a6e8e201b922478f6390e","target":"record","created_at":"2026-05-18T00:22:33Z","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":"b584f7d3bd9c4cc2a85719e04dc51e578d640758b1235d226e17a09c1552442d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-02-26T18:59:54Z","title_canon_sha256":"791491b67243bd5eac2f24e059a14cbfb86547160fc2c7419418abc30de1fe8c"},"schema_version":"1.0","source":{"id":"1802.09515","kind":"arxiv","version":1}},"canonical_sha256":"c71ebd165feec5947f1753ba19e4237e3b601df0ce95cacc065a3cef718e7427","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c71ebd165feec5947f1753ba19e4237e3b601df0ce95cacc065a3cef718e7427","first_computed_at":"2026-05-18T00:22:33.572144Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:22:33.572144Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"6+Ejx3M3eyd5CcbxBSAmqjQgQHAgcx4N23chEc/f+0QNnNskUbWeWkNdOKfgXkhnSzjMpYFR+W+plwUqGQh7AA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:22:33.572851Z","signed_message":"canonical_sha256_bytes"},"source_id":"1802.09515","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d5c1028e8e18d1b9fc95ff27ef7f8a77bf6a3632662a6e8e201b922478f6390e","sha256:9cb42038ddddd619d1b286d8ace2eb31b2ad2710ac18f1ed7ecdff0c5c13a90e"],"state_sha256":"cd8d9b8bf74193b0e82599325d110c3465b713ccae9694fac45d204f2a8958cc"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"U+BVO8ZHPWrBlHr4bqLR3D2GZWL/d7PXzYHl13hZa9Hlw/mzLfFlIgnyjKf4b43Se7Zh4AjfmAADwtIp2HFaDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T07:34:45.900590Z","bundle_sha256":"e297a9f69e6787033e77da65c779b3624b45492f385e61e042b53a205fa3a26b"}}