{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:LHH7CX6HVEMEOOZC7BDA7U7OJ4","short_pith_number":"pith:LHH7CX6H","schema_version":"1.0","canonical_sha256":"59cff15fc7a918473b22f8460fd3ee4f0a24c1d29fab9a7a7afdf992a5c313e5","source":{"kind":"arxiv","id":"1811.07780","version":1},"attestation_state":"computed","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 "},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1811.07780","created_at":"2026-05-18T00:00:23.480809+00:00"},{"alias_kind":"arxiv_version","alias_value":"1811.07780v1","created_at":"2026-05-18T00:00:23.480809+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.07780","created_at":"2026-05-18T00:00:23.480809+00:00"},{"alias_kind":"pith_short_12","alias_value":"LHH7CX6HVEME","created_at":"2026-05-18T12:32:37.024351+00:00"},{"alias_kind":"pith_short_16","alias_value":"LHH7CX6HVEMEOOZC","created_at":"2026-05-18T12:32:37.024351+00:00"},{"alias_kind":"pith_short_8","alias_value":"LHH7CX6H","created_at":"2026-05-18T12:32:37.024351+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/LHH7CX6HVEMEOOZC7BDA7U7OJ4","json":"https://pith.science/pith/LHH7CX6HVEMEOOZC7BDA7U7OJ4.json","graph_json":"https://pith.science/api/pith-number/LHH7CX6HVEMEOOZC7BDA7U7OJ4/graph.json","events_json":"https://pith.science/api/pith-number/LHH7CX6HVEMEOOZC7BDA7U7OJ4/events.json","paper":"https://pith.science/paper/LHH7CX6H"},"agent_actions":{"view_html":"https://pith.science/pith/LHH7CX6HVEMEOOZC7BDA7U7OJ4","download_json":"https://pith.science/pith/LHH7CX6HVEMEOOZC7BDA7U7OJ4.json","view_paper":"https://pith.science/paper/LHH7CX6H","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1811.07780&json=true","fetch_graph":"https://pith.science/api/pith-number/LHH7CX6HVEMEOOZC7BDA7U7OJ4/graph.json","fetch_events":"https://pith.science/api/pith-number/LHH7CX6HVEMEOOZC7BDA7U7OJ4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LHH7CX6HVEMEOOZC7BDA7U7OJ4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LHH7CX6HVEMEOOZC7BDA7U7OJ4/action/storage_attestation","attest_author":"https://pith.science/pith/LHH7CX6HVEMEOOZC7BDA7U7OJ4/action/author_attestation","sign_citation":"https://pith.science/pith/LHH7CX6HVEMEOOZC7BDA7U7OJ4/action/citation_signature","submit_replication":"https://pith.science/pith/LHH7CX6HVEMEOOZC7BDA7U7OJ4/action/replication_record"}},"created_at":"2026-05-18T00:00:23.480809+00:00","updated_at":"2026-05-18T00:00:23.480809+00:00"}