{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:LHH7CX6HVEMEOOZC7BDA7U7OJ4","short_pith_number":"pith:LHH7CX6H","canonical_record":{"source":{"id":"1811.07780","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-11-19T16:29:08Z","cross_cats_sorted":[],"title_canon_sha256":"d3ddcc97eb9fcfc789e4ea8a453c186b5362d8f90a46f39e3c5203c0e59722b3","abstract_canon_sha256":"0980a7268bc4be91c35650597612e16c18d5e26fd9ccd9099914e0aad2f9b7ad"},"schema_version":"1.0"},"canonical_sha256":"59cff15fc7a918473b22f8460fd3ee4f0a24c1d29fab9a7a7afdf992a5c313e5","source":{"kind":"arxiv","id":"1811.07780","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.07780","created_at":"2026-05-18T00:00:23Z"},{"alias_kind":"arxiv_version","alias_value":"1811.07780v1","created_at":"2026-05-18T00:00:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.07780","created_at":"2026-05-18T00:00:23Z"},{"alias_kind":"pith_short_12","alias_value":"LHH7CX6HVEME","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_16","alias_value":"LHH7CX6HVEMEOOZC","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_8","alias_value":"LHH7CX6H","created_at":"2026-05-18T12:32:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:LHH7CX6HVEMEOOZC7BDA7U7OJ4","target":"record","payload":{"canonical_record":{"source":{"id":"1811.07780","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-11-19T16:29:08Z","cross_cats_sorted":[],"title_canon_sha256":"d3ddcc97eb9fcfc789e4ea8a453c186b5362d8f90a46f39e3c5203c0e59722b3","abstract_canon_sha256":"0980a7268bc4be91c35650597612e16c18d5e26fd9ccd9099914e0aad2f9b7ad"},"schema_version":"1.0"},"canonical_sha256":"59cff15fc7a918473b22f8460fd3ee4f0a24c1d29fab9a7a7afdf992a5c313e5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:00:23.481253Z","signature_b64":"kwcPWfEjwmN08N6OfgFp+IXEGGujSxPqu5YbAyUZzjjngHW/xFuixxF+Kt0cGFCsu8VHnGBhGQgqOzWOr8qgBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"59cff15fc7a918473b22f8460fd3ee4f0a24c1d29fab9a7a7afdf992a5c313e5","last_reissued_at":"2026-05-18T00:00:23.480717Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:00:23.480717Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1811.07780","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:00:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JeaRREJ9Fr8ddtmAr5mqkXC6oqFkT1B7wYOYGR9TyKQVSZFYrvwxXeFjoiHfpBAHYBgVEHiT74eB4ZLTPKsmAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T05:25:24.437624Z"},"content_sha256":"adff3629f89826f1e969884f9a4e61504d7903600fc8688bf271108b9057307f","schema_version":"1.0","event_id":"sha256:adff3629f89826f1e969884f9a4e61504d7903600fc8688bf271108b9057307f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:LHH7CX6HVEMEOOZC7BDA7U7OJ4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Simple Sublinear-Time Algorithm for Counting Arbitrary Subgraphs via Edge Sampling","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Michael Kapralov, Sanjeev Khanna, Sepehr Assadi","submitted_at":"2018-11-19T16:29:08Z","abstract_excerpt":"In the subgraph counting problem, we are given a input graph $G(V, E)$ and a target graph $H$; the goal is to estimate the number of occurrences of $H$ in $G$. Our focus here is on designing sublinear-time algorithms for approximately counting occurrences of $H$ in $G$ in the setting where the algorithm is given query access to $G$. This problem has been studied in several recent papers which primarily focused on specific families of graphs $H$ such as triangles, cliques, and stars. However, not much is known about approximate counting of arbitrary graphs $H$. This is in sharp contrast to the "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.07780","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:00:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kRcIPFAestk/8yg7xD4B0s+SUxz8MAVRiLcXDk/onQMbu1TC+0+NW0pJSy59VkxK3JRiJWzZU49GN0kKgeWJCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T05:25:24.438282Z"},"content_sha256":"6bb5a779a39743595a56a7a04b904fd38b4f9ed4befb83588112a7478c583cfa","schema_version":"1.0","event_id":"sha256:6bb5a779a39743595a56a7a04b904fd38b4f9ed4befb83588112a7478c583cfa"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LHH7CX6HVEMEOOZC7BDA7U7OJ4/bundle.json","state_url":"https://pith.science/pith/LHH7CX6HVEMEOOZC7BDA7U7OJ4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LHH7CX6HVEMEOOZC7BDA7U7OJ4/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-31T05:25:24Z","links":{"resolver":"https://pith.science/pith/LHH7CX6HVEMEOOZC7BDA7U7OJ4","bundle":"https://pith.science/pith/LHH7CX6HVEMEOOZC7BDA7U7OJ4/bundle.json","state":"https://pith.science/pith/LHH7CX6HVEMEOOZC7BDA7U7OJ4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LHH7CX6HVEMEOOZC7BDA7U7OJ4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:LHH7CX6HVEMEOOZC7BDA7U7OJ4","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":"0980a7268bc4be91c35650597612e16c18d5e26fd9ccd9099914e0aad2f9b7ad","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-11-19T16:29:08Z","title_canon_sha256":"d3ddcc97eb9fcfc789e4ea8a453c186b5362d8f90a46f39e3c5203c0e59722b3"},"schema_version":"1.0","source":{"id":"1811.07780","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.07780","created_at":"2026-05-18T00:00:23Z"},{"alias_kind":"arxiv_version","alias_value":"1811.07780v1","created_at":"2026-05-18T00:00:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.07780","created_at":"2026-05-18T00:00:23Z"},{"alias_kind":"pith_short_12","alias_value":"LHH7CX6HVEME","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_16","alias_value":"LHH7CX6HVEMEOOZC","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_8","alias_value":"LHH7CX6H","created_at":"2026-05-18T12:32:37Z"}],"graph_snapshots":[{"event_id":"sha256:6bb5a779a39743595a56a7a04b904fd38b4f9ed4befb83588112a7478c583cfa","target":"graph","created_at":"2026-05-18T00:00:23Z","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 the subgraph counting problem, we are given a input graph $G(V, E)$ and a target graph $H$; the goal is to estimate the number of occurrences of $H$ in $G$. Our focus here is on designing sublinear-time algorithms for approximately counting occurrences of $H$ in $G$ in the setting where the algorithm is given query access to $G$. This problem has been studied in several recent papers which primarily focused on specific families of graphs $H$ such as triangles, cliques, and stars. However, not much is known about approximate counting of arbitrary graphs $H$. This is in sharp contrast to the ","authors_text":"Michael Kapralov, Sanjeev Khanna, Sepehr Assadi","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-11-19T16:29:08Z","title":"A Simple Sublinear-Time Algorithm for Counting Arbitrary Subgraphs via Edge Sampling"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.07780","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:adff3629f89826f1e969884f9a4e61504d7903600fc8688bf271108b9057307f","target":"record","created_at":"2026-05-18T00:00:23Z","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":"0980a7268bc4be91c35650597612e16c18d5e26fd9ccd9099914e0aad2f9b7ad","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-11-19T16:29:08Z","title_canon_sha256":"d3ddcc97eb9fcfc789e4ea8a453c186b5362d8f90a46f39e3c5203c0e59722b3"},"schema_version":"1.0","source":{"id":"1811.07780","kind":"arxiv","version":1}},"canonical_sha256":"59cff15fc7a918473b22f8460fd3ee4f0a24c1d29fab9a7a7afdf992a5c313e5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"59cff15fc7a918473b22f8460fd3ee4f0a24c1d29fab9a7a7afdf992a5c313e5","first_computed_at":"2026-05-18T00:00:23.480717Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:00:23.480717Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"kwcPWfEjwmN08N6OfgFp+IXEGGujSxPqu5YbAyUZzjjngHW/xFuixxF+Kt0cGFCsu8VHnGBhGQgqOzWOr8qgBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:00:23.481253Z","signed_message":"canonical_sha256_bytes"},"source_id":"1811.07780","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:adff3629f89826f1e969884f9a4e61504d7903600fc8688bf271108b9057307f","sha256:6bb5a779a39743595a56a7a04b904fd38b4f9ed4befb83588112a7478c583cfa"],"state_sha256":"9900dd7e4a7ea6e063a1148b8f030d04adc0c4c8e5167276c70c89029c3072c4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RTS5DFJr9qGm5AwJeP34xIK82TILBvlF6bYZuxnQDXNeJD9haHaZZSxb9MBFxgx0+be2b0Nfe2T6qQ7zlgLMAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T05:25:24.441566Z","bundle_sha256":"a3f3c7e8ac223f7fa42973d1403335afdbaebb1a222eaf007c83a6f8f65971ad"}}