{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:ZHE2FOEXRWKA7B7S6YXHZI6EK6","short_pith_number":"pith:ZHE2FOEX","canonical_record":{"source":{"id":"1407.6755","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-07-24T23:02:09Z","cross_cats_sorted":[],"title_canon_sha256":"32e578c8d9bb0129bfccbe695a4e9ed7d7a3a0aa52ad3b47d71edfcdb79452d7","abstract_canon_sha256":"49f1bdee66a84bbfc14849661da608e7d32bd3fe6e221f1527a249dfbc730b72"},"schema_version":"1.0"},"canonical_sha256":"c9c9a2b8978d940f87f2f62e7ca3c457be9fa94084395c572fee9b43518a7dc9","source":{"kind":"arxiv","id":"1407.6755","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1407.6755","created_at":"2026-05-18T02:17:01Z"},{"alias_kind":"arxiv_version","alias_value":"1407.6755v2","created_at":"2026-05-18T02:17:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.6755","created_at":"2026-05-18T02:17:01Z"},{"alias_kind":"pith_short_12","alias_value":"ZHE2FOEXRWKA","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_16","alias_value":"ZHE2FOEXRWKA7B7S","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_8","alias_value":"ZHE2FOEX","created_at":"2026-05-18T12:28:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:ZHE2FOEXRWKA7B7S6YXHZI6EK6","target":"record","payload":{"canonical_record":{"source":{"id":"1407.6755","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-07-24T23:02:09Z","cross_cats_sorted":[],"title_canon_sha256":"32e578c8d9bb0129bfccbe695a4e9ed7d7a3a0aa52ad3b47d71edfcdb79452d7","abstract_canon_sha256":"49f1bdee66a84bbfc14849661da608e7d32bd3fe6e221f1527a249dfbc730b72"},"schema_version":"1.0"},"canonical_sha256":"c9c9a2b8978d940f87f2f62e7ca3c457be9fa94084395c572fee9b43518a7dc9","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:17:01.256854Z","signature_b64":"fuJJT7Jr8iMx07SiyQZSwGz5cYIsqg5doWWaYip4sVFAg1PhLS6AAudHxRpmNUSXrzeTCkaQABfw8SM/RvFmCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c9c9a2b8978d940f87f2f62e7ca3c457be9fa94084395c572fee9b43518a7dc9","last_reissued_at":"2026-05-18T02:17:01.256136Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:17:01.256136Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1407.6755","source_version":2,"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-18T02:17:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RKdMlJBli9F8i40rmswejkdCjCv/nvsfFkeVwQ/1Rj/nscBO156r/FU8NzI0Yx2URY+iOOQQg74OWbSzPXzDDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T02:42:21.300139Z"},"content_sha256":"13901c15c232cc25f02ca5baacd303001dc8b930a4912d33c79bc32874b819d1","schema_version":"1.0","event_id":"sha256:13901c15c232cc25f02ca5baacd303001dc8b930a4912d33c79bc32874b819d1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:ZHE2FOEXRWKA7B7S6YXHZI6EK6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Dynamic Set Intersection","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Ely Porat, Seth Pettie, Tsvi Kopelowitz","submitted_at":"2014-07-24T23:02:09Z","abstract_excerpt":"Consider the problem of maintaining a family $F$ of dynamic sets subject to insertions, deletions, and set-intersection reporting queries: given $S,S'\\in F$, report every member of $S\\cap S'$ in any order. We show that in the word RAM model, where $w$ is the word size, given a cap $d$ on the maximum size of any set, we can support set intersection queries in $O(\\frac{d}{w/\\log^2 w})$ expected time, and updates in $O(\\log w)$ expected time. Using this algorithm we can list all $t$ triangles of a graph $G=(V,E)$ in $O(m+\\frac{m\\alpha}{w/\\log^2 w} +t)$ expected time, where $m=|E|$ and $\\alpha$ is"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.6755","kind":"arxiv","version":2},"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-18T02:17:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CkgeDfK3SjkDtX1nwpepREQ76qaTtTIVlsZ9zMPW9BWo7C6suO3s4IqfpRPHjOJYmv0Ioz+UpvoBseYcrYzKDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T02:42:21.300535Z"},"content_sha256":"0bbad6a7afe854bbc7b4c83c7a1994155217ddbd12e0765e5a9152a4ecf94133","schema_version":"1.0","event_id":"sha256:0bbad6a7afe854bbc7b4c83c7a1994155217ddbd12e0765e5a9152a4ecf94133"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZHE2FOEXRWKA7B7S6YXHZI6EK6/bundle.json","state_url":"https://pith.science/pith/ZHE2FOEXRWKA7B7S6YXHZI6EK6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZHE2FOEXRWKA7B7S6YXHZI6EK6/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-30T02:42:21Z","links":{"resolver":"https://pith.science/pith/ZHE2FOEXRWKA7B7S6YXHZI6EK6","bundle":"https://pith.science/pith/ZHE2FOEXRWKA7B7S6YXHZI6EK6/bundle.json","state":"https://pith.science/pith/ZHE2FOEXRWKA7B7S6YXHZI6EK6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZHE2FOEXRWKA7B7S6YXHZI6EK6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:ZHE2FOEXRWKA7B7S6YXHZI6EK6","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":"49f1bdee66a84bbfc14849661da608e7d32bd3fe6e221f1527a249dfbc730b72","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-07-24T23:02:09Z","title_canon_sha256":"32e578c8d9bb0129bfccbe695a4e9ed7d7a3a0aa52ad3b47d71edfcdb79452d7"},"schema_version":"1.0","source":{"id":"1407.6755","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1407.6755","created_at":"2026-05-18T02:17:01Z"},{"alias_kind":"arxiv_version","alias_value":"1407.6755v2","created_at":"2026-05-18T02:17:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.6755","created_at":"2026-05-18T02:17:01Z"},{"alias_kind":"pith_short_12","alias_value":"ZHE2FOEXRWKA","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_16","alias_value":"ZHE2FOEXRWKA7B7S","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_8","alias_value":"ZHE2FOEX","created_at":"2026-05-18T12:28:59Z"}],"graph_snapshots":[{"event_id":"sha256:0bbad6a7afe854bbc7b4c83c7a1994155217ddbd12e0765e5a9152a4ecf94133","target":"graph","created_at":"2026-05-18T02:17:01Z","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":"Consider the problem of maintaining a family $F$ of dynamic sets subject to insertions, deletions, and set-intersection reporting queries: given $S,S'\\in F$, report every member of $S\\cap S'$ in any order. We show that in the word RAM model, where $w$ is the word size, given a cap $d$ on the maximum size of any set, we can support set intersection queries in $O(\\frac{d}{w/\\log^2 w})$ expected time, and updates in $O(\\log w)$ expected time. Using this algorithm we can list all $t$ triangles of a graph $G=(V,E)$ in $O(m+\\frac{m\\alpha}{w/\\log^2 w} +t)$ expected time, where $m=|E|$ and $\\alpha$ is","authors_text":"Ely Porat, Seth Pettie, Tsvi Kopelowitz","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-07-24T23:02:09Z","title":"Dynamic Set Intersection"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.6755","kind":"arxiv","version":2},"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:13901c15c232cc25f02ca5baacd303001dc8b930a4912d33c79bc32874b819d1","target":"record","created_at":"2026-05-18T02:17:01Z","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":"49f1bdee66a84bbfc14849661da608e7d32bd3fe6e221f1527a249dfbc730b72","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-07-24T23:02:09Z","title_canon_sha256":"32e578c8d9bb0129bfccbe695a4e9ed7d7a3a0aa52ad3b47d71edfcdb79452d7"},"schema_version":"1.0","source":{"id":"1407.6755","kind":"arxiv","version":2}},"canonical_sha256":"c9c9a2b8978d940f87f2f62e7ca3c457be9fa94084395c572fee9b43518a7dc9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c9c9a2b8978d940f87f2f62e7ca3c457be9fa94084395c572fee9b43518a7dc9","first_computed_at":"2026-05-18T02:17:01.256136Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:17:01.256136Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"fuJJT7Jr8iMx07SiyQZSwGz5cYIsqg5doWWaYip4sVFAg1PhLS6AAudHxRpmNUSXrzeTCkaQABfw8SM/RvFmCg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:17:01.256854Z","signed_message":"canonical_sha256_bytes"},"source_id":"1407.6755","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:13901c15c232cc25f02ca5baacd303001dc8b930a4912d33c79bc32874b819d1","sha256:0bbad6a7afe854bbc7b4c83c7a1994155217ddbd12e0765e5a9152a4ecf94133"],"state_sha256":"66c4433f8c21cf456bf6dc78d9b4825deede27f61eadf96e8cc533cbc2cfdc90"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MbRo4+W1xKBtARa1uhDBfSavCHB29+hga3OZyJ+D69kmMBmicjN+SQ7Q00sDCUk26f6PW5AK6lZkRrqq0nZXAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T02:42:21.303827Z","bundle_sha256":"896653af29eea2d91a8b06f32f326b8dabc8fd5e7fa0a21394d665d439d0017e"}}