{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:MCPUH3TRUE4TLRLY3F6RRMSAC2","short_pith_number":"pith:MCPUH3TR","schema_version":"1.0","canonical_sha256":"609f43ee71a13935c578d97d18b24016b095916f55da86caa2e2112a246a6b5b","source":{"kind":"arxiv","id":"1207.4825","version":1},"attestation_state":"computed","paper":{"title":"A new algorithm for extracting a small representative subgraph from a very large graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SI","physics.soc-ph"],"primary_cat":"cs.DS","authors_text":"Harish Sethu, Xiaoyu Chu","submitted_at":"2012-07-19T22:22:23Z","abstract_excerpt":"Many real-world networks are prohibitively large for data retrieval, storage and analysis of all of its nodes and links. Understanding the structure and dynamics of these networks entails creating a smaller representative sample of the full graph while preserving its relevant topological properties. In this report, we show that graph sampling algorithms currently proposed in the literature are not able to preserve network properties even with sample sizes containing as many as 20% of the nodes from the original graph. We present a new sampling algorithm, called Tiny Sample Extractor, with a ne"},"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":"1207.4825","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-07-19T22:22:23Z","cross_cats_sorted":["cs.SI","physics.soc-ph"],"title_canon_sha256":"fec285702c0e7a36e6e5c10efab89df902c958e7e394a8db6a6bf867d58b8293","abstract_canon_sha256":"fcff0c82c10c44ea43f40870af8f8288131186bc74bdefdbde24df1e4f5fa958"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:50:35.069725Z","signature_b64":"qPRYKBPRinQ+2bAPlbtjvvFQsFjZgy6nFmUIReaAD4b9IkZOEW9oRlpU49BICIVGBOm+16UU26zYY59TJqbZBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"609f43ee71a13935c578d97d18b24016b095916f55da86caa2e2112a246a6b5b","last_reissued_at":"2026-05-18T03:50:35.068883Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:50:35.068883Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A new algorithm for extracting a small representative subgraph from a very large graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SI","physics.soc-ph"],"primary_cat":"cs.DS","authors_text":"Harish Sethu, Xiaoyu Chu","submitted_at":"2012-07-19T22:22:23Z","abstract_excerpt":"Many real-world networks are prohibitively large for data retrieval, storage and analysis of all of its nodes and links. Understanding the structure and dynamics of these networks entails creating a smaller representative sample of the full graph while preserving its relevant topological properties. In this report, we show that graph sampling algorithms currently proposed in the literature are not able to preserve network properties even with sample sizes containing as many as 20% of the nodes from the original graph. We present a new sampling algorithm, called Tiny Sample Extractor, with a ne"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.4825","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":"1207.4825","created_at":"2026-05-18T03:50:35.069025+00:00"},{"alias_kind":"arxiv_version","alias_value":"1207.4825v1","created_at":"2026-05-18T03:50:35.069025+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.4825","created_at":"2026-05-18T03:50:35.069025+00:00"},{"alias_kind":"pith_short_12","alias_value":"MCPUH3TRUE4T","created_at":"2026-05-18T12:27:14.488303+00:00"},{"alias_kind":"pith_short_16","alias_value":"MCPUH3TRUE4TLRLY","created_at":"2026-05-18T12:27:14.488303+00:00"},{"alias_kind":"pith_short_8","alias_value":"MCPUH3TR","created_at":"2026-05-18T12:27:14.488303+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/MCPUH3TRUE4TLRLY3F6RRMSAC2","json":"https://pith.science/pith/MCPUH3TRUE4TLRLY3F6RRMSAC2.json","graph_json":"https://pith.science/api/pith-number/MCPUH3TRUE4TLRLY3F6RRMSAC2/graph.json","events_json":"https://pith.science/api/pith-number/MCPUH3TRUE4TLRLY3F6RRMSAC2/events.json","paper":"https://pith.science/paper/MCPUH3TR"},"agent_actions":{"view_html":"https://pith.science/pith/MCPUH3TRUE4TLRLY3F6RRMSAC2","download_json":"https://pith.science/pith/MCPUH3TRUE4TLRLY3F6RRMSAC2.json","view_paper":"https://pith.science/paper/MCPUH3TR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1207.4825&json=true","fetch_graph":"https://pith.science/api/pith-number/MCPUH3TRUE4TLRLY3F6RRMSAC2/graph.json","fetch_events":"https://pith.science/api/pith-number/MCPUH3TRUE4TLRLY3F6RRMSAC2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MCPUH3TRUE4TLRLY3F6RRMSAC2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MCPUH3TRUE4TLRLY3F6RRMSAC2/action/storage_attestation","attest_author":"https://pith.science/pith/MCPUH3TRUE4TLRLY3F6RRMSAC2/action/author_attestation","sign_citation":"https://pith.science/pith/MCPUH3TRUE4TLRLY3F6RRMSAC2/action/citation_signature","submit_replication":"https://pith.science/pith/MCPUH3TRUE4TLRLY3F6RRMSAC2/action/replication_record"}},"created_at":"2026-05-18T03:50:35.069025+00:00","updated_at":"2026-05-18T03:50:35.069025+00:00"}