{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:XCUI2FWJT54FUDR6O62BAHUJOZ","short_pith_number":"pith:XCUI2FWJ","schema_version":"1.0","canonical_sha256":"b8a88d16c99f785a0e3e77b4101e89767f361f8780da6166e63dc11d211133c4","source":{"kind":"arxiv","id":"1308.5865","version":1},"attestation_state":"computed","paper":{"title":"A Survey and Taxonomy of Graph Sampling","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.PR","stat.ME"],"primary_cat":"cs.SI","authors_text":"Pili Hu, Wing Cheong Lau","submitted_at":"2013-08-23T14:28:06Z","abstract_excerpt":"Graph sampling is a technique to pick a subset of vertices and/ or edges from original graph. It has a wide spectrum of applications, e.g. survey hidden population in sociology [54], visualize social graph [29], scale down Internet AS graph [27], graph sparsification [8], etc. In some scenarios, the whole graph is known and the purpose of sampling is to obtain a smaller graph. In other scenarios, the graph is unknown and sampling is regarded as a way to explore the graph. Commonly used techniques are Vertex Sampling, Edge Sampling and Traversal Based Sampling. We provide a taxonomy of differen"},"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":"1308.5865","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2013-08-23T14:28:06Z","cross_cats_sorted":["math.PR","stat.ME"],"title_canon_sha256":"288c52eeb6e389dd575138aa0b8e5f61a7c692522aae61f1595fad6eef129138","abstract_canon_sha256":"55c237b38a5901253e2d81a4debb2170a19e024cb14bd2b524477420189a87d6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:14:50.924063Z","signature_b64":"UAA+VEzIbBweRHn9JTije7oyzrDMh5VxqxoktvebkdZY0Np/9RpWZOlg0aO5fi6UY8O7j3rwbNt2W+1H4ZIKBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b8a88d16c99f785a0e3e77b4101e89767f361f8780da6166e63dc11d211133c4","last_reissued_at":"2026-05-18T03:14:50.923310Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:14:50.923310Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Survey and Taxonomy of Graph Sampling","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.PR","stat.ME"],"primary_cat":"cs.SI","authors_text":"Pili Hu, Wing Cheong Lau","submitted_at":"2013-08-23T14:28:06Z","abstract_excerpt":"Graph sampling is a technique to pick a subset of vertices and/ or edges from original graph. It has a wide spectrum of applications, e.g. survey hidden population in sociology [54], visualize social graph [29], scale down Internet AS graph [27], graph sparsification [8], etc. In some scenarios, the whole graph is known and the purpose of sampling is to obtain a smaller graph. In other scenarios, the graph is unknown and sampling is regarded as a way to explore the graph. Commonly used techniques are Vertex Sampling, Edge Sampling and Traversal Based Sampling. We provide a taxonomy of differen"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1308.5865","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":"1308.5865","created_at":"2026-05-18T03:14:50.923452+00:00"},{"alias_kind":"arxiv_version","alias_value":"1308.5865v1","created_at":"2026-05-18T03:14:50.923452+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1308.5865","created_at":"2026-05-18T03:14:50.923452+00:00"},{"alias_kind":"pith_short_12","alias_value":"XCUI2FWJT54F","created_at":"2026-05-18T12:28:06.772260+00:00"},{"alias_kind":"pith_short_16","alias_value":"XCUI2FWJT54FUDR6","created_at":"2026-05-18T12:28:06.772260+00:00"},{"alias_kind":"pith_short_8","alias_value":"XCUI2FWJ","created_at":"2026-05-18T12:28:06.772260+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":2,"sample":[{"citing_arxiv_id":"2606.05046","citing_title":"Graph Cascades: Contagion-Based Mesoscopic Rewiring for Structure-Aware Graph Machine Learning","ref_index":282,"is_internal_anchor":true},{"citing_arxiv_id":"2606.04069","citing_title":"Bayesian Membership Privacy for Graph Neural Networks","ref_index":53,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/XCUI2FWJT54FUDR6O62BAHUJOZ","json":"https://pith.science/pith/XCUI2FWJT54FUDR6O62BAHUJOZ.json","graph_json":"https://pith.science/api/pith-number/XCUI2FWJT54FUDR6O62BAHUJOZ/graph.json","events_json":"https://pith.science/api/pith-number/XCUI2FWJT54FUDR6O62BAHUJOZ/events.json","paper":"https://pith.science/paper/XCUI2FWJ"},"agent_actions":{"view_html":"https://pith.science/pith/XCUI2FWJT54FUDR6O62BAHUJOZ","download_json":"https://pith.science/pith/XCUI2FWJT54FUDR6O62BAHUJOZ.json","view_paper":"https://pith.science/paper/XCUI2FWJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1308.5865&json=true","fetch_graph":"https://pith.science/api/pith-number/XCUI2FWJT54FUDR6O62BAHUJOZ/graph.json","fetch_events":"https://pith.science/api/pith-number/XCUI2FWJT54FUDR6O62BAHUJOZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XCUI2FWJT54FUDR6O62BAHUJOZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XCUI2FWJT54FUDR6O62BAHUJOZ/action/storage_attestation","attest_author":"https://pith.science/pith/XCUI2FWJT54FUDR6O62BAHUJOZ/action/author_attestation","sign_citation":"https://pith.science/pith/XCUI2FWJT54FUDR6O62BAHUJOZ/action/citation_signature","submit_replication":"https://pith.science/pith/XCUI2FWJT54FUDR6O62BAHUJOZ/action/replication_record"}},"created_at":"2026-05-18T03:14:50.923452+00:00","updated_at":"2026-05-18T03:14:50.923452+00:00"}