{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:EIBY7HWZHADW3WWNXMKF5XB7HC","short_pith_number":"pith:EIBY7HWZ","schema_version":"1.0","canonical_sha256":"22038f9ed938076ddacdbb145edc3f38a8817930c8d32dde41ad164cae67be09","source":{"kind":"arxiv","id":"1902.07159","version":1},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1902.07159","created_at":"2026-05-17T23:52:58.097040+00:00"},{"alias_kind":"arxiv_version","alias_value":"1902.07159v1","created_at":"2026-05-17T23:52:58.097040+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.07159","created_at":"2026-05-17T23:52:58.097040+00:00"},{"alias_kind":"pith_short_12","alias_value":"EIBY7HWZHADW","created_at":"2026-05-18T12:33:15.570797+00:00"},{"alias_kind":"pith_short_16","alias_value":"EIBY7HWZHADW3WWN","created_at":"2026-05-18T12:33:15.570797+00:00"},{"alias_kind":"pith_short_8","alias_value":"EIBY7HWZ","created_at":"2026-05-18T12:33:15.570797+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/EIBY7HWZHADW3WWNXMKF5XB7HC","json":"https://pith.science/pith/EIBY7HWZHADW3WWNXMKF5XB7HC.json","graph_json":"https://pith.science/api/pith-number/EIBY7HWZHADW3WWNXMKF5XB7HC/graph.json","events_json":"https://pith.science/api/pith-number/EIBY7HWZHADW3WWNXMKF5XB7HC/events.json","paper":"https://pith.science/paper/EIBY7HWZ"},"agent_actions":{"view_html":"https://pith.science/pith/EIBY7HWZHADW3WWNXMKF5XB7HC","download_json":"https://pith.science/pith/EIBY7HWZHADW3WWNXMKF5XB7HC.json","view_paper":"https://pith.science/paper/EIBY7HWZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1902.07159&json=true","fetch_graph":"https://pith.science/api/pith-number/EIBY7HWZHADW3WWNXMKF5XB7HC/graph.json","fetch_events":"https://pith.science/api/pith-number/EIBY7HWZHADW3WWNXMKF5XB7HC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EIBY7HWZHADW3WWNXMKF5XB7HC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EIBY7HWZHADW3WWNXMKF5XB7HC/action/storage_attestation","attest_author":"https://pith.science/pith/EIBY7HWZHADW3WWNXMKF5XB7HC/action/author_attestation","sign_citation":"https://pith.science/pith/EIBY7HWZHADW3WWNXMKF5XB7HC/action/citation_signature","submit_replication":"https://pith.science/pith/EIBY7HWZHADW3WWNXMKF5XB7HC/action/replication_record"}},"created_at":"2026-05-17T23:52:58.097040+00:00","updated_at":"2026-05-17T23:52:58.097040+00:00"}