{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:EIBY7HWZHADW3WWNXMKF5XB7HC","short_pith_number":"pith:EIBY7HWZ","canonical_record":{"source":{"id":"1902.07159","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2019-02-11T00:01:04Z","cross_cats_sorted":["cs.DB"],"title_canon_sha256":"ffc23e0e55aa85110525dc2fca6d23132bb6fdb55c8ee056ec33f25d74e1fd89","abstract_canon_sha256":"df1a4c432896a8f7cf63d5ae9240b1be7c563e45479619ec97942f794014fbbe"},"schema_version":"1.0"},"canonical_sha256":"22038f9ed938076ddacdbb145edc3f38a8817930c8d32dde41ad164cae67be09","source":{"kind":"arxiv","id":"1902.07159","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1902.07159","created_at":"2026-05-17T23:52:58Z"},{"alias_kind":"arxiv_version","alias_value":"1902.07159v1","created_at":"2026-05-17T23:52:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.07159","created_at":"2026-05-17T23:52:58Z"},{"alias_kind":"pith_short_12","alias_value":"EIBY7HWZHADW","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_16","alias_value":"EIBY7HWZHADW3WWN","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_8","alias_value":"EIBY7HWZ","created_at":"2026-05-18T12:33:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:EIBY7HWZHADW3WWNXMKF5XB7HC","target":"record","payload":{"canonical_record":{"source":{"id":"1902.07159","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2019-02-11T00:01:04Z","cross_cats_sorted":["cs.DB"],"title_canon_sha256":"ffc23e0e55aa85110525dc2fca6d23132bb6fdb55c8ee056ec33f25d74e1fd89","abstract_canon_sha256":"df1a4c432896a8f7cf63d5ae9240b1be7c563e45479619ec97942f794014fbbe"},"schema_version":"1.0"},"canonical_sha256":"22038f9ed938076ddacdbb145edc3f38a8817930c8d32dde41ad164cae67be09","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:52:58.097644Z","signature_b64":"AnX21z/tBBCUkAYz1UgIgfyYxBeh0r11WybtohedTZR2SykRvKfSoGEr8nGUps/0YAyeFzmLEfkNEkm/5leDCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"22038f9ed938076ddacdbb145edc3f38a8817930c8d32dde41ad164cae67be09","last_reissued_at":"2026-05-17T23:52:58.096910Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:52:58.096910Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1902.07159","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:52:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jL1d5slb0wXAzWZz3GB94MqUfrkPPLpHhkE10ti7ABzO4jhIKtBTrO+biKrVg7cX/M5w1NKU4pDajoVoGIZWCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T09:58:09.612684Z"},"content_sha256":"860ca153ba08e8454d261391b30ba48f603cec34596bd9d333b85ca82fd39f25","schema_version":"1.0","event_id":"sha256:860ca153ba08e8454d261391b30ba48f603cec34596bd9d333b85ca82fd39f25"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:EIBY7HWZHADW3WWNXMKF5XB7HC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Edge Replacement Grammars: A Formal Language Approach for Generating Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DB"],"primary_cat":"cs.SI","authors_text":"Balaraman Ravindran, Revanth Reddy, Sarath Chandar","submitted_at":"2019-02-11T00:01:04Z","abstract_excerpt":"Graphs are increasingly becoming ubiquitous as models for structured data. A generative model that closely mimics the structural properties of a given set of graphs has utility in a variety of domains. Much of the existing work require that a large number of parameters, in fact exponential in size of the graphs, be estimated from the data. We take a slightly different approach to this problem, leveraging the extensive prior work in the formal graph grammar literature. In this paper, we propose a graph generation model based on Probabilistic Edge Replacement Grammars (PERGs). We propose a varia"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.07159","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:52:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9ORUMhwK0DsalyB4kA3inbKGTSNAbVIFcxPkVlwEx4BNidAHRyJRp7oXxXMu9uBB7chUS80h2SfPoewOQRkpBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T09:58:09.613569Z"},"content_sha256":"97f69c149e3ee90636c42a9bc5fd4527289d2fac0acf82a8cd33f21d0a7d9099","schema_version":"1.0","event_id":"sha256:97f69c149e3ee90636c42a9bc5fd4527289d2fac0acf82a8cd33f21d0a7d9099"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EIBY7HWZHADW3WWNXMKF5XB7HC/bundle.json","state_url":"https://pith.science/pith/EIBY7HWZHADW3WWNXMKF5XB7HC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EIBY7HWZHADW3WWNXMKF5XB7HC/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-31T09:58:09Z","links":{"resolver":"https://pith.science/pith/EIBY7HWZHADW3WWNXMKF5XB7HC","bundle":"https://pith.science/pith/EIBY7HWZHADW3WWNXMKF5XB7HC/bundle.json","state":"https://pith.science/pith/EIBY7HWZHADW3WWNXMKF5XB7HC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EIBY7HWZHADW3WWNXMKF5XB7HC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:EIBY7HWZHADW3WWNXMKF5XB7HC","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":"df1a4c432896a8f7cf63d5ae9240b1be7c563e45479619ec97942f794014fbbe","cross_cats_sorted":["cs.DB"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2019-02-11T00:01:04Z","title_canon_sha256":"ffc23e0e55aa85110525dc2fca6d23132bb6fdb55c8ee056ec33f25d74e1fd89"},"schema_version":"1.0","source":{"id":"1902.07159","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1902.07159","created_at":"2026-05-17T23:52:58Z"},{"alias_kind":"arxiv_version","alias_value":"1902.07159v1","created_at":"2026-05-17T23:52:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.07159","created_at":"2026-05-17T23:52:58Z"},{"alias_kind":"pith_short_12","alias_value":"EIBY7HWZHADW","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_16","alias_value":"EIBY7HWZHADW3WWN","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_8","alias_value":"EIBY7HWZ","created_at":"2026-05-18T12:33:15Z"}],"graph_snapshots":[{"event_id":"sha256:97f69c149e3ee90636c42a9bc5fd4527289d2fac0acf82a8cd33f21d0a7d9099","target":"graph","created_at":"2026-05-17T23:52:58Z","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":"Graphs are increasingly becoming ubiquitous as models for structured data. A generative model that closely mimics the structural properties of a given set of graphs has utility in a variety of domains. Much of the existing work require that a large number of parameters, in fact exponential in size of the graphs, be estimated from the data. We take a slightly different approach to this problem, leveraging the extensive prior work in the formal graph grammar literature. In this paper, we propose a graph generation model based on Probabilistic Edge Replacement Grammars (PERGs). We propose a varia","authors_text":"Balaraman Ravindran, Revanth Reddy, Sarath Chandar","cross_cats":["cs.DB"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2019-02-11T00:01:04Z","title":"Edge Replacement Grammars: A Formal Language Approach for Generating Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.07159","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:860ca153ba08e8454d261391b30ba48f603cec34596bd9d333b85ca82fd39f25","target":"record","created_at":"2026-05-17T23:52:58Z","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":"df1a4c432896a8f7cf63d5ae9240b1be7c563e45479619ec97942f794014fbbe","cross_cats_sorted":["cs.DB"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2019-02-11T00:01:04Z","title_canon_sha256":"ffc23e0e55aa85110525dc2fca6d23132bb6fdb55c8ee056ec33f25d74e1fd89"},"schema_version":"1.0","source":{"id":"1902.07159","kind":"arxiv","version":1}},"canonical_sha256":"22038f9ed938076ddacdbb145edc3f38a8817930c8d32dde41ad164cae67be09","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"22038f9ed938076ddacdbb145edc3f38a8817930c8d32dde41ad164cae67be09","first_computed_at":"2026-05-17T23:52:58.096910Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:52:58.096910Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"AnX21z/tBBCUkAYz1UgIgfyYxBeh0r11WybtohedTZR2SykRvKfSoGEr8nGUps/0YAyeFzmLEfkNEkm/5leDCw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:52:58.097644Z","signed_message":"canonical_sha256_bytes"},"source_id":"1902.07159","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:860ca153ba08e8454d261391b30ba48f603cec34596bd9d333b85ca82fd39f25","sha256:97f69c149e3ee90636c42a9bc5fd4527289d2fac0acf82a8cd33f21d0a7d9099"],"state_sha256":"a2f8ebf6e3978a6d4778c1c16e4e5a88a0d6f02981fa9d96c5a30fba7593254b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DJ301BFo3cEHaA4ervKu94uKiHJHiTNrqvB4p+KW8VMxazusS55cOP6ZYS0gi2Wd8DCA8xz1bmENxNLWBdyWAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T09:58:09.617602Z","bundle_sha256":"6ecef9cc6b16a20426746614fd62be7358196e8992319b068f3c1ec1a2956bf5"}}