{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:W4EZKHJTZOAPJS27FZFKVL2BLG","short_pith_number":"pith:W4EZKHJT","schema_version":"1.0","canonical_sha256":"b709951d33cb80f4cb5f2e4aaaaf4159b1aeb6c942b2d4b28a73e141e606b186","source":{"kind":"arxiv","id":"1802.07773","version":1},"attestation_state":"computed","paper":{"title":"Counting Motifs with Graph Sampling","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","stat.ML","stat.TH"],"primary_cat":"math.ST","authors_text":"Jason M. Klusowski, Yihong Wu","submitted_at":"2018-02-21T19:51:45Z","abstract_excerpt":"Applied researchers often construct a network from a random sample of nodes in order to infer properties of the parent network. Two of the most widely used sampling schemes are subgraph sampling, where we sample each vertex independently with probability $p$ and observe the subgraph induced by the sampled vertices, and neighborhood sampling, where we additionally observe the edges between the sampled vertices and their neighbors.\n  In this paper, we study the problem of estimating the number of motifs as induced subgraphs under both models from a statistical perspective. We show that: for any "},"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":"1802.07773","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2018-02-21T19:51:45Z","cross_cats_sorted":["cs.DM","stat.ML","stat.TH"],"title_canon_sha256":"ef8e04bdad62b334365eb3d5b6eb5fdbaae09e2c679a0ed0e4360b7d73ab2d78","abstract_canon_sha256":"001147d5e2494e840fe455e36748ef55be938f9f438156e64ab312076cdd1f9a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:22:48.941243Z","signature_b64":"AKF11yzEebEG0iGFzQK2N54Lw/RB+b3JvQ8CaTifTyOk0BylzeJ/XCsK0ICTT/tQeMK49OZ5NGaD+ympxXj4Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b709951d33cb80f4cb5f2e4aaaaf4159b1aeb6c942b2d4b28a73e141e606b186","last_reissued_at":"2026-05-18T00:22:48.940609Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:22:48.940609Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Counting Motifs with Graph Sampling","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","stat.ML","stat.TH"],"primary_cat":"math.ST","authors_text":"Jason M. Klusowski, Yihong Wu","submitted_at":"2018-02-21T19:51:45Z","abstract_excerpt":"Applied researchers often construct a network from a random sample of nodes in order to infer properties of the parent network. Two of the most widely used sampling schemes are subgraph sampling, where we sample each vertex independently with probability $p$ and observe the subgraph induced by the sampled vertices, and neighborhood sampling, where we additionally observe the edges between the sampled vertices and their neighbors.\n  In this paper, we study the problem of estimating the number of motifs as induced subgraphs under both models from a statistical perspective. We show that: for any "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.07773","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":"1802.07773","created_at":"2026-05-18T00:22:48.940698+00:00"},{"alias_kind":"arxiv_version","alias_value":"1802.07773v1","created_at":"2026-05-18T00:22:48.940698+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.07773","created_at":"2026-05-18T00:22:48.940698+00:00"},{"alias_kind":"pith_short_12","alias_value":"W4EZKHJTZOAP","created_at":"2026-05-18T12:32:59.047623+00:00"},{"alias_kind":"pith_short_16","alias_value":"W4EZKHJTZOAPJS27","created_at":"2026-05-18T12:32:59.047623+00:00"},{"alias_kind":"pith_short_8","alias_value":"W4EZKHJT","created_at":"2026-05-18T12:32:59.047623+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/W4EZKHJTZOAPJS27FZFKVL2BLG","json":"https://pith.science/pith/W4EZKHJTZOAPJS27FZFKVL2BLG.json","graph_json":"https://pith.science/api/pith-number/W4EZKHJTZOAPJS27FZFKVL2BLG/graph.json","events_json":"https://pith.science/api/pith-number/W4EZKHJTZOAPJS27FZFKVL2BLG/events.json","paper":"https://pith.science/paper/W4EZKHJT"},"agent_actions":{"view_html":"https://pith.science/pith/W4EZKHJTZOAPJS27FZFKVL2BLG","download_json":"https://pith.science/pith/W4EZKHJTZOAPJS27FZFKVL2BLG.json","view_paper":"https://pith.science/paper/W4EZKHJT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1802.07773&json=true","fetch_graph":"https://pith.science/api/pith-number/W4EZKHJTZOAPJS27FZFKVL2BLG/graph.json","fetch_events":"https://pith.science/api/pith-number/W4EZKHJTZOAPJS27FZFKVL2BLG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/W4EZKHJTZOAPJS27FZFKVL2BLG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/W4EZKHJTZOAPJS27FZFKVL2BLG/action/storage_attestation","attest_author":"https://pith.science/pith/W4EZKHJTZOAPJS27FZFKVL2BLG/action/author_attestation","sign_citation":"https://pith.science/pith/W4EZKHJTZOAPJS27FZFKVL2BLG/action/citation_signature","submit_replication":"https://pith.science/pith/W4EZKHJTZOAPJS27FZFKVL2BLG/action/replication_record"}},"created_at":"2026-05-18T00:22:48.940698+00:00","updated_at":"2026-05-18T00:22:48.940698+00:00"}