{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:R2ZLDVFPVNE4GJQLPYLXOIPQPI","short_pith_number":"pith:R2ZLDVFP","canonical_record":{"source":{"id":"1501.06059","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2015-01-24T16:38:10Z","cross_cats_sorted":["cs.FL","math.CT"],"title_canon_sha256":"77cf7c1b0a425212cd377c1f977756d76e0779bc0ead8b671bf990390f00cb19","abstract_canon_sha256":"0d3b163aea4fea5f3881a7188e97a105737ef3bc82839f3e4174059bc1dee1da"},"schema_version":"1.0"},"canonical_sha256":"8eb2b1d4afab49c3260b7e177721f07a1b71d5f3684d201a83008d86448f1ae4","source":{"kind":"arxiv","id":"1501.06059","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1501.06059","created_at":"2026-05-18T01:20:20Z"},{"alias_kind":"arxiv_version","alias_value":"1501.06059v3","created_at":"2026-05-18T01:20:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.06059","created_at":"2026-05-18T01:20:20Z"},{"alias_kind":"pith_short_12","alias_value":"R2ZLDVFPVNE4","created_at":"2026-05-18T12:29:39Z"},{"alias_kind":"pith_short_16","alias_value":"R2ZLDVFPVNE4GJQL","created_at":"2026-05-18T12:29:39Z"},{"alias_kind":"pith_short_8","alias_value":"R2ZLDVFP","created_at":"2026-05-18T12:29:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:R2ZLDVFPVNE4GJQLPYLXOIPQPI","target":"record","payload":{"canonical_record":{"source":{"id":"1501.06059","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2015-01-24T16:38:10Z","cross_cats_sorted":["cs.FL","math.CT"],"title_canon_sha256":"77cf7c1b0a425212cd377c1f977756d76e0779bc0ead8b671bf990390f00cb19","abstract_canon_sha256":"0d3b163aea4fea5f3881a7188e97a105737ef3bc82839f3e4174059bc1dee1da"},"schema_version":"1.0"},"canonical_sha256":"8eb2b1d4afab49c3260b7e177721f07a1b71d5f3684d201a83008d86448f1ae4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:20:20.906811Z","signature_b64":"PfWqb9t7MIzqXJRiCKHJO1zTSNtmMId5BX7x3VsNEHIO/feVvfSrA7OF5DSlDNDDCNx6dP96U1u8VnI5dPZIDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8eb2b1d4afab49c3260b7e177721f07a1b71d5f3684d201a83008d86448f1ae4","last_reissued_at":"2026-05-18T01:20:20.906024Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:20:20.906024Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1501.06059","source_version":3,"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-18T01:20:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PacWx/BOIcsZ3ID+QgT1GdYey4IZuc6vPaPo8zwGXnw/s1a1lyHxNDp5h2Mgeev6Xm6jPqrOS1H14M8ontSzCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T15:48:00.052946Z"},"content_sha256":"03b87ac843dfc6185e14f31e0d4d9e3e82b8f83ae4e0951dea5a4781469ef6b3","schema_version":"1.0","event_id":"sha256:03b87ac843dfc6185e14f31e0d4d9e3e82b8f83ae4e0951dea5a4781469ef6b3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:R2ZLDVFPVNE4GJQLPYLXOIPQPI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"!-Graphs with Trivial Overlap are Context-Free","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.FL","math.CT"],"primary_cat":"cs.LO","authors_text":"Aleks Kissinger (University of Oxford), Vladimir Zamdzhiev (University of Oxford)","submitted_at":"2015-01-24T16:38:10Z","abstract_excerpt":"String diagrams are a powerful tool for reasoning about composite structures in symmetric monoidal categories. By representing string diagrams as graphs, equational reasoning can be done automatically by double-pushout rewriting. !-graphs give us the means of expressing and proving properties about whole families of these graphs simultaneously. While !-graphs provide elegant proofs of surprisingly powerful theorems, little is known about the formal properties of the graph languages they define. This paper takes the first step in characterising these languages by showing that an important subcl"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.06059","kind":"arxiv","version":3},"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-18T01:20:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EY+BaVsE4psuLZs8ekhGSBaRr9rh9JPVfF8OwOzzty76XdNE/uEGrEx5taHevBE3PzDhOGsbETpNYmo0/Ov3AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T15:48:00.053295Z"},"content_sha256":"015cfc54592b37a90acd8e9ce5d40d0c1b25934fa817b21530a0821288708043","schema_version":"1.0","event_id":"sha256:015cfc54592b37a90acd8e9ce5d40d0c1b25934fa817b21530a0821288708043"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/R2ZLDVFPVNE4GJQLPYLXOIPQPI/bundle.json","state_url":"https://pith.science/pith/R2ZLDVFPVNE4GJQLPYLXOIPQPI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/R2ZLDVFPVNE4GJQLPYLXOIPQPI/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-03T15:48:00Z","links":{"resolver":"https://pith.science/pith/R2ZLDVFPVNE4GJQLPYLXOIPQPI","bundle":"https://pith.science/pith/R2ZLDVFPVNE4GJQLPYLXOIPQPI/bundle.json","state":"https://pith.science/pith/R2ZLDVFPVNE4GJQLPYLXOIPQPI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/R2ZLDVFPVNE4GJQLPYLXOIPQPI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:R2ZLDVFPVNE4GJQLPYLXOIPQPI","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":"0d3b163aea4fea5f3881a7188e97a105737ef3bc82839f3e4174059bc1dee1da","cross_cats_sorted":["cs.FL","math.CT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2015-01-24T16:38:10Z","title_canon_sha256":"77cf7c1b0a425212cd377c1f977756d76e0779bc0ead8b671bf990390f00cb19"},"schema_version":"1.0","source":{"id":"1501.06059","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1501.06059","created_at":"2026-05-18T01:20:20Z"},{"alias_kind":"arxiv_version","alias_value":"1501.06059v3","created_at":"2026-05-18T01:20:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.06059","created_at":"2026-05-18T01:20:20Z"},{"alias_kind":"pith_short_12","alias_value":"R2ZLDVFPVNE4","created_at":"2026-05-18T12:29:39Z"},{"alias_kind":"pith_short_16","alias_value":"R2ZLDVFPVNE4GJQL","created_at":"2026-05-18T12:29:39Z"},{"alias_kind":"pith_short_8","alias_value":"R2ZLDVFP","created_at":"2026-05-18T12:29:39Z"}],"graph_snapshots":[{"event_id":"sha256:015cfc54592b37a90acd8e9ce5d40d0c1b25934fa817b21530a0821288708043","target":"graph","created_at":"2026-05-18T01:20:20Z","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":"String diagrams are a powerful tool for reasoning about composite structures in symmetric monoidal categories. By representing string diagrams as graphs, equational reasoning can be done automatically by double-pushout rewriting. !-graphs give us the means of expressing and proving properties about whole families of these graphs simultaneously. While !-graphs provide elegant proofs of surprisingly powerful theorems, little is known about the formal properties of the graph languages they define. This paper takes the first step in characterising these languages by showing that an important subcl","authors_text":"Aleks Kissinger (University of Oxford), Vladimir Zamdzhiev (University of Oxford)","cross_cats":["cs.FL","math.CT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2015-01-24T16:38:10Z","title":"!-Graphs with Trivial Overlap are Context-Free"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.06059","kind":"arxiv","version":3},"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:03b87ac843dfc6185e14f31e0d4d9e3e82b8f83ae4e0951dea5a4781469ef6b3","target":"record","created_at":"2026-05-18T01:20:20Z","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":"0d3b163aea4fea5f3881a7188e97a105737ef3bc82839f3e4174059bc1dee1da","cross_cats_sorted":["cs.FL","math.CT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2015-01-24T16:38:10Z","title_canon_sha256":"77cf7c1b0a425212cd377c1f977756d76e0779bc0ead8b671bf990390f00cb19"},"schema_version":"1.0","source":{"id":"1501.06059","kind":"arxiv","version":3}},"canonical_sha256":"8eb2b1d4afab49c3260b7e177721f07a1b71d5f3684d201a83008d86448f1ae4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8eb2b1d4afab49c3260b7e177721f07a1b71d5f3684d201a83008d86448f1ae4","first_computed_at":"2026-05-18T01:20:20.906024Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:20:20.906024Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"PfWqb9t7MIzqXJRiCKHJO1zTSNtmMId5BX7x3VsNEHIO/feVvfSrA7OF5DSlDNDDCNx6dP96U1u8VnI5dPZIDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:20:20.906811Z","signed_message":"canonical_sha256_bytes"},"source_id":"1501.06059","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:03b87ac843dfc6185e14f31e0d4d9e3e82b8f83ae4e0951dea5a4781469ef6b3","sha256:015cfc54592b37a90acd8e9ce5d40d0c1b25934fa817b21530a0821288708043"],"state_sha256":"dd92df36521e701112fef4cc51a624d1e41aa8ab29fc9698736e71d72dfea311"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zxL+TBbatzz+rhJIShlsZGXTw8yr0a78SX1Cijc2THhSl12FXIRc6LarwplCsJqr7nVGzDcyQ8KBck311A2wCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T15:48:00.055285Z","bundle_sha256":"1f117d8efbc50c6fa90fe5178fdb340cea7f276a8fcd5245642bbf9e87406fe8"}}