{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:FGY35T3ZAQXQB33K2E2T5PXG2E","short_pith_number":"pith:FGY35T3Z","canonical_record":{"source":{"id":"1703.04157","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2017-03-12T18:29:03Z","cross_cats_sorted":[],"title_canon_sha256":"6f8bdfd3f8ca263138c9ca536edbf8afa6c73f352c97259f9b8830cf1cd21e05","abstract_canon_sha256":"26fb705b06910984de826b6e3a2b97098049c98c64c86d12235f899e3e492565"},"schema_version":"1.0"},"canonical_sha256":"29b1becf79042f00ef6ad1353ebee6d11ace1a07b964df732bc53836f98d6760","source":{"kind":"arxiv","id":"1703.04157","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1703.04157","created_at":"2026-05-18T00:09:05Z"},{"alias_kind":"arxiv_version","alias_value":"1703.04157v3","created_at":"2026-05-18T00:09:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.04157","created_at":"2026-05-18T00:09:05Z"},{"alias_kind":"pith_short_12","alias_value":"FGY35T3ZAQXQ","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_16","alias_value":"FGY35T3ZAQXQB33K","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_8","alias_value":"FGY35T3Z","created_at":"2026-05-18T12:31:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:FGY35T3ZAQXQB33K2E2T5PXG2E","target":"record","payload":{"canonical_record":{"source":{"id":"1703.04157","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2017-03-12T18:29:03Z","cross_cats_sorted":[],"title_canon_sha256":"6f8bdfd3f8ca263138c9ca536edbf8afa6c73f352c97259f9b8830cf1cd21e05","abstract_canon_sha256":"26fb705b06910984de826b6e3a2b97098049c98c64c86d12235f899e3e492565"},"schema_version":"1.0"},"canonical_sha256":"29b1becf79042f00ef6ad1353ebee6d11ace1a07b964df732bc53836f98d6760","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:09:05.861644Z","signature_b64":"JGNWVSTtad/X0FLX46Lf5CpsBQY16FtG68oP734VONMsLMl7sqACds2nIm8DcO48ZumrEJffVatFJBBAW1DwAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"29b1becf79042f00ef6ad1353ebee6d11ace1a07b964df732bc53836f98d6760","last_reissued_at":"2026-05-18T00:09:05.861150Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:09:05.861150Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1703.04157","source_version":3,"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-18T00:09:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qclUYoq/Ft8qQ+CUD8Vb9Ea1o+XFwTKcod7DMDeY37wj3fbUlsBo896vAkXfVlVrhVA4Wb2+OLXScBOfzF5MBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T14:22:09.740343Z"},"content_sha256":"48a247a21cdd5c1f638e7f0567671ac2646e3e05120a9ee77d4a63cfd1dffabd","schema_version":"1.0","event_id":"sha256:48a247a21cdd5c1f638e7f0567671ac2646e3e05120a9ee77d4a63cfd1dffabd"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:FGY35T3ZAQXQB33K2E2T5PXG2E","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Using Aggregated Relational Data to feasibly identify network structure without network data","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.ME","authors_text":"Arun G. Chandrasekhar, Emily Breza, Mengjie Pan, Tyler H. McCormick","submitted_at":"2017-03-12T18:29:03Z","abstract_excerpt":"Social network data is often prohibitively expensive to collect, limiting empirical network research. Typical economic network mapping requires (1) enumerating a census, (2) eliciting the names of all network links for each individual, (3) matching the list of social connections to the census, and (4) repeating (1)-(3) across many networks. In settings requiring field surveys, steps (2)-(3) can be very expensive. In other network populations such as financial intermediaries or high-risk groups, proprietary data and privacy concerns may render (2)-(3) impossible. Both restrict the accessibility"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.04157","kind":"arxiv","version":3},"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-18T00:09:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FCvgbU37mb1o4asIpwkHUsbmcz1rqM4Eu6xhBGS7SEGGzUhaVC/fYJZe0Xlu1zIch16SokqcZwjvyfAM6m0iCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T14:22:09.740677Z"},"content_sha256":"d12ae9130e2da562eef78f3bec17cad8ad59afc1bc598008e4a15a1dab3eab06","schema_version":"1.0","event_id":"sha256:d12ae9130e2da562eef78f3bec17cad8ad59afc1bc598008e4a15a1dab3eab06"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FGY35T3ZAQXQB33K2E2T5PXG2E/bundle.json","state_url":"https://pith.science/pith/FGY35T3ZAQXQB33K2E2T5PXG2E/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FGY35T3ZAQXQB33K2E2T5PXG2E/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-27T14:22:09Z","links":{"resolver":"https://pith.science/pith/FGY35T3ZAQXQB33K2E2T5PXG2E","bundle":"https://pith.science/pith/FGY35T3ZAQXQB33K2E2T5PXG2E/bundle.json","state":"https://pith.science/pith/FGY35T3ZAQXQB33K2E2T5PXG2E/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FGY35T3ZAQXQB33K2E2T5PXG2E/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:FGY35T3ZAQXQB33K2E2T5PXG2E","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":"26fb705b06910984de826b6e3a2b97098049c98c64c86d12235f899e3e492565","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2017-03-12T18:29:03Z","title_canon_sha256":"6f8bdfd3f8ca263138c9ca536edbf8afa6c73f352c97259f9b8830cf1cd21e05"},"schema_version":"1.0","source":{"id":"1703.04157","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1703.04157","created_at":"2026-05-18T00:09:05Z"},{"alias_kind":"arxiv_version","alias_value":"1703.04157v3","created_at":"2026-05-18T00:09:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.04157","created_at":"2026-05-18T00:09:05Z"},{"alias_kind":"pith_short_12","alias_value":"FGY35T3ZAQXQ","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_16","alias_value":"FGY35T3ZAQXQB33K","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_8","alias_value":"FGY35T3Z","created_at":"2026-05-18T12:31:15Z"}],"graph_snapshots":[{"event_id":"sha256:d12ae9130e2da562eef78f3bec17cad8ad59afc1bc598008e4a15a1dab3eab06","target":"graph","created_at":"2026-05-18T00:09:05Z","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":"Social network data is often prohibitively expensive to collect, limiting empirical network research. Typical economic network mapping requires (1) enumerating a census, (2) eliciting the names of all network links for each individual, (3) matching the list of social connections to the census, and (4) repeating (1)-(3) across many networks. In settings requiring field surveys, steps (2)-(3) can be very expensive. In other network populations such as financial intermediaries or high-risk groups, proprietary data and privacy concerns may render (2)-(3) impossible. Both restrict the accessibility","authors_text":"Arun G. Chandrasekhar, Emily Breza, Mengjie Pan, Tyler H. McCormick","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2017-03-12T18:29:03Z","title":"Using Aggregated Relational Data to feasibly identify network structure without network data"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.04157","kind":"arxiv","version":3},"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:48a247a21cdd5c1f638e7f0567671ac2646e3e05120a9ee77d4a63cfd1dffabd","target":"record","created_at":"2026-05-18T00:09:05Z","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":"26fb705b06910984de826b6e3a2b97098049c98c64c86d12235f899e3e492565","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2017-03-12T18:29:03Z","title_canon_sha256":"6f8bdfd3f8ca263138c9ca536edbf8afa6c73f352c97259f9b8830cf1cd21e05"},"schema_version":"1.0","source":{"id":"1703.04157","kind":"arxiv","version":3}},"canonical_sha256":"29b1becf79042f00ef6ad1353ebee6d11ace1a07b964df732bc53836f98d6760","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"29b1becf79042f00ef6ad1353ebee6d11ace1a07b964df732bc53836f98d6760","first_computed_at":"2026-05-18T00:09:05.861150Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:09:05.861150Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"JGNWVSTtad/X0FLX46Lf5CpsBQY16FtG68oP734VONMsLMl7sqACds2nIm8DcO48ZumrEJffVatFJBBAW1DwAw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:09:05.861644Z","signed_message":"canonical_sha256_bytes"},"source_id":"1703.04157","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:48a247a21cdd5c1f638e7f0567671ac2646e3e05120a9ee77d4a63cfd1dffabd","sha256:d12ae9130e2da562eef78f3bec17cad8ad59afc1bc598008e4a15a1dab3eab06"],"state_sha256":"89fe475778233d0c95a64ded68db5fd1c736ed78ccb0a507d14823071c123279"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KY60QItS/IYh5GfWvWyiLykWDAgAaAmu3zddkZaVtO7iGkLmTUUgWUzKbIWPs2W4Vsuq29Yb9wz9ClfImadaBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-27T14:22:09.742505Z","bundle_sha256":"5e36ad93e0f560ef3ee4cefcbf9d0caa3a3cc149dc6d2760e62210cbeb8cd892"}}