{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:MWAI5WMHAJQQO2UK4XLRTKKPFT","short_pith_number":"pith:MWAI5WMH","canonical_record":{"source":{"id":"1908.03837","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.SI","submitted_at":"2019-08-11T01:30:02Z","cross_cats_sorted":["cs.FL"],"title_canon_sha256":"3b54a117184bae38fb9295e3463ed4dd896ab8b7637bc22c602f6c602399b72d","abstract_canon_sha256":"fc9bf327b1d97f43e19880d765f188d243e5ea2c0278ca2fd267b6d7383e6748"},"schema_version":"1.0"},"canonical_sha256":"65808ed9870261076a8ae5d719a94f2cd616cf822bce522176b21ddd127b3825","source":{"kind":"arxiv","id":"1908.03837","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1908.03837","created_at":"2026-07-05T05:36:13Z"},{"alias_kind":"arxiv_version","alias_value":"1908.03837v2","created_at":"2026-07-05T05:36:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.03837","created_at":"2026-07-05T05:36:13Z"},{"alias_kind":"pith_short_12","alias_value":"MWAI5WMHAJQQ","created_at":"2026-07-05T05:36:13Z"},{"alias_kind":"pith_short_16","alias_value":"MWAI5WMHAJQQO2UK","created_at":"2026-07-05T05:36:13Z"},{"alias_kind":"pith_short_8","alias_value":"MWAI5WMH","created_at":"2026-07-05T05:36:13Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:MWAI5WMHAJQQO2UK4XLRTKKPFT","target":"record","payload":{"canonical_record":{"source":{"id":"1908.03837","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.SI","submitted_at":"2019-08-11T01:30:02Z","cross_cats_sorted":["cs.FL"],"title_canon_sha256":"3b54a117184bae38fb9295e3463ed4dd896ab8b7637bc22c602f6c602399b72d","abstract_canon_sha256":"fc9bf327b1d97f43e19880d765f188d243e5ea2c0278ca2fd267b6d7383e6748"},"schema_version":"1.0"},"canonical_sha256":"65808ed9870261076a8ae5d719a94f2cd616cf822bce522176b21ddd127b3825","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:36:13.303626Z","signature_b64":"tJtYVtQxY1g1Y+2HQcP2dPPZurXF/Ft0waj6xZ8tSfvNIx8vfcwh2+nfugaXwAiQOyPGrZgo878YjfgSvvS1Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"65808ed9870261076a8ae5d719a94f2cd616cf822bce522176b21ddd127b3825","last_reissued_at":"2026-07-05T05:36:13.303222Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:36:13.303222Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1908.03837","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-07-05T05:36:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5bip60t2DZTRLJVggBntNEoGNHu0iUtRLpv0vAAsbXFMF4vTcIM4TRe4Tzz+egd0AaCGRAzEBi1fRR57eqM8DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T13:24:35.472754Z"},"content_sha256":"d0930a2270fb278c81e0e71347bb59ae9917ff45d099e77d64e0388d56bf0eec","schema_version":"1.0","event_id":"sha256:d0930a2270fb278c81e0e71347bb59ae9917ff45d099e77d64e0388d56bf0eec"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:MWAI5WMHAJQQO2UK4XLRTKKPFT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Modeling Graphs with Vertex Replacement Grammars","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.FL"],"primary_cat":"cs.SI","authors_text":"Justus Hibshman, Satyaki Sikdar, Tim Weninger","submitted_at":"2019-08-11T01:30:02Z","abstract_excerpt":"One of the principal goals of graph modeling is to capture the building blocks of network data in order to study various physical and natural phenomena. Recent work at the intersection of formal language theory and graph theory has explored the use of graph grammars for graph modeling. However, existing graph grammar formalisms, like Hyperedge Replacement Grammars, can only operate on small tree-like graphs. The present work relaxes this restriction by revising a different graph grammar formalism called Vertex Replacement Grammars (VRGs). We show that a variant of the VRG called Clustering-bas"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.03837","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1908.03837/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T05:36:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KBn190eVgtnJFyiQwGjofg247OZKqvgIEwWOqaW3kPynDT0er53Qe413PqzMLLaq4dPhwX6CSENDp2CXBhl4Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T13:24:35.473324Z"},"content_sha256":"c1ee41a4b22bcbd541672ea5b34073465b636dcd590d300cf2057464aa523af4","schema_version":"1.0","event_id":"sha256:c1ee41a4b22bcbd541672ea5b34073465b636dcd590d300cf2057464aa523af4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MWAI5WMHAJQQO2UK4XLRTKKPFT/bundle.json","state_url":"https://pith.science/pith/MWAI5WMHAJQQO2UK4XLRTKKPFT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MWAI5WMHAJQQO2UK4XLRTKKPFT/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-08-16T13:24:35Z","links":{"resolver":"https://pith.science/pith/MWAI5WMHAJQQO2UK4XLRTKKPFT","bundle":"https://pith.science/pith/MWAI5WMHAJQQO2UK4XLRTKKPFT/bundle.json","state":"https://pith.science/pith/MWAI5WMHAJQQO2UK4XLRTKKPFT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MWAI5WMHAJQQO2UK4XLRTKKPFT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:MWAI5WMHAJQQO2UK4XLRTKKPFT","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":"fc9bf327b1d97f43e19880d765f188d243e5ea2c0278ca2fd267b6d7383e6748","cross_cats_sorted":["cs.FL"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.SI","submitted_at":"2019-08-11T01:30:02Z","title_canon_sha256":"3b54a117184bae38fb9295e3463ed4dd896ab8b7637bc22c602f6c602399b72d"},"schema_version":"1.0","source":{"id":"1908.03837","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1908.03837","created_at":"2026-07-05T05:36:13Z"},{"alias_kind":"arxiv_version","alias_value":"1908.03837v2","created_at":"2026-07-05T05:36:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.03837","created_at":"2026-07-05T05:36:13Z"},{"alias_kind":"pith_short_12","alias_value":"MWAI5WMHAJQQ","created_at":"2026-07-05T05:36:13Z"},{"alias_kind":"pith_short_16","alias_value":"MWAI5WMHAJQQO2UK","created_at":"2026-07-05T05:36:13Z"},{"alias_kind":"pith_short_8","alias_value":"MWAI5WMH","created_at":"2026-07-05T05:36:13Z"}],"graph_snapshots":[{"event_id":"sha256:c1ee41a4b22bcbd541672ea5b34073465b636dcd590d300cf2057464aa523af4","target":"graph","created_at":"2026-07-05T05:36:13Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/1908.03837/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"One of the principal goals of graph modeling is to capture the building blocks of network data in order to study various physical and natural phenomena. Recent work at the intersection of formal language theory and graph theory has explored the use of graph grammars for graph modeling. However, existing graph grammar formalisms, like Hyperedge Replacement Grammars, can only operate on small tree-like graphs. The present work relaxes this restriction by revising a different graph grammar formalism called Vertex Replacement Grammars (VRGs). We show that a variant of the VRG called Clustering-bas","authors_text":"Justus Hibshman, Satyaki Sikdar, Tim Weninger","cross_cats":["cs.FL"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.SI","submitted_at":"2019-08-11T01:30:02Z","title":"Modeling Graphs with Vertex Replacement Grammars"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.03837","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:d0930a2270fb278c81e0e71347bb59ae9917ff45d099e77d64e0388d56bf0eec","target":"record","created_at":"2026-07-05T05:36:13Z","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":"fc9bf327b1d97f43e19880d765f188d243e5ea2c0278ca2fd267b6d7383e6748","cross_cats_sorted":["cs.FL"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.SI","submitted_at":"2019-08-11T01:30:02Z","title_canon_sha256":"3b54a117184bae38fb9295e3463ed4dd896ab8b7637bc22c602f6c602399b72d"},"schema_version":"1.0","source":{"id":"1908.03837","kind":"arxiv","version":2}},"canonical_sha256":"65808ed9870261076a8ae5d719a94f2cd616cf822bce522176b21ddd127b3825","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"65808ed9870261076a8ae5d719a94f2cd616cf822bce522176b21ddd127b3825","first_computed_at":"2026-07-05T05:36:13.303222Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T05:36:13.303222Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"tJtYVtQxY1g1Y+2HQcP2dPPZurXF/Ft0waj6xZ8tSfvNIx8vfcwh2+nfugaXwAiQOyPGrZgo878YjfgSvvS1Bg==","signature_status":"signed_v1","signed_at":"2026-07-05T05:36:13.303626Z","signed_message":"canonical_sha256_bytes"},"source_id":"1908.03837","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d0930a2270fb278c81e0e71347bb59ae9917ff45d099e77d64e0388d56bf0eec","sha256:c1ee41a4b22bcbd541672ea5b34073465b636dcd590d300cf2057464aa523af4"],"state_sha256":"60401f5fba9543c89eb87ef53fe6d4116714b3e71e310ef3a4f02c94adc9e50d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"c/h2yREf9UWFOPng038poF4hfiUFEYGsR36FoEKFpzsb2jT+EVMJsQQ0jvuqmoGlidIeAqDHK0B8RTw1yk+xDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-16T13:24:35.479025Z","bundle_sha256":"f72f30b4c367a1fa7f44a3c49269809bffe8a7104d4c1c29f20f9e3910087053"}}