{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:CU5VL2UVVSAMW6OON6SCJ5ERR4","short_pith_number":"pith:CU5VL2UV","schema_version":"1.0","canonical_sha256":"153b55ea95ac80cb79ce6fa424f4918f0a03157376a5c90a2f5cc133f7606713","source":{"kind":"arxiv","id":"1506.02449","version":2},"attestation_state":"computed","paper":{"title":"Empirical comparison of network sampling techniques","license":"http://creativecommons.org/licenses/by/3.0/","headline":"","cross_cats":["physics.soc-ph"],"primary_cat":"cs.SI","authors_text":"Lovro \\v{S}ubelj, Marko Bajec, Neli Blagus","submitted_at":"2015-06-08T11:39:13Z","abstract_excerpt":"In the past few years, the storage and analysis of large-scale and fast evolving networks present a great challenge. Therefore, a number of different techniques have been proposed for sampling large networks. In general, network exploration techniques approximate the original networks more accurately than random node and link selection. Yet, link selection with additional subgraph induction step outperforms most other techniques. In this paper, we apply subgraph induction also to random walk and forest-fire sampling. We analyze different real-world networks and the changes of their properties "},"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":"1506.02449","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"cs.SI","submitted_at":"2015-06-08T11:39:13Z","cross_cats_sorted":["physics.soc-ph"],"title_canon_sha256":"307252a8c6522a11460b926118c2e5a6d68a18905a87c9e6ed5b264f99938d06","abstract_canon_sha256":"d98afe7c718f27391372cb7ab4a3c3cf70e4d7ca35799954addbb91dd544dc0d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:55:41.268040Z","signature_b64":"orBQJWpHpFxB/ew6nyjQlY8CE+pci2wslLnE5I6b7Y9hu+RjrvCAp0Pkhiyaj1TxucpKnp51+TncilpqUx6RBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"153b55ea95ac80cb79ce6fa424f4918f0a03157376a5c90a2f5cc133f7606713","last_reissued_at":"2026-05-18T01:55:41.267300Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:55:41.267300Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Empirical comparison of network sampling techniques","license":"http://creativecommons.org/licenses/by/3.0/","headline":"","cross_cats":["physics.soc-ph"],"primary_cat":"cs.SI","authors_text":"Lovro \\v{S}ubelj, Marko Bajec, Neli Blagus","submitted_at":"2015-06-08T11:39:13Z","abstract_excerpt":"In the past few years, the storage and analysis of large-scale and fast evolving networks present a great challenge. Therefore, a number of different techniques have been proposed for sampling large networks. In general, network exploration techniques approximate the original networks more accurately than random node and link selection. Yet, link selection with additional subgraph induction step outperforms most other techniques. In this paper, we apply subgraph induction also to random walk and forest-fire sampling. We analyze different real-world networks and the changes of their properties "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.02449","kind":"arxiv","version":2},"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":"1506.02449","created_at":"2026-05-18T01:55:41.267443+00:00"},{"alias_kind":"arxiv_version","alias_value":"1506.02449v2","created_at":"2026-05-18T01:55:41.267443+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.02449","created_at":"2026-05-18T01:55:41.267443+00:00"},{"alias_kind":"pith_short_12","alias_value":"CU5VL2UVVSAM","created_at":"2026-05-18T12:29:17.054201+00:00"},{"alias_kind":"pith_short_16","alias_value":"CU5VL2UVVSAMW6OO","created_at":"2026-05-18T12:29:17.054201+00:00"},{"alias_kind":"pith_short_8","alias_value":"CU5VL2UV","created_at":"2026-05-18T12:29:17.054201+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/CU5VL2UVVSAMW6OON6SCJ5ERR4","json":"https://pith.science/pith/CU5VL2UVVSAMW6OON6SCJ5ERR4.json","graph_json":"https://pith.science/api/pith-number/CU5VL2UVVSAMW6OON6SCJ5ERR4/graph.json","events_json":"https://pith.science/api/pith-number/CU5VL2UVVSAMW6OON6SCJ5ERR4/events.json","paper":"https://pith.science/paper/CU5VL2UV"},"agent_actions":{"view_html":"https://pith.science/pith/CU5VL2UVVSAMW6OON6SCJ5ERR4","download_json":"https://pith.science/pith/CU5VL2UVVSAMW6OON6SCJ5ERR4.json","view_paper":"https://pith.science/paper/CU5VL2UV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1506.02449&json=true","fetch_graph":"https://pith.science/api/pith-number/CU5VL2UVVSAMW6OON6SCJ5ERR4/graph.json","fetch_events":"https://pith.science/api/pith-number/CU5VL2UVVSAMW6OON6SCJ5ERR4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CU5VL2UVVSAMW6OON6SCJ5ERR4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CU5VL2UVVSAMW6OON6SCJ5ERR4/action/storage_attestation","attest_author":"https://pith.science/pith/CU5VL2UVVSAMW6OON6SCJ5ERR4/action/author_attestation","sign_citation":"https://pith.science/pith/CU5VL2UVVSAMW6OON6SCJ5ERR4/action/citation_signature","submit_replication":"https://pith.science/pith/CU5VL2UVVSAMW6OON6SCJ5ERR4/action/replication_record"}},"created_at":"2026-05-18T01:55:41.267443+00:00","updated_at":"2026-05-18T01:55:41.267443+00:00"}