{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2021:IV2VW2UBMB6YO6FHZXWULFRBHC","short_pith_number":"pith:IV2VW2UB","canonical_record":{"source":{"id":"2107.13953","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LO","submitted_at":"2021-07-29T13:28:46Z","cross_cats_sorted":[],"title_canon_sha256":"5c606b7108a14f27190201d5ba599f65ad961b54adeddc818721ad0ae3b27873","abstract_canon_sha256":"66484d4d9a7887ee4b2062e4601afdf262d6fc6ffd9147f383a8205b6b625e0b"},"schema_version":"1.0"},"canonical_sha256":"45755b6a81607d8778a7cded459621389880d25b608d01262aacdaf6648f140c","source":{"kind":"arxiv","id":"2107.13953","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2107.13953","created_at":"2026-07-05T03:10:54Z"},{"alias_kind":"arxiv_version","alias_value":"2107.13953v2","created_at":"2026-07-05T03:10:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2107.13953","created_at":"2026-07-05T03:10:54Z"},{"alias_kind":"pith_short_12","alias_value":"IV2VW2UBMB6Y","created_at":"2026-07-05T03:10:54Z"},{"alias_kind":"pith_short_16","alias_value":"IV2VW2UBMB6YO6FH","created_at":"2026-07-05T03:10:54Z"},{"alias_kind":"pith_short_8","alias_value":"IV2VW2UB","created_at":"2026-07-05T03:10:54Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2021:IV2VW2UBMB6YO6FHZXWULFRBHC","target":"record","payload":{"canonical_record":{"source":{"id":"2107.13953","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LO","submitted_at":"2021-07-29T13:28:46Z","cross_cats_sorted":[],"title_canon_sha256":"5c606b7108a14f27190201d5ba599f65ad961b54adeddc818721ad0ae3b27873","abstract_canon_sha256":"66484d4d9a7887ee4b2062e4601afdf262d6fc6ffd9147f383a8205b6b625e0b"},"schema_version":"1.0"},"canonical_sha256":"45755b6a81607d8778a7cded459621389880d25b608d01262aacdaf6648f140c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:10:54.692550Z","signature_b64":"4sIr8LYTxhDXaGKSoaV9NqtkfCoN9Q8t4UKK9m2G7lmVVXpF3zdE9pk9FXHEhWXSrJsa0082pmo/0NUSfsb9BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"45755b6a81607d8778a7cded459621389880d25b608d01262aacdaf6648f140c","last_reissued_at":"2026-07-05T03:10:54.692024Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:10:54.692024Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2107.13953","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-05T03:10:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EDkvcj+Hhrm2WVSltX+jybd5SUcXeL/bkAv5oLrmRnD6ojEMGaRhh7+MbA7GF86mebrcEBpm0WH4h/9QefStDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-09T19:21:27.467850Z"},"content_sha256":"eab5590648a1ed83bb3f6916e28f52a8b164f8574de5e5c5ef34e1542558d40d","schema_version":"1.0","event_id":"sha256:eab5590648a1ed83bb3f6916e28f52a8b164f8574de5e5c5ef34e1542558d40d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2021:IV2VW2UBMB6YO6FHZXWULFRBHC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Separator logic and star-free expressions for graphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Mikolaj Bojanczyk","submitted_at":"2021-07-29T13:28:46Z","abstract_excerpt":"We describe two formalisms for defining graph languages, and prove that they are equivalent:\n  1. Separator logic. This is first-order logic on graphs which is allowed to use the edge relation, and for every $n \\in \\{0,1,\\ldots \\}$ a relation of arity $n+2$ which says that \"vertex $s$ can be connected to vertex $t$ by a path that avoids vertices $v_1,\\ldots,v_n$\".\n  2. Star-free graph expressions. These are expressions that describe graphs with distinguished vertices called ports, and which are built from finite languages via Boolean combinations and the operations on graphs with ports used to"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2107.13953","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/2107.13953/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-05T03:10:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Cz6FhytpCDav0gK6NB5Pq37syg/KRXyKWdk7ka/1NIpzHFOY4rnO1vAIXtpy62Bebq8RuSbYM64MT8OcXuH9Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-09T19:21:27.468353Z"},"content_sha256":"e4fc089874b03b39dd4856bccaf43d8764cb4fd59d98b45863ecd6c51f8f73a9","schema_version":"1.0","event_id":"sha256:e4fc089874b03b39dd4856bccaf43d8764cb4fd59d98b45863ecd6c51f8f73a9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IV2VW2UBMB6YO6FHZXWULFRBHC/bundle.json","state_url":"https://pith.science/pith/IV2VW2UBMB6YO6FHZXWULFRBHC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IV2VW2UBMB6YO6FHZXWULFRBHC/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-09T19:21:27Z","links":{"resolver":"https://pith.science/pith/IV2VW2UBMB6YO6FHZXWULFRBHC","bundle":"https://pith.science/pith/IV2VW2UBMB6YO6FHZXWULFRBHC/bundle.json","state":"https://pith.science/pith/IV2VW2UBMB6YO6FHZXWULFRBHC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IV2VW2UBMB6YO6FHZXWULFRBHC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:IV2VW2UBMB6YO6FHZXWULFRBHC","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":"66484d4d9a7887ee4b2062e4601afdf262d6fc6ffd9147f383a8205b6b625e0b","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LO","submitted_at":"2021-07-29T13:28:46Z","title_canon_sha256":"5c606b7108a14f27190201d5ba599f65ad961b54adeddc818721ad0ae3b27873"},"schema_version":"1.0","source":{"id":"2107.13953","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2107.13953","created_at":"2026-07-05T03:10:54Z"},{"alias_kind":"arxiv_version","alias_value":"2107.13953v2","created_at":"2026-07-05T03:10:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2107.13953","created_at":"2026-07-05T03:10:54Z"},{"alias_kind":"pith_short_12","alias_value":"IV2VW2UBMB6Y","created_at":"2026-07-05T03:10:54Z"},{"alias_kind":"pith_short_16","alias_value":"IV2VW2UBMB6YO6FH","created_at":"2026-07-05T03:10:54Z"},{"alias_kind":"pith_short_8","alias_value":"IV2VW2UB","created_at":"2026-07-05T03:10:54Z"}],"graph_snapshots":[{"event_id":"sha256:e4fc089874b03b39dd4856bccaf43d8764cb4fd59d98b45863ecd6c51f8f73a9","target":"graph","created_at":"2026-07-05T03:10:54Z","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/2107.13953/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We describe two formalisms for defining graph languages, and prove that they are equivalent:\n  1. Separator logic. This is first-order logic on graphs which is allowed to use the edge relation, and for every $n \\in \\{0,1,\\ldots \\}$ a relation of arity $n+2$ which says that \"vertex $s$ can be connected to vertex $t$ by a path that avoids vertices $v_1,\\ldots,v_n$\".\n  2. Star-free graph expressions. These are expressions that describe graphs with distinguished vertices called ports, and which are built from finite languages via Boolean combinations and the operations on graphs with ports used to","authors_text":"Mikolaj Bojanczyk","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LO","submitted_at":"2021-07-29T13:28:46Z","title":"Separator logic and star-free expressions for graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2107.13953","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:eab5590648a1ed83bb3f6916e28f52a8b164f8574de5e5c5ef34e1542558d40d","target":"record","created_at":"2026-07-05T03:10:54Z","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":"66484d4d9a7887ee4b2062e4601afdf262d6fc6ffd9147f383a8205b6b625e0b","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LO","submitted_at":"2021-07-29T13:28:46Z","title_canon_sha256":"5c606b7108a14f27190201d5ba599f65ad961b54adeddc818721ad0ae3b27873"},"schema_version":"1.0","source":{"id":"2107.13953","kind":"arxiv","version":2}},"canonical_sha256":"45755b6a81607d8778a7cded459621389880d25b608d01262aacdaf6648f140c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"45755b6a81607d8778a7cded459621389880d25b608d01262aacdaf6648f140c","first_computed_at":"2026-07-05T03:10:54.692024Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T03:10:54.692024Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"4sIr8LYTxhDXaGKSoaV9NqtkfCoN9Q8t4UKK9m2G7lmVVXpF3zdE9pk9FXHEhWXSrJsa0082pmo/0NUSfsb9BA==","signature_status":"signed_v1","signed_at":"2026-07-05T03:10:54.692550Z","signed_message":"canonical_sha256_bytes"},"source_id":"2107.13953","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:eab5590648a1ed83bb3f6916e28f52a8b164f8574de5e5c5ef34e1542558d40d","sha256:e4fc089874b03b39dd4856bccaf43d8764cb4fd59d98b45863ecd6c51f8f73a9"],"state_sha256":"41db9c458325d0958a0083f01a4e86478311f54631b8252e606d021fdd39363b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6he9dkJaYSvrNhy44aGOfDfNSQLOMjJpOeFa/+8BrXXJNJxIZrEb+FSTUAlHu4sl0On0xvgZbdF0YtkKC7SeBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-09T19:21:27.473669Z","bundle_sha256":"b6de4aed3a517cf7a2a75690ffc9e2222dab61376c014448fc85db2a78aecf8b"}}