{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:W2XZMVZM2ERZJF7QH7ONIW7WCZ","short_pith_number":"pith:W2XZMVZM","schema_version":"1.0","canonical_sha256":"b6af96572cd1239497f03fdcd45bf616555a40a9898c0b476c3517ed98e8797b","source":{"kind":"arxiv","id":"1405.5097","version":1},"attestation_state":"computed","paper":{"title":"Design of Efficient Sampling Methods on Hybrid Social-Affiliation Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["physics.soc-ph"],"primary_cat":"cs.SI","authors_text":"Don Towsley, John C.S. Lui, Junzhou Zhao, Pinghui Wang, Xiaohong Guan","submitted_at":"2014-05-20T14:17:19Z","abstract_excerpt":"Graph sampling via crawling has become increasingly popular and important in the study of measuring various characteristics of large scale complex networks. While powerful, it is known to be challenging when the graph is loosely connected or disconnected which slows down the convergence of random walks and can cause poor estimation accuracy.\n  In this work, we observe that the graph under study, or called target graph, usually does not exist in isolation. In many situations, the target graph is related to an auxiliary graph and an affiliation graph, and the target graph becomes well connected "},"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":"1405.5097","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2014-05-20T14:17:19Z","cross_cats_sorted":["physics.soc-ph"],"title_canon_sha256":"88ed85caef30ba4cc9201291a3c7c22dc3950390e00c0617be49f65807f2d1d0","abstract_canon_sha256":"4678c856f143d1192658a4600ccff64b3dd7690a58a5b0c2ea5c0abeaf133a72"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:51:32.137113Z","signature_b64":"mCACStIaUNchkNGiYPspy9yub+w6zx/rjcy7PkK9BbqCya4MP8kkEJ5iBdNP0+UM4MmkM2e7NQ64+90C0aNgBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b6af96572cd1239497f03fdcd45bf616555a40a9898c0b476c3517ed98e8797b","last_reissued_at":"2026-05-18T02:51:32.136452Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:51:32.136452Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Design of Efficient Sampling Methods on Hybrid Social-Affiliation Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["physics.soc-ph"],"primary_cat":"cs.SI","authors_text":"Don Towsley, John C.S. Lui, Junzhou Zhao, Pinghui Wang, Xiaohong Guan","submitted_at":"2014-05-20T14:17:19Z","abstract_excerpt":"Graph sampling via crawling has become increasingly popular and important in the study of measuring various characteristics of large scale complex networks. While powerful, it is known to be challenging when the graph is loosely connected or disconnected which slows down the convergence of random walks and can cause poor estimation accuracy.\n  In this work, we observe that the graph under study, or called target graph, usually does not exist in isolation. In many situations, the target graph is related to an auxiliary graph and an affiliation graph, and the target graph becomes well connected "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1405.5097","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":"1405.5097","created_at":"2026-05-18T02:51:32.136586+00:00"},{"alias_kind":"arxiv_version","alias_value":"1405.5097v1","created_at":"2026-05-18T02:51:32.136586+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.5097","created_at":"2026-05-18T02:51:32.136586+00:00"},{"alias_kind":"pith_short_12","alias_value":"W2XZMVZM2ERZ","created_at":"2026-05-18T12:28:54.890064+00:00"},{"alias_kind":"pith_short_16","alias_value":"W2XZMVZM2ERZJF7Q","created_at":"2026-05-18T12:28:54.890064+00:00"},{"alias_kind":"pith_short_8","alias_value":"W2XZMVZM","created_at":"2026-05-18T12:28:54.890064+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/W2XZMVZM2ERZJF7QH7ONIW7WCZ","json":"https://pith.science/pith/W2XZMVZM2ERZJF7QH7ONIW7WCZ.json","graph_json":"https://pith.science/api/pith-number/W2XZMVZM2ERZJF7QH7ONIW7WCZ/graph.json","events_json":"https://pith.science/api/pith-number/W2XZMVZM2ERZJF7QH7ONIW7WCZ/events.json","paper":"https://pith.science/paper/W2XZMVZM"},"agent_actions":{"view_html":"https://pith.science/pith/W2XZMVZM2ERZJF7QH7ONIW7WCZ","download_json":"https://pith.science/pith/W2XZMVZM2ERZJF7QH7ONIW7WCZ.json","view_paper":"https://pith.science/paper/W2XZMVZM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1405.5097&json=true","fetch_graph":"https://pith.science/api/pith-number/W2XZMVZM2ERZJF7QH7ONIW7WCZ/graph.json","fetch_events":"https://pith.science/api/pith-number/W2XZMVZM2ERZJF7QH7ONIW7WCZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/W2XZMVZM2ERZJF7QH7ONIW7WCZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/W2XZMVZM2ERZJF7QH7ONIW7WCZ/action/storage_attestation","attest_author":"https://pith.science/pith/W2XZMVZM2ERZJF7QH7ONIW7WCZ/action/author_attestation","sign_citation":"https://pith.science/pith/W2XZMVZM2ERZJF7QH7ONIW7WCZ/action/citation_signature","submit_replication":"https://pith.science/pith/W2XZMVZM2ERZJF7QH7ONIW7WCZ/action/replication_record"}},"created_at":"2026-05-18T02:51:32.136586+00:00","updated_at":"2026-05-18T02:51:32.136586+00:00"}