{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:Z3BQDDH44UOULCGHZMQ7GVGPRK","short_pith_number":"pith:Z3BQDDH4","canonical_record":{"source":{"id":"1803.09021","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2018-03-24T00:49:42Z","cross_cats_sorted":["cs.SI","math.CO"],"title_canon_sha256":"b0e49a8a2e949cebcee14550fe0c59d00785f7c0fb2d9c9966c31014aa047e27","abstract_canon_sha256":"f72b9fd7fd46cb2b872bb23e06d85482c37b6811ca9f4a5292a07aa3472e999c"},"schema_version":"1.0"},"canonical_sha256":"cec3018cfce51d4588c7cb21f354cf8a86091d0a8795257f5d720dd5d208a5df","source":{"kind":"arxiv","id":"1803.09021","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.09021","created_at":"2026-05-17T23:58:19Z"},{"alias_kind":"arxiv_version","alias_value":"1803.09021v1","created_at":"2026-05-17T23:58:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.09021","created_at":"2026-05-17T23:58:19Z"},{"alias_kind":"pith_short_12","alias_value":"Z3BQDDH44UOU","created_at":"2026-05-18T12:33:04Z"},{"alias_kind":"pith_short_16","alias_value":"Z3BQDDH44UOULCGH","created_at":"2026-05-18T12:33:04Z"},{"alias_kind":"pith_short_8","alias_value":"Z3BQDDH4","created_at":"2026-05-18T12:33:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:Z3BQDDH44UOULCGHZMQ7GVGPRK","target":"record","payload":{"canonical_record":{"source":{"id":"1803.09021","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2018-03-24T00:49:42Z","cross_cats_sorted":["cs.SI","math.CO"],"title_canon_sha256":"b0e49a8a2e949cebcee14550fe0c59d00785f7c0fb2d9c9966c31014aa047e27","abstract_canon_sha256":"f72b9fd7fd46cb2b872bb23e06d85482c37b6811ca9f4a5292a07aa3472e999c"},"schema_version":"1.0"},"canonical_sha256":"cec3018cfce51d4588c7cb21f354cf8a86091d0a8795257f5d720dd5d208a5df","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:58:19.387576Z","signature_b64":"MQIIgafyYP65U0X3AuQxm96iKR8G4392b70Okipl/MVlknBHXYSsXK8EGUGkX4UmiLNYZuc5kFfQ+AUEHjkqDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cec3018cfce51d4588c7cb21f354cf8a86091d0a8795257f5d720dd5d208a5df","last_reissued_at":"2026-05-17T23:58:19.387083Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:58:19.387083Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1803.09021","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-17T23:58:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9PaR5sGDnSulXW9nz2cRO0DDVNcU/N/hzd41za6ooF0fHjgGVxaxpoZ5U6DuAITBJd8UoDNl0ywx/GZ8UMOdCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T12:22:08.175515Z"},"content_sha256":"5bdddc5ce5af233c4bf2e2212f4d1f8553292bcc9e19cbe4cfdc6685a9ea88d4","schema_version":"1.0","event_id":"sha256:5bdddc5ce5af233c4bf2e2212f4d1f8553292bcc9e19cbe4cfdc6685a9ea88d4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:Z3BQDDH44UOULCGHZMQ7GVGPRK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On Large-Scale Graph Generation with Validation of Diverse Triangle Statistics at Edges and Vertices","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SI","math.CO"],"primary_cat":"cs.DM","authors_text":"Geoffrey Sanders, Jeremy Kepner, Roger Pearce, Timothy La Fond","submitted_at":"2018-03-24T00:49:42Z","abstract_excerpt":"Researchers developing implementations of distributed graph analytic algorithms require graph generators that yield graphs sharing the challenging characteristics of real-world graphs (small-world, scale-free, heavy-tailed degree distribution) with efficiently calculable ground-truth solutions to the desired output. Reproducibility for current generators used in benchmarking are somewhat lacking in this respect due to their randomness: the output of a desired graph analytic can only be compared to expected values and not exact ground truth. Nonstochastic Kronecker product graphs meet these des"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.09021","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-17T23:58:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Sal5ddrsU3tjWGd3bJlTuSHgb3vJCGb6P8keoYvyw/n4F6x/pJm6AkP3gKhiAUKTzAxTXgWg2yVBX7e5u+ETAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T12:22:08.176273Z"},"content_sha256":"35b41884fd705a58c98042a5e3fe33d039a771d6ee0f0d14d3427b7c9c67b807","schema_version":"1.0","event_id":"sha256:35b41884fd705a58c98042a5e3fe33d039a771d6ee0f0d14d3427b7c9c67b807"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/Z3BQDDH44UOULCGHZMQ7GVGPRK/bundle.json","state_url":"https://pith.science/pith/Z3BQDDH44UOULCGHZMQ7GVGPRK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/Z3BQDDH44UOULCGHZMQ7GVGPRK/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-06T12:22:08Z","links":{"resolver":"https://pith.science/pith/Z3BQDDH44UOULCGHZMQ7GVGPRK","bundle":"https://pith.science/pith/Z3BQDDH44UOULCGHZMQ7GVGPRK/bundle.json","state":"https://pith.science/pith/Z3BQDDH44UOULCGHZMQ7GVGPRK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/Z3BQDDH44UOULCGHZMQ7GVGPRK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:Z3BQDDH44UOULCGHZMQ7GVGPRK","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":"f72b9fd7fd46cb2b872bb23e06d85482c37b6811ca9f4a5292a07aa3472e999c","cross_cats_sorted":["cs.SI","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2018-03-24T00:49:42Z","title_canon_sha256":"b0e49a8a2e949cebcee14550fe0c59d00785f7c0fb2d9c9966c31014aa047e27"},"schema_version":"1.0","source":{"id":"1803.09021","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.09021","created_at":"2026-05-17T23:58:19Z"},{"alias_kind":"arxiv_version","alias_value":"1803.09021v1","created_at":"2026-05-17T23:58:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.09021","created_at":"2026-05-17T23:58:19Z"},{"alias_kind":"pith_short_12","alias_value":"Z3BQDDH44UOU","created_at":"2026-05-18T12:33:04Z"},{"alias_kind":"pith_short_16","alias_value":"Z3BQDDH44UOULCGH","created_at":"2026-05-18T12:33:04Z"},{"alias_kind":"pith_short_8","alias_value":"Z3BQDDH4","created_at":"2026-05-18T12:33:04Z"}],"graph_snapshots":[{"event_id":"sha256:35b41884fd705a58c98042a5e3fe33d039a771d6ee0f0d14d3427b7c9c67b807","target":"graph","created_at":"2026-05-17T23:58:19Z","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":"Researchers developing implementations of distributed graph analytic algorithms require graph generators that yield graphs sharing the challenging characteristics of real-world graphs (small-world, scale-free, heavy-tailed degree distribution) with efficiently calculable ground-truth solutions to the desired output. Reproducibility for current generators used in benchmarking are somewhat lacking in this respect due to their randomness: the output of a desired graph analytic can only be compared to expected values and not exact ground truth. Nonstochastic Kronecker product graphs meet these des","authors_text":"Geoffrey Sanders, Jeremy Kepner, Roger Pearce, Timothy La Fond","cross_cats":["cs.SI","math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2018-03-24T00:49:42Z","title":"On Large-Scale Graph Generation with Validation of Diverse Triangle Statistics at Edges and Vertices"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.09021","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:5bdddc5ce5af233c4bf2e2212f4d1f8553292bcc9e19cbe4cfdc6685a9ea88d4","target":"record","created_at":"2026-05-17T23:58:19Z","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":"f72b9fd7fd46cb2b872bb23e06d85482c37b6811ca9f4a5292a07aa3472e999c","cross_cats_sorted":["cs.SI","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2018-03-24T00:49:42Z","title_canon_sha256":"b0e49a8a2e949cebcee14550fe0c59d00785f7c0fb2d9c9966c31014aa047e27"},"schema_version":"1.0","source":{"id":"1803.09021","kind":"arxiv","version":1}},"canonical_sha256":"cec3018cfce51d4588c7cb21f354cf8a86091d0a8795257f5d720dd5d208a5df","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"cec3018cfce51d4588c7cb21f354cf8a86091d0a8795257f5d720dd5d208a5df","first_computed_at":"2026-05-17T23:58:19.387083Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:58:19.387083Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"MQIIgafyYP65U0X3AuQxm96iKR8G4392b70Okipl/MVlknBHXYSsXK8EGUGkX4UmiLNYZuc5kFfQ+AUEHjkqDQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:58:19.387576Z","signed_message":"canonical_sha256_bytes"},"source_id":"1803.09021","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5bdddc5ce5af233c4bf2e2212f4d1f8553292bcc9e19cbe4cfdc6685a9ea88d4","sha256:35b41884fd705a58c98042a5e3fe33d039a771d6ee0f0d14d3427b7c9c67b807"],"state_sha256":"da23d6f548cef88137832923c7ccbbe3d2da3f6a30781989ab413120d2971fc9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WY/MKQXPRWOQcfg67nzQJVziDNpOUHw9hHy77oXBoZqnX0+NhZgxysq6PV0Cp/S1IRWda9T5/evE8VFb7cVqBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T12:22:08.180755Z","bundle_sha256":"9d1f97629af0ca92539ca576f58b80269e2dd9712f64adfdf5bf85268f1cafae"}}