{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:SGB2XWP3XU2Z5H54LG7E63QW7P","short_pith_number":"pith:SGB2XWP3","canonical_record":{"source":{"id":"1709.02339","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2017-09-07T16:30:54Z","cross_cats_sorted":[],"title_canon_sha256":"2711788571d3ef7392fc05f4eec23e2b759726ee8895bb1cc80a66134c4f8ee4","abstract_canon_sha256":"43756d4c9c8dc711d7ea8b19418ec6472fdd1210da7776a1afa7074c6868c3cc"},"schema_version":"1.0"},"canonical_sha256":"9183abd9fbbd359e9fbc59be4f6e16fbe645a2e2d28f05d4952a70fc03af7305","source":{"kind":"arxiv","id":"1709.02339","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.02339","created_at":"2026-05-17T23:40:24Z"},{"alias_kind":"arxiv_version","alias_value":"1709.02339v2","created_at":"2026-05-17T23:40:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.02339","created_at":"2026-05-17T23:40:24Z"},{"alias_kind":"pith_short_12","alias_value":"SGB2XWP3XU2Z","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_16","alias_value":"SGB2XWP3XU2Z5H54","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_8","alias_value":"SGB2XWP3","created_at":"2026-05-18T12:31:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:SGB2XWP3XU2Z5H54LG7E63QW7P","target":"record","payload":{"canonical_record":{"source":{"id":"1709.02339","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2017-09-07T16:30:54Z","cross_cats_sorted":[],"title_canon_sha256":"2711788571d3ef7392fc05f4eec23e2b759726ee8895bb1cc80a66134c4f8ee4","abstract_canon_sha256":"43756d4c9c8dc711d7ea8b19418ec6472fdd1210da7776a1afa7074c6868c3cc"},"schema_version":"1.0"},"canonical_sha256":"9183abd9fbbd359e9fbc59be4f6e16fbe645a2e2d28f05d4952a70fc03af7305","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:40:24.393595Z","signature_b64":"b2pq8D80cm5Ebs4a8Tp/AOvdH6r3qTU5CnJTu9Y0ME3O+E5celH4039NEWy1HFSHdleFHJXczstvlfqkWYVGBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9183abd9fbbd359e9fbc59be4f6e16fbe645a2e2d28f05d4952a70fc03af7305","last_reissued_at":"2026-05-17T23:40:24.392889Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:40:24.392889Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1709.02339","source_version":2,"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-17T23:40:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sWt2USVkvv91FVMpTPpKgSU5syXj4WYRl8KS0UQzvElWMgZAQGz5KlY65F47s495+vbDT3AjxelLsTU6r7K7Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T18:15:28.019139Z"},"content_sha256":"e7c64fffb13c84173968a54aac552b887dd1ec9da4df69ddb8cce310a4d47bc3","schema_version":"1.0","event_id":"sha256:e7c64fffb13c84173968a54aac552b887dd1ec9da4df69ddb8cce310a4d47bc3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:SGB2XWP3XU2Z5H54LG7E63QW7P","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"When Labels Fall Short: Property Graph Simulation via Blending of Network Structure and Vertex Attributes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SI","authors_text":"Arun V. Sathanur, Cliff Joslyn, Sumit Purohit, Sutanay Choudhury","submitted_at":"2017-09-07T16:30:54Z","abstract_excerpt":"Property graphs can be used to represent heterogeneous networks with labeled (attributed) vertices and edges. Given a property graph, simulating another graph with same or greater size with the same statistical properties with respect to the labels and connectivity is critical for privacy preservation and benchmarking purposes. In this work we tackle the problem of capturing the statistical dependence of the edge connectivity on the vertex labels and using the same distribution to regenerate property graphs of the same or expanded size in a scalable manner. However, accurate simulation becomes"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.02339","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"},"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-17T23:40:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wfdQdEj5L55Zxz2cdVKomZDUxmwu3KZw2jrcVbqFQLPYbWNbFlrqWFv8qR9QpaT89Hi8GDFF83xWR1LWQZRSAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T18:15:28.019519Z"},"content_sha256":"081eaf465dca01937091f3a1dc052c14d455b96a4fa1b4d234a9d5f576f38516","schema_version":"1.0","event_id":"sha256:081eaf465dca01937091f3a1dc052c14d455b96a4fa1b4d234a9d5f576f38516"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SGB2XWP3XU2Z5H54LG7E63QW7P/bundle.json","state_url":"https://pith.science/pith/SGB2XWP3XU2Z5H54LG7E63QW7P/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SGB2XWP3XU2Z5H54LG7E63QW7P/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-01T18:15:28Z","links":{"resolver":"https://pith.science/pith/SGB2XWP3XU2Z5H54LG7E63QW7P","bundle":"https://pith.science/pith/SGB2XWP3XU2Z5H54LG7E63QW7P/bundle.json","state":"https://pith.science/pith/SGB2XWP3XU2Z5H54LG7E63QW7P/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SGB2XWP3XU2Z5H54LG7E63QW7P/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:SGB2XWP3XU2Z5H54LG7E63QW7P","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":"43756d4c9c8dc711d7ea8b19418ec6472fdd1210da7776a1afa7074c6868c3cc","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2017-09-07T16:30:54Z","title_canon_sha256":"2711788571d3ef7392fc05f4eec23e2b759726ee8895bb1cc80a66134c4f8ee4"},"schema_version":"1.0","source":{"id":"1709.02339","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.02339","created_at":"2026-05-17T23:40:24Z"},{"alias_kind":"arxiv_version","alias_value":"1709.02339v2","created_at":"2026-05-17T23:40:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.02339","created_at":"2026-05-17T23:40:24Z"},{"alias_kind":"pith_short_12","alias_value":"SGB2XWP3XU2Z","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_16","alias_value":"SGB2XWP3XU2Z5H54","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_8","alias_value":"SGB2XWP3","created_at":"2026-05-18T12:31:43Z"}],"graph_snapshots":[{"event_id":"sha256:081eaf465dca01937091f3a1dc052c14d455b96a4fa1b4d234a9d5f576f38516","target":"graph","created_at":"2026-05-17T23:40:24Z","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":"Property graphs can be used to represent heterogeneous networks with labeled (attributed) vertices and edges. Given a property graph, simulating another graph with same or greater size with the same statistical properties with respect to the labels and connectivity is critical for privacy preservation and benchmarking purposes. In this work we tackle the problem of capturing the statistical dependence of the edge connectivity on the vertex labels and using the same distribution to regenerate property graphs of the same or expanded size in a scalable manner. However, accurate simulation becomes","authors_text":"Arun V. Sathanur, Cliff Joslyn, Sumit Purohit, Sutanay Choudhury","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2017-09-07T16:30:54Z","title":"When Labels Fall Short: Property Graph Simulation via Blending of Network Structure and Vertex Attributes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.02339","kind":"arxiv","version":2},"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:e7c64fffb13c84173968a54aac552b887dd1ec9da4df69ddb8cce310a4d47bc3","target":"record","created_at":"2026-05-17T23:40:24Z","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":"43756d4c9c8dc711d7ea8b19418ec6472fdd1210da7776a1afa7074c6868c3cc","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2017-09-07T16:30:54Z","title_canon_sha256":"2711788571d3ef7392fc05f4eec23e2b759726ee8895bb1cc80a66134c4f8ee4"},"schema_version":"1.0","source":{"id":"1709.02339","kind":"arxiv","version":2}},"canonical_sha256":"9183abd9fbbd359e9fbc59be4f6e16fbe645a2e2d28f05d4952a70fc03af7305","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9183abd9fbbd359e9fbc59be4f6e16fbe645a2e2d28f05d4952a70fc03af7305","first_computed_at":"2026-05-17T23:40:24.392889Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:40:24.392889Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"b2pq8D80cm5Ebs4a8Tp/AOvdH6r3qTU5CnJTu9Y0ME3O+E5celH4039NEWy1HFSHdleFHJXczstvlfqkWYVGBA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:40:24.393595Z","signed_message":"canonical_sha256_bytes"},"source_id":"1709.02339","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e7c64fffb13c84173968a54aac552b887dd1ec9da4df69ddb8cce310a4d47bc3","sha256:081eaf465dca01937091f3a1dc052c14d455b96a4fa1b4d234a9d5f576f38516"],"state_sha256":"2feec5ce87391fe18433959b5b7ebcfb142cc56d5c15159c442c9a1e55a5a045"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4VANPgfFiaRK9YEHKAqCE87jk24TLimsdF6Qiew2veo5EDt+9zZM2NObCLOSJsw3m7PJW9ykZMb+tFRIrp5LCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T18:15:28.021706Z","bundle_sha256":"150551cf8595342a4d055eb295106962623b438bde82077832ac95b4167fc653"}}