{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:TO5DQB7BXDQCUV2ZJOG437TABL","short_pith_number":"pith:TO5DQB7B","canonical_record":{"source":{"id":"1305.4977","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2013-05-21T22:30:18Z","cross_cats_sorted":[],"title_canon_sha256":"4562117ddc8af7bc873be4a82cd875c056ed2ef2ecb2aa2e9fcfc600a29e4746","abstract_canon_sha256":"ff682411cff733cd61025e363525b3cd814c6c7bb056bfb24f73fec52625691d"},"schema_version":"1.0"},"canonical_sha256":"9bba3807e1b8e02a57594b8dcdfe600af5dc061adf06e754fce8322435057391","source":{"kind":"arxiv","id":"1305.4977","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1305.4977","created_at":"2026-05-18T02:00:59Z"},{"alias_kind":"arxiv_version","alias_value":"1305.4977v4","created_at":"2026-05-18T02:00:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1305.4977","created_at":"2026-05-18T02:00:59Z"},{"alias_kind":"pith_short_12","alias_value":"TO5DQB7BXDQC","created_at":"2026-05-18T12:28:02Z"},{"alias_kind":"pith_short_16","alias_value":"TO5DQB7BXDQCUV2Z","created_at":"2026-05-18T12:28:02Z"},{"alias_kind":"pith_short_8","alias_value":"TO5DQB7B","created_at":"2026-05-18T12:28:02Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:TO5DQB7BXDQCUV2ZJOG437TABL","target":"record","payload":{"canonical_record":{"source":{"id":"1305.4977","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2013-05-21T22:30:18Z","cross_cats_sorted":[],"title_canon_sha256":"4562117ddc8af7bc873be4a82cd875c056ed2ef2ecb2aa2e9fcfc600a29e4746","abstract_canon_sha256":"ff682411cff733cd61025e363525b3cd814c6c7bb056bfb24f73fec52625691d"},"schema_version":"1.0"},"canonical_sha256":"9bba3807e1b8e02a57594b8dcdfe600af5dc061adf06e754fce8322435057391","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:00:59.233556Z","signature_b64":"liiin0noLMmQN1eOV1mMkbensCoKZL8QtratWyuJy/MUL1J4B6ylSuKMpIwTgRger4EfwDRdWXMvQhTuuLmdAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9bba3807e1b8e02a57594b8dcdfe600af5dc061adf06e754fce8322435057391","last_reissued_at":"2026-05-18T02:00:59.233020Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:00:59.233020Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1305.4977","source_version":4,"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-18T02:00:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3jjjW3IoUl8RgzuDXtWq5TXk2/BCicDK3blSjOMZklG4wtq/o5ASKDqfZBKOczDulY+EgMu3/xr+ZvEIpwN1AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-12T08:14:51.728456Z"},"content_sha256":"d8783f30d522fa22e2324134865f6bdb310005363cae9de4d844b659ac5b6e2e","schema_version":"1.0","event_id":"sha256:d8783f30d522fa22e2324134865f6bdb310005363cae9de4d844b659ac5b6e2e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:TO5DQB7BXDQCUV2ZJOG437TABL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Estimating network degree distributions under sampling: An inverse problem, with applications to monitoring social media networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.ME","authors_text":"Bruce D. Spencer, Eric D. Kolaczyk, Yaonan Zhang","submitted_at":"2013-05-21T22:30:18Z","abstract_excerpt":"Networks are a popular tool for representing elements in a system and their interconnectedness. Many observed networks can be viewed as only samples of some true underlying network. Such is frequently the case, for example, in the monitoring and study of massive, online social networks. We study the problem of how to estimate the degree distribution - an object of fundamental interest - of a true underlying network from its sampled network. In particular, we show that this problem can be formulated as an inverse problem. Playing a key role in this formulation is a matrix relating the expectati"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1305.4977","kind":"arxiv","version":4},"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-18T02:00:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DBwnE0qhGmMrnyIeQvKOjpBd9mcYBgMjugUPQkEbeobjwq8wPqSIb5T5a9R2ruO9DbVSHp4+G2Zc1PMXnvf8BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-12T08:14:51.728807Z"},"content_sha256":"705871c0dd7c89a92233a2ca85f84d68246c93d24d7e5b566b14e826352163c2","schema_version":"1.0","event_id":"sha256:705871c0dd7c89a92233a2ca85f84d68246c93d24d7e5b566b14e826352163c2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TO5DQB7BXDQCUV2ZJOG437TABL/bundle.json","state_url":"https://pith.science/pith/TO5DQB7BXDQCUV2ZJOG437TABL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TO5DQB7BXDQCUV2ZJOG437TABL/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-06-12T08:14:51Z","links":{"resolver":"https://pith.science/pith/TO5DQB7BXDQCUV2ZJOG437TABL","bundle":"https://pith.science/pith/TO5DQB7BXDQCUV2ZJOG437TABL/bundle.json","state":"https://pith.science/pith/TO5DQB7BXDQCUV2ZJOG437TABL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TO5DQB7BXDQCUV2ZJOG437TABL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:TO5DQB7BXDQCUV2ZJOG437TABL","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":"ff682411cff733cd61025e363525b3cd814c6c7bb056bfb24f73fec52625691d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2013-05-21T22:30:18Z","title_canon_sha256":"4562117ddc8af7bc873be4a82cd875c056ed2ef2ecb2aa2e9fcfc600a29e4746"},"schema_version":"1.0","source":{"id":"1305.4977","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1305.4977","created_at":"2026-05-18T02:00:59Z"},{"alias_kind":"arxiv_version","alias_value":"1305.4977v4","created_at":"2026-05-18T02:00:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1305.4977","created_at":"2026-05-18T02:00:59Z"},{"alias_kind":"pith_short_12","alias_value":"TO5DQB7BXDQC","created_at":"2026-05-18T12:28:02Z"},{"alias_kind":"pith_short_16","alias_value":"TO5DQB7BXDQCUV2Z","created_at":"2026-05-18T12:28:02Z"},{"alias_kind":"pith_short_8","alias_value":"TO5DQB7B","created_at":"2026-05-18T12:28:02Z"}],"graph_snapshots":[{"event_id":"sha256:705871c0dd7c89a92233a2ca85f84d68246c93d24d7e5b566b14e826352163c2","target":"graph","created_at":"2026-05-18T02:00:59Z","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":"Networks are a popular tool for representing elements in a system and their interconnectedness. Many observed networks can be viewed as only samples of some true underlying network. Such is frequently the case, for example, in the monitoring and study of massive, online social networks. We study the problem of how to estimate the degree distribution - an object of fundamental interest - of a true underlying network from its sampled network. In particular, we show that this problem can be formulated as an inverse problem. Playing a key role in this formulation is a matrix relating the expectati","authors_text":"Bruce D. Spencer, Eric D. Kolaczyk, Yaonan Zhang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2013-05-21T22:30:18Z","title":"Estimating network degree distributions under sampling: An inverse problem, with applications to monitoring social media networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1305.4977","kind":"arxiv","version":4},"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:d8783f30d522fa22e2324134865f6bdb310005363cae9de4d844b659ac5b6e2e","target":"record","created_at":"2026-05-18T02:00:59Z","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":"ff682411cff733cd61025e363525b3cd814c6c7bb056bfb24f73fec52625691d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2013-05-21T22:30:18Z","title_canon_sha256":"4562117ddc8af7bc873be4a82cd875c056ed2ef2ecb2aa2e9fcfc600a29e4746"},"schema_version":"1.0","source":{"id":"1305.4977","kind":"arxiv","version":4}},"canonical_sha256":"9bba3807e1b8e02a57594b8dcdfe600af5dc061adf06e754fce8322435057391","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9bba3807e1b8e02a57594b8dcdfe600af5dc061adf06e754fce8322435057391","first_computed_at":"2026-05-18T02:00:59.233020Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:00:59.233020Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"liiin0noLMmQN1eOV1mMkbensCoKZL8QtratWyuJy/MUL1J4B6ylSuKMpIwTgRger4EfwDRdWXMvQhTuuLmdAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:00:59.233556Z","signed_message":"canonical_sha256_bytes"},"source_id":"1305.4977","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d8783f30d522fa22e2324134865f6bdb310005363cae9de4d844b659ac5b6e2e","sha256:705871c0dd7c89a92233a2ca85f84d68246c93d24d7e5b566b14e826352163c2"],"state_sha256":"6c0f0a40389f169aa7502a56df242f3b60564f83cfe4f53ec984dd9fcafb71bb"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8EWKM7qDj+Kk1/EKd13H7dURFXyv3kcaLDWonYKIWnlyfRXLFnzQAEVUoQ3QQXMqPRtx7kLJ45qkJkGZbxtnDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-12T08:14:51.730712Z","bundle_sha256":"32cab31ac6c69c2f7967a711a900e7894d31c9da23e3d68e65c3069a6700e5ce"}}