{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:DCU2KIP3OLDLNESEXQHGP22RR6","short_pith_number":"pith:DCU2KIP3","canonical_record":{"source":{"id":"1608.03192","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.SI","submitted_at":"2016-08-10T14:46:15Z","cross_cats_sorted":["cs.CL"],"title_canon_sha256":"1ffb874d17c81a826481250d6b79300bb58ad0c0f8389ba694cb5623911d7edd","abstract_canon_sha256":"189450b85b6ef3d7c1d6c65be6263c319a36e4080786fe957be1be2815b783b9"},"schema_version":"1.0"},"canonical_sha256":"18a9a521fb72c6b69244bc0e67eb518faf27a5ded12dddc411924e78c7b90924","source":{"kind":"arxiv","id":"1608.03192","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1608.03192","created_at":"2026-05-18T01:09:30Z"},{"alias_kind":"arxiv_version","alias_value":"1608.03192v1","created_at":"2026-05-18T01:09:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.03192","created_at":"2026-05-18T01:09:30Z"},{"alias_kind":"pith_short_12","alias_value":"DCU2KIP3OLDL","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_16","alias_value":"DCU2KIP3OLDLNESE","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_8","alias_value":"DCU2KIP3","created_at":"2026-05-18T12:30:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:DCU2KIP3OLDLNESEXQHGP22RR6","target":"record","payload":{"canonical_record":{"source":{"id":"1608.03192","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.SI","submitted_at":"2016-08-10T14:46:15Z","cross_cats_sorted":["cs.CL"],"title_canon_sha256":"1ffb874d17c81a826481250d6b79300bb58ad0c0f8389ba694cb5623911d7edd","abstract_canon_sha256":"189450b85b6ef3d7c1d6c65be6263c319a36e4080786fe957be1be2815b783b9"},"schema_version":"1.0"},"canonical_sha256":"18a9a521fb72c6b69244bc0e67eb518faf27a5ded12dddc411924e78c7b90924","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:09:30.037252Z","signature_b64":"GUruKMP3ZTn68uPyvgCnKAe7OjEMBh+8n+JtV/UUWuEjD6tDCuR1k/qMNHldLTKvUlO53E6d1uj0LSCfYJr+BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"18a9a521fb72c6b69244bc0e67eb518faf27a5ded12dddc411924e78c7b90924","last_reissued_at":"2026-05-18T01:09:30.036877Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:09:30.036877Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1608.03192","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-18T01:09:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"imGFPudkD+enS5M8gxMnsHGWo1ntlXBPuRYkFBEFgBVWcA0z/op8pw5q0Jre/DRFZVZ6XkNFpo3HNJy6EUJ7DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T10:19:23.379786Z"},"content_sha256":"e1248b206197fdf849d70d2cdc38561117f40d61ac68eb45a30809cc8c15d6a5","schema_version":"1.0","event_id":"sha256:e1248b206197fdf849d70d2cdc38561117f40d61ac68eb45a30809cc8c15d6a5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:DCU2KIP3OLDLNESEXQHGP22RR6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Growing Graphs with Hyperedge Replacement Graph Grammars","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CL"],"primary_cat":"cs.SI","authors_text":"David Chiang, Rodrigo Palacios, Salvador Agui\\~naga, Tim Weninger","submitted_at":"2016-08-10T14:46:15Z","abstract_excerpt":"Discovering the underlying structures present in large real world graphs is a fundamental scientific problem. In this paper we show that a graph's clique tree can be used to extract a hyperedge replacement grammar. If we store an ordering from the extraction process, the extracted graph grammar is guaranteed to generate an isomorphic copy of the original graph. Or, a stochastic application of the graph grammar rules can be used to quickly create random graphs. In experiments on large real world networks, we show that random graphs, generated from extracted graph grammars, exhibit a wide range "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.03192","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-18T01:09:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0oIp42eG9fheSHPefW8kKxZz6FcNO5P8KF740z8gfS8OAf+Am1AmeN+9kMaDW9IIoesUPqGNmdV5dO8O8f++CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T10:19:23.380138Z"},"content_sha256":"91832f8e1e877b455745dfffe5376aca731ec0770315fd127011a91c0a8eb8be","schema_version":"1.0","event_id":"sha256:91832f8e1e877b455745dfffe5376aca731ec0770315fd127011a91c0a8eb8be"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DCU2KIP3OLDLNESEXQHGP22RR6/bundle.json","state_url":"https://pith.science/pith/DCU2KIP3OLDLNESEXQHGP22RR6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DCU2KIP3OLDLNESEXQHGP22RR6/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-28T10:19:23Z","links":{"resolver":"https://pith.science/pith/DCU2KIP3OLDLNESEXQHGP22RR6","bundle":"https://pith.science/pith/DCU2KIP3OLDLNESEXQHGP22RR6/bundle.json","state":"https://pith.science/pith/DCU2KIP3OLDLNESEXQHGP22RR6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DCU2KIP3OLDLNESEXQHGP22RR6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:DCU2KIP3OLDLNESEXQHGP22RR6","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":"189450b85b6ef3d7c1d6c65be6263c319a36e4080786fe957be1be2815b783b9","cross_cats_sorted":["cs.CL"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.SI","submitted_at":"2016-08-10T14:46:15Z","title_canon_sha256":"1ffb874d17c81a826481250d6b79300bb58ad0c0f8389ba694cb5623911d7edd"},"schema_version":"1.0","source":{"id":"1608.03192","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1608.03192","created_at":"2026-05-18T01:09:30Z"},{"alias_kind":"arxiv_version","alias_value":"1608.03192v1","created_at":"2026-05-18T01:09:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.03192","created_at":"2026-05-18T01:09:30Z"},{"alias_kind":"pith_short_12","alias_value":"DCU2KIP3OLDL","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_16","alias_value":"DCU2KIP3OLDLNESE","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_8","alias_value":"DCU2KIP3","created_at":"2026-05-18T12:30:12Z"}],"graph_snapshots":[{"event_id":"sha256:91832f8e1e877b455745dfffe5376aca731ec0770315fd127011a91c0a8eb8be","target":"graph","created_at":"2026-05-18T01:09:30Z","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":"Discovering the underlying structures present in large real world graphs is a fundamental scientific problem. In this paper we show that a graph's clique tree can be used to extract a hyperedge replacement grammar. If we store an ordering from the extraction process, the extracted graph grammar is guaranteed to generate an isomorphic copy of the original graph. Or, a stochastic application of the graph grammar rules can be used to quickly create random graphs. In experiments on large real world networks, we show that random graphs, generated from extracted graph grammars, exhibit a wide range ","authors_text":"David Chiang, Rodrigo Palacios, Salvador Agui\\~naga, Tim Weninger","cross_cats":["cs.CL"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.SI","submitted_at":"2016-08-10T14:46:15Z","title":"Growing Graphs with Hyperedge Replacement Graph Grammars"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.03192","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:e1248b206197fdf849d70d2cdc38561117f40d61ac68eb45a30809cc8c15d6a5","target":"record","created_at":"2026-05-18T01:09:30Z","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":"189450b85b6ef3d7c1d6c65be6263c319a36e4080786fe957be1be2815b783b9","cross_cats_sorted":["cs.CL"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.SI","submitted_at":"2016-08-10T14:46:15Z","title_canon_sha256":"1ffb874d17c81a826481250d6b79300bb58ad0c0f8389ba694cb5623911d7edd"},"schema_version":"1.0","source":{"id":"1608.03192","kind":"arxiv","version":1}},"canonical_sha256":"18a9a521fb72c6b69244bc0e67eb518faf27a5ded12dddc411924e78c7b90924","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"18a9a521fb72c6b69244bc0e67eb518faf27a5ded12dddc411924e78c7b90924","first_computed_at":"2026-05-18T01:09:30.036877Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:09:30.036877Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"GUruKMP3ZTn68uPyvgCnKAe7OjEMBh+8n+JtV/UUWuEjD6tDCuR1k/qMNHldLTKvUlO53E6d1uj0LSCfYJr+BQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:09:30.037252Z","signed_message":"canonical_sha256_bytes"},"source_id":"1608.03192","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e1248b206197fdf849d70d2cdc38561117f40d61ac68eb45a30809cc8c15d6a5","sha256:91832f8e1e877b455745dfffe5376aca731ec0770315fd127011a91c0a8eb8be"],"state_sha256":"46de755c7930d6acbde3917141d12dab86397a4fb279a14e2f013db7c4e365cb"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vqe7VwfkQTqDgrPEY+w/JIv6d+LNoCLqPhY1ougCi/2aD8TKTzc3ObN5nEAocnnTKAPxB/zp7O4UzUMEBno/Bg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T10:19:23.382118Z","bundle_sha256":"02f128ef9229389b9a7b8a657c0d07773cd8f57df9b17a06395debf30ebb4db0"}}