{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:HO3HRBBZPA6J3BX4NTJXSCWK2Y","short_pith_number":"pith:HO3HRBBZ","canonical_record":{"source":{"id":"2202.13335","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2022-02-27T10:25:59Z","cross_cats_sorted":["cs.LO"],"title_canon_sha256":"1531c878bf1c2fee3f358ea982a83b620991a6724ec132a3bb60417101e15ded","abstract_canon_sha256":"66b2d0c56448e39658682890d7d7b6dfd79905e6b4a5442d03b89b80155635f7"},"schema_version":"1.0"},"canonical_sha256":"3bb6788439783c9d86fc6cd3790acad623c20033a43c55f223177e9f2e34afae","source":{"kind":"arxiv","id":"2202.13335","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2202.13335","created_at":"2026-07-05T05:23:29Z"},{"alias_kind":"arxiv_version","alias_value":"2202.13335v2","created_at":"2026-07-05T05:23:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2202.13335","created_at":"2026-07-05T05:23:29Z"},{"alias_kind":"pith_short_12","alias_value":"HO3HRBBZPA6J","created_at":"2026-07-05T05:23:29Z"},{"alias_kind":"pith_short_16","alias_value":"HO3HRBBZPA6J3BX4","created_at":"2026-07-05T05:23:29Z"},{"alias_kind":"pith_short_8","alias_value":"HO3HRBBZ","created_at":"2026-07-05T05:23:29Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:HO3HRBBZPA6J3BX4NTJXSCWK2Y","target":"record","payload":{"canonical_record":{"source":{"id":"2202.13335","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2022-02-27T10:25:59Z","cross_cats_sorted":["cs.LO"],"title_canon_sha256":"1531c878bf1c2fee3f358ea982a83b620991a6724ec132a3bb60417101e15ded","abstract_canon_sha256":"66b2d0c56448e39658682890d7d7b6dfd79905e6b4a5442d03b89b80155635f7"},"schema_version":"1.0"},"canonical_sha256":"3bb6788439783c9d86fc6cd3790acad623c20033a43c55f223177e9f2e34afae","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:23:29.828122Z","signature_b64":"NEXEpWSGv1Cu8i9hHNRdREEMkmJc59id4eWm5aleTwHuFAJI2yjFXFKWemvVv5iL9Yn6XRmDvnaqrmLbQH2rDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3bb6788439783c9d86fc6cd3790acad623c20033a43c55f223177e9f2e34afae","last_reissued_at":"2026-07-05T05:23:29.827694Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:23:29.827694Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2202.13335","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:23:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tHXg1aoI5xrxBbDcwWsoN1adb6m4KvSJ92jLtx73T3+PtNSM/bBjMyKONMHrKDJgNkGNSSGfIUo1SSyjKu6jBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-01T09:59:25.136515Z"},"content_sha256":"59fc26fefee191bef233564c7d6337a1e2716fbdddd019c5ac15cdfe24bcc45c","schema_version":"1.0","event_id":"sha256:59fc26fefee191bef233564c7d6337a1e2716fbdddd019c5ac15cdfe24bcc45c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:HO3HRBBZPA6J3BX4NTJXSCWK2Y","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A logic-based algorithmic meta-theorem for mim-width","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LO"],"primary_cat":"cs.DS","authors_text":"Benjamin Bergougnoux, Jan Dreier, Lars Jaffke","submitted_at":"2022-02-27T10:25:59Z","abstract_excerpt":"We introduce a logic called distance neighborhood logic with acyclicity and connectivity constraints ($\\mathsf{A\\&C~DN}$ for short) which extends existential $\\mathsf{MSO_1}$ with predicates for querying neighborhoods of vertex sets and for verifying connectivity and acyclicity of vertex sets in various powers of a graph. Building upon [Bergougnoux and Kant\\'e, ESA 2019; SIDMA 2021], we show that the model checking problem for every fixed $\\mathsf{A\\&C~DN}$ formula is solvable in $n^{O(w)}$ time when the input graph is given together with a branch decomposition of mim-width $w$. Nearly all pro"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2202.13335","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/2202.13335/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:23:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6RVBGy8Rdim5ASLAnKwaJWn3i0jJ9xWZTmnLev1LWM+vMfg1bgaGywUNja85uy/+E8KCObdMNozr7jNxLc02Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-01T09:59:25.137027Z"},"content_sha256":"b2ada288215e9620e7e48fed9213e4c29c8d51dc5e94165e5ca82b08463eb09d","schema_version":"1.0","event_id":"sha256:b2ada288215e9620e7e48fed9213e4c29c8d51dc5e94165e5ca82b08463eb09d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HO3HRBBZPA6J3BX4NTJXSCWK2Y/bundle.json","state_url":"https://pith.science/pith/HO3HRBBZPA6J3BX4NTJXSCWK2Y/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HO3HRBBZPA6J3BX4NTJXSCWK2Y/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-01T09:59:25Z","links":{"resolver":"https://pith.science/pith/HO3HRBBZPA6J3BX4NTJXSCWK2Y","bundle":"https://pith.science/pith/HO3HRBBZPA6J3BX4NTJXSCWK2Y/bundle.json","state":"https://pith.science/pith/HO3HRBBZPA6J3BX4NTJXSCWK2Y/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HO3HRBBZPA6J3BX4NTJXSCWK2Y/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:HO3HRBBZPA6J3BX4NTJXSCWK2Y","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":"66b2d0c56448e39658682890d7d7b6dfd79905e6b4a5442d03b89b80155635f7","cross_cats_sorted":["cs.LO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2022-02-27T10:25:59Z","title_canon_sha256":"1531c878bf1c2fee3f358ea982a83b620991a6724ec132a3bb60417101e15ded"},"schema_version":"1.0","source":{"id":"2202.13335","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2202.13335","created_at":"2026-07-05T05:23:29Z"},{"alias_kind":"arxiv_version","alias_value":"2202.13335v2","created_at":"2026-07-05T05:23:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2202.13335","created_at":"2026-07-05T05:23:29Z"},{"alias_kind":"pith_short_12","alias_value":"HO3HRBBZPA6J","created_at":"2026-07-05T05:23:29Z"},{"alias_kind":"pith_short_16","alias_value":"HO3HRBBZPA6J3BX4","created_at":"2026-07-05T05:23:29Z"},{"alias_kind":"pith_short_8","alias_value":"HO3HRBBZ","created_at":"2026-07-05T05:23:29Z"}],"graph_snapshots":[{"event_id":"sha256:b2ada288215e9620e7e48fed9213e4c29c8d51dc5e94165e5ca82b08463eb09d","target":"graph","created_at":"2026-07-05T05:23:29Z","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/2202.13335/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We introduce a logic called distance neighborhood logic with acyclicity and connectivity constraints ($\\mathsf{A\\&C~DN}$ for short) which extends existential $\\mathsf{MSO_1}$ with predicates for querying neighborhoods of vertex sets and for verifying connectivity and acyclicity of vertex sets in various powers of a graph. Building upon [Bergougnoux and Kant\\'e, ESA 2019; SIDMA 2021], we show that the model checking problem for every fixed $\\mathsf{A\\&C~DN}$ formula is solvable in $n^{O(w)}$ time when the input graph is given together with a branch decomposition of mim-width $w$. Nearly all pro","authors_text":"Benjamin Bergougnoux, Jan Dreier, Lars Jaffke","cross_cats":["cs.LO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2022-02-27T10:25:59Z","title":"A logic-based algorithmic meta-theorem for mim-width"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2202.13335","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:59fc26fefee191bef233564c7d6337a1e2716fbdddd019c5ac15cdfe24bcc45c","target":"record","created_at":"2026-07-05T05:23:29Z","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":"66b2d0c56448e39658682890d7d7b6dfd79905e6b4a5442d03b89b80155635f7","cross_cats_sorted":["cs.LO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2022-02-27T10:25:59Z","title_canon_sha256":"1531c878bf1c2fee3f358ea982a83b620991a6724ec132a3bb60417101e15ded"},"schema_version":"1.0","source":{"id":"2202.13335","kind":"arxiv","version":2}},"canonical_sha256":"3bb6788439783c9d86fc6cd3790acad623c20033a43c55f223177e9f2e34afae","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3bb6788439783c9d86fc6cd3790acad623c20033a43c55f223177e9f2e34afae","first_computed_at":"2026-07-05T05:23:29.827694Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T05:23:29.827694Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"NEXEpWSGv1Cu8i9hHNRdREEMkmJc59id4eWm5aleTwHuFAJI2yjFXFKWemvVv5iL9Yn6XRmDvnaqrmLbQH2rDQ==","signature_status":"signed_v1","signed_at":"2026-07-05T05:23:29.828122Z","signed_message":"canonical_sha256_bytes"},"source_id":"2202.13335","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:59fc26fefee191bef233564c7d6337a1e2716fbdddd019c5ac15cdfe24bcc45c","sha256:b2ada288215e9620e7e48fed9213e4c29c8d51dc5e94165e5ca82b08463eb09d"],"state_sha256":"a6da12009190b4522d7315a6caec1c1e715f36d3ce052dda47aef673858f90a7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CwL0UyCUF2q6onHtls27YrUtHU10XHtCXAdhkghlUTsYk2m+7L8XOi/Vs7BK+nSxGfbtnM6fZbWPT+xL2R8xAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-01T09:59:25.141776Z","bundle_sha256":"f54b417ab7eeaa913ca2f7c124397f182f74d7fde79de12ab996489d4e7c5949"}}