{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:IGXWUDFFRNW44N7TIRQVJ4GSV5","short_pith_number":"pith:IGXWUDFF","canonical_record":{"source":{"id":"1808.04995","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-08-15T07:58:32Z","cross_cats_sorted":[],"title_canon_sha256":"327d16ca05f273f372e59d08cee203a0a48d1f18b028cc0d2ae292affcaaa5ee","abstract_canon_sha256":"9f8c99698a49e0c5fc9fff553b292e178f60a222fd9df521d776bf1aeded4e8e"},"schema_version":"1.0"},"canonical_sha256":"41af6a0ca58b6dce37f3446154f0d2af420ae13fb5749df9a103da38ccb5ef65","source":{"kind":"arxiv","id":"1808.04995","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1808.04995","created_at":"2026-05-18T00:08:01Z"},{"alias_kind":"arxiv_version","alias_value":"1808.04995v1","created_at":"2026-05-18T00:08:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.04995","created_at":"2026-05-18T00:08:01Z"},{"alias_kind":"pith_short_12","alias_value":"IGXWUDFFRNW4","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_16","alias_value":"IGXWUDFFRNW44N7T","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_8","alias_value":"IGXWUDFF","created_at":"2026-05-18T12:32:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:IGXWUDFFRNW44N7TIRQVJ4GSV5","target":"record","payload":{"canonical_record":{"source":{"id":"1808.04995","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-08-15T07:58:32Z","cross_cats_sorted":[],"title_canon_sha256":"327d16ca05f273f372e59d08cee203a0a48d1f18b028cc0d2ae292affcaaa5ee","abstract_canon_sha256":"9f8c99698a49e0c5fc9fff553b292e178f60a222fd9df521d776bf1aeded4e8e"},"schema_version":"1.0"},"canonical_sha256":"41af6a0ca58b6dce37f3446154f0d2af420ae13fb5749df9a103da38ccb5ef65","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:08:01.931169Z","signature_b64":"iE45DMnTIBSxFRKWjVbYPenYaDgbmn5U/lMr9luzw8D2VTuYg8YBR2oCpJkvk+LPPBFHMHqSlEL2SCgpYxDgAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"41af6a0ca58b6dce37f3446154f0d2af420ae13fb5749df9a103da38ccb5ef65","last_reissued_at":"2026-05-18T00:08:01.930577Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:08:01.930577Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1808.04995","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:08:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IugljbSXAq7Vl5BX3qMWtFY20Hb+vC/YYESdgok6tTZLW9oO6QqHGnoBcZkS2H7mBFpf9/HnfCn74qn1QZ27Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T19:39:14.057262Z"},"content_sha256":"9ae60b665798375f4a62f6735e5145190280045ed9ce25591d48aac80b8cd431","schema_version":"1.0","event_id":"sha256:9ae60b665798375f4a62f6735e5145190280045ed9ce25591d48aac80b8cd431"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:IGXWUDFFRNW44N7TIRQVJ4GSV5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The Sketching Complexity of Graph and Hypergraph Counting","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Eric Price, John Kallaugher, Michael Kapralov","submitted_at":"2018-08-15T07:58:32Z","abstract_excerpt":"Subgraph counting is a fundamental primitive in graph processing, with applications in social network analysis (e.g., estimating the clustering coefficient of a graph), database processing and other areas. The space complexity of subgraph counting has been studied extensively in the literature, but many natural settings are still not well understood. In this paper we revisit the subgraph (and hypergraph) counting problem in the sketching model, where the algorithm's state as it processes a stream of updates to the graph is a linear function of the stream. This model has recently received a lot"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.04995","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:08:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"m9Z++x6dvxW7UL5H9M8oF9oICPz0SQd0pHD8KJ92Kg8cI8liH+ll4fLGUC9YqNfQq5XmbBlPy0LuEucK/4ZYDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T19:39:14.057947Z"},"content_sha256":"b1250cbf0f318dfa40f2a47d04d394b16480b63ef5a62b5178ecba9338291710","schema_version":"1.0","event_id":"sha256:b1250cbf0f318dfa40f2a47d04d394b16480b63ef5a62b5178ecba9338291710"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IGXWUDFFRNW44N7TIRQVJ4GSV5/bundle.json","state_url":"https://pith.science/pith/IGXWUDFFRNW44N7TIRQVJ4GSV5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IGXWUDFFRNW44N7TIRQVJ4GSV5/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-30T19:39:14Z","links":{"resolver":"https://pith.science/pith/IGXWUDFFRNW44N7TIRQVJ4GSV5","bundle":"https://pith.science/pith/IGXWUDFFRNW44N7TIRQVJ4GSV5/bundle.json","state":"https://pith.science/pith/IGXWUDFFRNW44N7TIRQVJ4GSV5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IGXWUDFFRNW44N7TIRQVJ4GSV5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:IGXWUDFFRNW44N7TIRQVJ4GSV5","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":"9f8c99698a49e0c5fc9fff553b292e178f60a222fd9df521d776bf1aeded4e8e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-08-15T07:58:32Z","title_canon_sha256":"327d16ca05f273f372e59d08cee203a0a48d1f18b028cc0d2ae292affcaaa5ee"},"schema_version":"1.0","source":{"id":"1808.04995","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1808.04995","created_at":"2026-05-18T00:08:01Z"},{"alias_kind":"arxiv_version","alias_value":"1808.04995v1","created_at":"2026-05-18T00:08:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.04995","created_at":"2026-05-18T00:08:01Z"},{"alias_kind":"pith_short_12","alias_value":"IGXWUDFFRNW4","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_16","alias_value":"IGXWUDFFRNW44N7T","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_8","alias_value":"IGXWUDFF","created_at":"2026-05-18T12:32:28Z"}],"graph_snapshots":[{"event_id":"sha256:b1250cbf0f318dfa40f2a47d04d394b16480b63ef5a62b5178ecba9338291710","target":"graph","created_at":"2026-05-18T00:08: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":"Subgraph counting is a fundamental primitive in graph processing, with applications in social network analysis (e.g., estimating the clustering coefficient of a graph), database processing and other areas. The space complexity of subgraph counting has been studied extensively in the literature, but many natural settings are still not well understood. In this paper we revisit the subgraph (and hypergraph) counting problem in the sketching model, where the algorithm's state as it processes a stream of updates to the graph is a linear function of the stream. This model has recently received a lot","authors_text":"Eric Price, John Kallaugher, Michael Kapralov","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-08-15T07:58:32Z","title":"The Sketching Complexity of Graph and Hypergraph Counting"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.04995","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:9ae60b665798375f4a62f6735e5145190280045ed9ce25591d48aac80b8cd431","target":"record","created_at":"2026-05-18T00:08: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":"9f8c99698a49e0c5fc9fff553b292e178f60a222fd9df521d776bf1aeded4e8e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-08-15T07:58:32Z","title_canon_sha256":"327d16ca05f273f372e59d08cee203a0a48d1f18b028cc0d2ae292affcaaa5ee"},"schema_version":"1.0","source":{"id":"1808.04995","kind":"arxiv","version":1}},"canonical_sha256":"41af6a0ca58b6dce37f3446154f0d2af420ae13fb5749df9a103da38ccb5ef65","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"41af6a0ca58b6dce37f3446154f0d2af420ae13fb5749df9a103da38ccb5ef65","first_computed_at":"2026-05-18T00:08:01.930577Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:08:01.930577Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"iE45DMnTIBSxFRKWjVbYPenYaDgbmn5U/lMr9luzw8D2VTuYg8YBR2oCpJkvk+LPPBFHMHqSlEL2SCgpYxDgAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:08:01.931169Z","signed_message":"canonical_sha256_bytes"},"source_id":"1808.04995","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9ae60b665798375f4a62f6735e5145190280045ed9ce25591d48aac80b8cd431","sha256:b1250cbf0f318dfa40f2a47d04d394b16480b63ef5a62b5178ecba9338291710"],"state_sha256":"f3834d0ce39aaa5d3674b08215a7802012b400b196d4a3933f3f3a4a4fca4a03"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mq5vLoqLB3KbTNV1EZaFQR+KKOxWkfXGcpy+NsgKTHRnt4roS7opR0UJxUAfpwULhQ7MG4eXT1p9JE7k3p42Ag==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T19:39:14.062157Z","bundle_sha256":"4d72738f7eac111285a6a77826b74f331d3672587e1f0aa53486a529868153db"}}