{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2009:YCWEQMIJZKRYK5CAZ6VRXVUBSH","short_pith_number":"pith:YCWEQMIJ","canonical_record":{"source":{"id":"0901.4876","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2009-01-30T12:44:29Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"39e7523659c6fd9fd8349377a5a04f83dfc432d46e2082e558eac3eb32c43450","abstract_canon_sha256":"3efd80a57edcdf130df5ce6ae45a1f62872024a1c7fd877faaec065bcacca511"},"schema_version":"1.0"},"canonical_sha256":"c0ac483109caa3857440cfab1bd68191ee364d0e88ac2b1216d2a88915774eca","source":{"kind":"arxiv","id":"0901.4876","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0901.4876","created_at":"2026-07-04T15:37:08Z"},{"alias_kind":"arxiv_version","alias_value":"0901.4876v1","created_at":"2026-07-04T15:37:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0901.4876","created_at":"2026-07-04T15:37:08Z"},{"alias_kind":"pith_short_12","alias_value":"YCWEQMIJZKRY","created_at":"2026-07-04T15:37:08Z"},{"alias_kind":"pith_short_16","alias_value":"YCWEQMIJZKRYK5CA","created_at":"2026-07-04T15:37:08Z"},{"alias_kind":"pith_short_8","alias_value":"YCWEQMIJ","created_at":"2026-07-04T15:37:08Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2009:YCWEQMIJZKRYK5CAZ6VRXVUBSH","target":"record","payload":{"canonical_record":{"source":{"id":"0901.4876","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2009-01-30T12:44:29Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"39e7523659c6fd9fd8349377a5a04f83dfc432d46e2082e558eac3eb32c43450","abstract_canon_sha256":"3efd80a57edcdf130df5ce6ae45a1f62872024a1c7fd877faaec065bcacca511"},"schema_version":"1.0"},"canonical_sha256":"c0ac483109caa3857440cfab1bd68191ee364d0e88ac2b1216d2a88915774eca","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T15:37:08.579218Z","signature_b64":"xNnnKk1u2G0DdLTdhL7mqb11CMZslF6bz5oICGSgFiNomKhKFgzD+wqEcBIytnIUAbf9/J/jzOeolyMRPCp0Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c0ac483109caa3857440cfab1bd68191ee364d0e88ac2b1216d2a88915774eca","last_reissued_at":"2026-07-04T15:37:08.578704Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T15:37:08.578704Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"0901.4876","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-07-04T15:37:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"L77VxfaSinYcNwUu0Nj0D+Yyw7fmFwhJnEFAXPlF4YdSkY38w4V9GaPdUG9iNM4iUsgeh81O2NYVDQHgYXl8DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-12T10:22:29.503759Z"},"content_sha256":"022e0a6607d15cb62f5e603a85ddd004b72712173010c48bf266afb09f2bbe32","schema_version":"1.0","event_id":"sha256:022e0a6607d15cb62f5e603a85ddd004b72712173010c48bf266afb09f2bbe32"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2009:YCWEQMIJZKRYK5CAZ6VRXVUBSH","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Non-Confluent NLC Graph Grammar Inference by Compressing Disjoint Subgraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.LG","authors_text":"Hendrik Blockeel, Robert Brijder","submitted_at":"2009-01-30T12:44:29Z","abstract_excerpt":"Grammar inference deals with determining (preferable simple) models/grammars consistent with a set of observations. There is a large body of research on grammar inference within the theory of formal languages. However, there is surprisingly little known on grammar inference for graph grammars. In this paper we take a further step in this direction and work within the framework of node label controlled (NLC) graph grammars. Specifically, we characterize, given a set of disjoint and isomorphic subgraphs of a graph $G$, whether or not there is a NLC graph grammar rule which can generate these sub"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0901.4876","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/0901.4876/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-04T15:37:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FczNiAf1eVt8Zf0RQt2dBjoip5woUT5HB5TVXJ0He2xP2U1EwBzEiidfW4U0kO/b5MT43QKKRJckW+8o+JxGCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-12T10:22:29.507936Z"},"content_sha256":"cd2768ecad0c694a56fdd8c120a67b163843742614da90e1f5f832dd984bbef6","schema_version":"1.0","event_id":"sha256:cd2768ecad0c694a56fdd8c120a67b163843742614da90e1f5f832dd984bbef6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YCWEQMIJZKRYK5CAZ6VRXVUBSH/bundle.json","state_url":"https://pith.science/pith/YCWEQMIJZKRYK5CAZ6VRXVUBSH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YCWEQMIJZKRYK5CAZ6VRXVUBSH/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-12T10:22:29Z","links":{"resolver":"https://pith.science/pith/YCWEQMIJZKRYK5CAZ6VRXVUBSH","bundle":"https://pith.science/pith/YCWEQMIJZKRYK5CAZ6VRXVUBSH/bundle.json","state":"https://pith.science/pith/YCWEQMIJZKRYK5CAZ6VRXVUBSH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YCWEQMIJZKRYK5CAZ6VRXVUBSH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2009:YCWEQMIJZKRYK5CAZ6VRXVUBSH","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":"3efd80a57edcdf130df5ce6ae45a1f62872024a1c7fd877faaec065bcacca511","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2009-01-30T12:44:29Z","title_canon_sha256":"39e7523659c6fd9fd8349377a5a04f83dfc432d46e2082e558eac3eb32c43450"},"schema_version":"1.0","source":{"id":"0901.4876","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0901.4876","created_at":"2026-07-04T15:37:08Z"},{"alias_kind":"arxiv_version","alias_value":"0901.4876v1","created_at":"2026-07-04T15:37:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0901.4876","created_at":"2026-07-04T15:37:08Z"},{"alias_kind":"pith_short_12","alias_value":"YCWEQMIJZKRY","created_at":"2026-07-04T15:37:08Z"},{"alias_kind":"pith_short_16","alias_value":"YCWEQMIJZKRYK5CA","created_at":"2026-07-04T15:37:08Z"},{"alias_kind":"pith_short_8","alias_value":"YCWEQMIJ","created_at":"2026-07-04T15:37:08Z"}],"graph_snapshots":[{"event_id":"sha256:cd2768ecad0c694a56fdd8c120a67b163843742614da90e1f5f832dd984bbef6","target":"graph","created_at":"2026-07-04T15:37:08Z","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/0901.4876/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Grammar inference deals with determining (preferable simple) models/grammars consistent with a set of observations. There is a large body of research on grammar inference within the theory of formal languages. However, there is surprisingly little known on grammar inference for graph grammars. In this paper we take a further step in this direction and work within the framework of node label controlled (NLC) graph grammars. Specifically, we characterize, given a set of disjoint and isomorphic subgraphs of a graph $G$, whether or not there is a NLC graph grammar rule which can generate these sub","authors_text":"Hendrik Blockeel, Robert Brijder","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2009-01-30T12:44:29Z","title":"Non-Confluent NLC Graph Grammar Inference by Compressing Disjoint Subgraphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0901.4876","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:022e0a6607d15cb62f5e603a85ddd004b72712173010c48bf266afb09f2bbe32","target":"record","created_at":"2026-07-04T15:37:08Z","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":"3efd80a57edcdf130df5ce6ae45a1f62872024a1c7fd877faaec065bcacca511","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2009-01-30T12:44:29Z","title_canon_sha256":"39e7523659c6fd9fd8349377a5a04f83dfc432d46e2082e558eac3eb32c43450"},"schema_version":"1.0","source":{"id":"0901.4876","kind":"arxiv","version":1}},"canonical_sha256":"c0ac483109caa3857440cfab1bd68191ee364d0e88ac2b1216d2a88915774eca","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c0ac483109caa3857440cfab1bd68191ee364d0e88ac2b1216d2a88915774eca","first_computed_at":"2026-07-04T15:37:08.578704Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-04T15:37:08.578704Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"xNnnKk1u2G0DdLTdhL7mqb11CMZslF6bz5oICGSgFiNomKhKFgzD+wqEcBIytnIUAbf9/J/jzOeolyMRPCp0Aw==","signature_status":"signed_v1","signed_at":"2026-07-04T15:37:08.579218Z","signed_message":"canonical_sha256_bytes"},"source_id":"0901.4876","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:022e0a6607d15cb62f5e603a85ddd004b72712173010c48bf266afb09f2bbe32","sha256:cd2768ecad0c694a56fdd8c120a67b163843742614da90e1f5f832dd984bbef6"],"state_sha256":"674ae4a7b4fb47d9bc8a806f551e2074d37d435864de80bdf3811d76d14d5b59"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/0ceI5Sm+p8C++/t2o0UisEFtX9tl6BS1cdQ65Lv0rw/cihMMbmwse7yFuQ9NA+9hIM+R4VR+CeBo4FwtOuDCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-12T10:22:29.518289Z","bundle_sha256":"541ca913440fc0ea1ed4a1a9e56978c33f14f5488e83bc0418c17aac021777cb"}}