{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:IIPYAEV257TH63XEICT5J6XARV","short_pith_number":"pith:IIPYAEV2","canonical_record":{"source":{"id":"1105.5488","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2011-05-27T07:31:50Z","cross_cats_sorted":["physics.data-an","physics.soc-ph"],"title_canon_sha256":"fdca8ef299b884700e7ef5bb356089675c8af977a4a11f60e671092bd2910a8b","abstract_canon_sha256":"2e34ffbafa8f06b96430eaea790c1010e95256f6cfd41f1943299cba875923a5"},"schema_version":"1.0"},"canonical_sha256":"421f8012baefe67f6ee440a7d4fae08d6659da728db49fa76ab98f811391341c","source":{"kind":"arxiv","id":"1105.5488","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1105.5488","created_at":"2026-05-18T04:21:11Z"},{"alias_kind":"arxiv_version","alias_value":"1105.5488v1","created_at":"2026-05-18T04:21:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1105.5488","created_at":"2026-05-18T04:21:11Z"},{"alias_kind":"pith_short_12","alias_value":"IIPYAEV257TH","created_at":"2026-05-18T12:26:30Z"},{"alias_kind":"pith_short_16","alias_value":"IIPYAEV257TH63XE","created_at":"2026-05-18T12:26:30Z"},{"alias_kind":"pith_short_8","alias_value":"IIPYAEV2","created_at":"2026-05-18T12:26:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:IIPYAEV257TH63XEICT5J6XARV","target":"record","payload":{"canonical_record":{"source":{"id":"1105.5488","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2011-05-27T07:31:50Z","cross_cats_sorted":["physics.data-an","physics.soc-ph"],"title_canon_sha256":"fdca8ef299b884700e7ef5bb356089675c8af977a4a11f60e671092bd2910a8b","abstract_canon_sha256":"2e34ffbafa8f06b96430eaea790c1010e95256f6cfd41f1943299cba875923a5"},"schema_version":"1.0"},"canonical_sha256":"421f8012baefe67f6ee440a7d4fae08d6659da728db49fa76ab98f811391341c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:21:11.576494Z","signature_b64":"iALlR1VaUeB4q0WeOOSQZkRFGFzQ4PlE71TQOCxC3NBLE6Cgm8DOeJkzwRX6u82IzAoOL9yieR8sJL0NVpuLBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"421f8012baefe67f6ee440a7d4fae08d6659da728db49fa76ab98f811391341c","last_reissued_at":"2026-05-18T04:21:11.575808Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:21:11.575808Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1105.5488","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T04:21:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ihQ8xH1hIOAnlzUVEx4lMgoYAWXvVaYiZ9OTpPMsnQ3AZBdmV1NiFmrvHqWBrOOjTPoQwcTOJPHR04u7MXc1Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-24T02:05:03.804400Z"},"content_sha256":"978b8787523952334f4626522e6f6b92e7ff5346163296487d33845c7c0ce252","schema_version":"1.0","event_id":"sha256:978b8787523952334f4626522e6f6b92e7ff5346163296487d33845c7c0ce252"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:IIPYAEV257TH63XEICT5J6XARV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Coarse-Grained Topology Estimation via Graph Sampling","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["physics.data-an","physics.soc-ph"],"primary_cat":"cs.SI","authors_text":"Athina Markopoulou, Carter T. Butts, Maciej Kurant, Minas Gjoka, Yan Wang, Zack W. Almquist","submitted_at":"2011-05-27T07:31:50Z","abstract_excerpt":"Many online networks are measured and studied via sampling techniques, which typically collect a relatively small fraction of nodes and their associated edges. Past work in this area has primarily focused on obtaining a representative sample of nodes and on efficient estimation of local graph properties (such as node degree distribution or any node attribute) based on that sample. However, less is known about estimating the global topology of the underlying graph.\n  In this paper, we show how to efficiently estimate the coarse-grained topology of a graph from a probability sample of nodes. In "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1105.5488","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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T04:21:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TIjrlYdDnIyywNVWWAFvYurU5z/PqcBIu2Hd6AvJArP7SZh0XMq1tMj5kknRPHLbcnUF3a8rmvzUN+tQDV5cAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-24T02:05:03.804771Z"},"content_sha256":"d367656d8308ae52058dc835a7d6bb9997f8381b8f6c3ddc6c55fb8f12680561","schema_version":"1.0","event_id":"sha256:d367656d8308ae52058dc835a7d6bb9997f8381b8f6c3ddc6c55fb8f12680561"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IIPYAEV257TH63XEICT5J6XARV/bundle.json","state_url":"https://pith.science/pith/IIPYAEV257TH63XEICT5J6XARV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IIPYAEV257TH63XEICT5J6XARV/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-24T02:05:03Z","links":{"resolver":"https://pith.science/pith/IIPYAEV257TH63XEICT5J6XARV","bundle":"https://pith.science/pith/IIPYAEV257TH63XEICT5J6XARV/bundle.json","state":"https://pith.science/pith/IIPYAEV257TH63XEICT5J6XARV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IIPYAEV257TH63XEICT5J6XARV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:IIPYAEV257TH63XEICT5J6XARV","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"2e34ffbafa8f06b96430eaea790c1010e95256f6cfd41f1943299cba875923a5","cross_cats_sorted":["physics.data-an","physics.soc-ph"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2011-05-27T07:31:50Z","title_canon_sha256":"fdca8ef299b884700e7ef5bb356089675c8af977a4a11f60e671092bd2910a8b"},"schema_version":"1.0","source":{"id":"1105.5488","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1105.5488","created_at":"2026-05-18T04:21:11Z"},{"alias_kind":"arxiv_version","alias_value":"1105.5488v1","created_at":"2026-05-18T04:21:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1105.5488","created_at":"2026-05-18T04:21:11Z"},{"alias_kind":"pith_short_12","alias_value":"IIPYAEV257TH","created_at":"2026-05-18T12:26:30Z"},{"alias_kind":"pith_short_16","alias_value":"IIPYAEV257TH63XE","created_at":"2026-05-18T12:26:30Z"},{"alias_kind":"pith_short_8","alias_value":"IIPYAEV2","created_at":"2026-05-18T12:26:30Z"}],"graph_snapshots":[{"event_id":"sha256:d367656d8308ae52058dc835a7d6bb9997f8381b8f6c3ddc6c55fb8f12680561","target":"graph","created_at":"2026-05-18T04:21:11Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"Many online networks are measured and studied via sampling techniques, which typically collect a relatively small fraction of nodes and their associated edges. Past work in this area has primarily focused on obtaining a representative sample of nodes and on efficient estimation of local graph properties (such as node degree distribution or any node attribute) based on that sample. However, less is known about estimating the global topology of the underlying graph.\n  In this paper, we show how to efficiently estimate the coarse-grained topology of a graph from a probability sample of nodes. In ","authors_text":"Athina Markopoulou, Carter T. Butts, Maciej Kurant, Minas Gjoka, Yan Wang, Zack W. Almquist","cross_cats":["physics.data-an","physics.soc-ph"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2011-05-27T07:31:50Z","title":"Coarse-Grained Topology Estimation via Graph Sampling"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1105.5488","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:978b8787523952334f4626522e6f6b92e7ff5346163296487d33845c7c0ce252","target":"record","created_at":"2026-05-18T04:21:11Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"2e34ffbafa8f06b96430eaea790c1010e95256f6cfd41f1943299cba875923a5","cross_cats_sorted":["physics.data-an","physics.soc-ph"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2011-05-27T07:31:50Z","title_canon_sha256":"fdca8ef299b884700e7ef5bb356089675c8af977a4a11f60e671092bd2910a8b"},"schema_version":"1.0","source":{"id":"1105.5488","kind":"arxiv","version":1}},"canonical_sha256":"421f8012baefe67f6ee440a7d4fae08d6659da728db49fa76ab98f811391341c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"421f8012baefe67f6ee440a7d4fae08d6659da728db49fa76ab98f811391341c","first_computed_at":"2026-05-18T04:21:11.575808Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:21:11.575808Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"iALlR1VaUeB4q0WeOOSQZkRFGFzQ4PlE71TQOCxC3NBLE6Cgm8DOeJkzwRX6u82IzAoOL9yieR8sJL0NVpuLBg==","signature_status":"signed_v1","signed_at":"2026-05-18T04:21:11.576494Z","signed_message":"canonical_sha256_bytes"},"source_id":"1105.5488","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:978b8787523952334f4626522e6f6b92e7ff5346163296487d33845c7c0ce252","sha256:d367656d8308ae52058dc835a7d6bb9997f8381b8f6c3ddc6c55fb8f12680561"],"state_sha256":"596eda73f88cb3e1d6940e27e2c9fd01feffbab228e1aad0ce7604b4e38c01ab"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"L3w8AwcHo6p1RyiVSOiuWni/ofQ7tjgwOwRq1OyYBGRHGGKzTR5DM+BBahdqmxywWOdxTgX/jSty4jxrfmwwBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-24T02:05:03.807504Z","bundle_sha256":"69b523d9af734ec071d5555e6938fbbe284a15d3947dd1c6c2c597833ad47ebd"}}