{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:Q66EQVRK6XAOSMVNT3OCZP6SA6","short_pith_number":"pith:Q66EQVRK","canonical_record":{"source":{"id":"1704.05263","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2017-04-18T10:35:46Z","cross_cats_sorted":["cs.LO"],"title_canon_sha256":"97fadb8d70dafb0a24948558fb80971d3bb35776f70a997156aa13b335e15a67","abstract_canon_sha256":"c011edc20693a35d9b54605e0ae5c1e34fba935906972fcb8518356f5abf0e38"},"schema_version":"1.0"},"canonical_sha256":"87bc48562af5c0e932ad9edc2cbfd2079f870a02aa0f10e08316b2baa780b28f","source":{"kind":"arxiv","id":"1704.05263","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1704.05263","created_at":"2026-05-18T00:46:00Z"},{"alias_kind":"arxiv_version","alias_value":"1704.05263v2","created_at":"2026-05-18T00:46:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.05263","created_at":"2026-05-18T00:46:00Z"},{"alias_kind":"pith_short_12","alias_value":"Q66EQVRK6XAO","created_at":"2026-05-18T12:31:37Z"},{"alias_kind":"pith_short_16","alias_value":"Q66EQVRK6XAOSMVN","created_at":"2026-05-18T12:31:37Z"},{"alias_kind":"pith_short_8","alias_value":"Q66EQVRK","created_at":"2026-05-18T12:31:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:Q66EQVRK6XAOSMVNT3OCZP6SA6","target":"record","payload":{"canonical_record":{"source":{"id":"1704.05263","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2017-04-18T10:35:46Z","cross_cats_sorted":["cs.LO"],"title_canon_sha256":"97fadb8d70dafb0a24948558fb80971d3bb35776f70a997156aa13b335e15a67","abstract_canon_sha256":"c011edc20693a35d9b54605e0ae5c1e34fba935906972fcb8518356f5abf0e38"},"schema_version":"1.0"},"canonical_sha256":"87bc48562af5c0e932ad9edc2cbfd2079f870a02aa0f10e08316b2baa780b28f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:46:00.134058Z","signature_b64":"F4g/McNL54/g1fIXq3CJ/x0x0DJr+jViAM52tPccD5o3QkR0KztiQz6dWdw9pQXmoeusehWAOa+dY75RkYxNBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"87bc48562af5c0e932ad9edc2cbfd2079f870a02aa0f10e08316b2baa780b28f","last_reissued_at":"2026-05-18T00:46:00.133283Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:46:00.133283Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1704.05263","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-05-18T00:46:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"v/SDx9MhcAKYH3HWgwo8pwlLNGp0pB9aMew5hi/8ou3PC5rmjsnyW/io/M4Wp9Ey2zer87fIbtJSRUunp4MkDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T06:16:12.765798Z"},"content_sha256":"917d72f2507b839d6232b13a5d8cb5184144679986ff242545a2affc4704ce13","schema_version":"1.0","event_id":"sha256:917d72f2507b839d6232b13a5d8cb5184144679986ff242545a2affc4704ce13"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:Q66EQVRK6XAOSMVNT3OCZP6SA6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Specifying Graph Languages with Type Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LO"],"primary_cat":"cs.FL","authors_text":"Andrea Corradini, Barbara K\\\"onig, Dennis Nolte","submitted_at":"2017-04-18T10:35:46Z","abstract_excerpt":"We investigate three formalisms to specify graph languages, i.e. sets of graphs, based on type graphs. First, we are interested in (pure) type graphs, where the corresponding language consists of all graphs that can be mapped homomorphically to a given type graph. In this context, we also study languages specified by restriction graphs and their relation to type graphs. Second, we extend this basic approach to a type graph logic and, third, to type graphs with annotations. We present decidability results and closure properties for each of the formalisms."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.05263","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":""},"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-18T00:46:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9/YNF5fen/l42eXCaeEJSdhzgW6ubrRIvwu0cRDF0kwmOns+bGqiZen4adqIAUIWa3ykrFwZqRGs9zPHJLmyBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T06:16:12.766577Z"},"content_sha256":"172486e21c07c0131f95d95a0be51fca551ce01c5dc072c459c685483e08f788","schema_version":"1.0","event_id":"sha256:172486e21c07c0131f95d95a0be51fca551ce01c5dc072c459c685483e08f788"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/Q66EQVRK6XAOSMVNT3OCZP6SA6/bundle.json","state_url":"https://pith.science/pith/Q66EQVRK6XAOSMVNT3OCZP6SA6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/Q66EQVRK6XAOSMVNT3OCZP6SA6/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-06-11T06:16:12Z","links":{"resolver":"https://pith.science/pith/Q66EQVRK6XAOSMVNT3OCZP6SA6","bundle":"https://pith.science/pith/Q66EQVRK6XAOSMVNT3OCZP6SA6/bundle.json","state":"https://pith.science/pith/Q66EQVRK6XAOSMVNT3OCZP6SA6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/Q66EQVRK6XAOSMVNT3OCZP6SA6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:Q66EQVRK6XAOSMVNT3OCZP6SA6","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":"c011edc20693a35d9b54605e0ae5c1e34fba935906972fcb8518356f5abf0e38","cross_cats_sorted":["cs.LO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2017-04-18T10:35:46Z","title_canon_sha256":"97fadb8d70dafb0a24948558fb80971d3bb35776f70a997156aa13b335e15a67"},"schema_version":"1.0","source":{"id":"1704.05263","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1704.05263","created_at":"2026-05-18T00:46:00Z"},{"alias_kind":"arxiv_version","alias_value":"1704.05263v2","created_at":"2026-05-18T00:46:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.05263","created_at":"2026-05-18T00:46:00Z"},{"alias_kind":"pith_short_12","alias_value":"Q66EQVRK6XAO","created_at":"2026-05-18T12:31:37Z"},{"alias_kind":"pith_short_16","alias_value":"Q66EQVRK6XAOSMVN","created_at":"2026-05-18T12:31:37Z"},{"alias_kind":"pith_short_8","alias_value":"Q66EQVRK","created_at":"2026-05-18T12:31:37Z"}],"graph_snapshots":[{"event_id":"sha256:172486e21c07c0131f95d95a0be51fca551ce01c5dc072c459c685483e08f788","target":"graph","created_at":"2026-05-18T00:46:00Z","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":"We investigate three formalisms to specify graph languages, i.e. sets of graphs, based on type graphs. First, we are interested in (pure) type graphs, where the corresponding language consists of all graphs that can be mapped homomorphically to a given type graph. In this context, we also study languages specified by restriction graphs and their relation to type graphs. Second, we extend this basic approach to a type graph logic and, third, to type graphs with annotations. We present decidability results and closure properties for each of the formalisms.","authors_text":"Andrea Corradini, Barbara K\\\"onig, Dennis Nolte","cross_cats":["cs.LO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2017-04-18T10:35:46Z","title":"Specifying Graph Languages with Type Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.05263","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:917d72f2507b839d6232b13a5d8cb5184144679986ff242545a2affc4704ce13","target":"record","created_at":"2026-05-18T00:46:00Z","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":"c011edc20693a35d9b54605e0ae5c1e34fba935906972fcb8518356f5abf0e38","cross_cats_sorted":["cs.LO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2017-04-18T10:35:46Z","title_canon_sha256":"97fadb8d70dafb0a24948558fb80971d3bb35776f70a997156aa13b335e15a67"},"schema_version":"1.0","source":{"id":"1704.05263","kind":"arxiv","version":2}},"canonical_sha256":"87bc48562af5c0e932ad9edc2cbfd2079f870a02aa0f10e08316b2baa780b28f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"87bc48562af5c0e932ad9edc2cbfd2079f870a02aa0f10e08316b2baa780b28f","first_computed_at":"2026-05-18T00:46:00.133283Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:46:00.133283Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"F4g/McNL54/g1fIXq3CJ/x0x0DJr+jViAM52tPccD5o3QkR0KztiQz6dWdw9pQXmoeusehWAOa+dY75RkYxNBg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:46:00.134058Z","signed_message":"canonical_sha256_bytes"},"source_id":"1704.05263","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:917d72f2507b839d6232b13a5d8cb5184144679986ff242545a2affc4704ce13","sha256:172486e21c07c0131f95d95a0be51fca551ce01c5dc072c459c685483e08f788"],"state_sha256":"7db065009311e0fc84bc95668838a1420683c8763f9428e6935b645d1c19a859"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VoPqGKmFko7g79bCraH8NNskDvbcPHblQsmKq9zF8cv3gS7RRpo7EkWKf2j0JhlnWqNSlu6uzjMy3NZL4XlQCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T06:16:12.769618Z","bundle_sha256":"a02426c3f0ce88d68e09a9b859eab34a4a111efc08982eaea9397151d79ad710"}}