{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:PGEX3E4YS7RFPHTTYSVDCAS3ZO","short_pith_number":"pith:PGEX3E4Y","canonical_record":{"source":{"id":"2607.00742","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2026-07-01T10:24:10Z","cross_cats_sorted":[],"title_canon_sha256":"f65c6430841716196a0f1c07279945bdcbe1489a69e7819b4f57b76b255c547f","abstract_canon_sha256":"a13d15059ded69f903d4e1733b4c3c750bcbb79602c8c9f995a0c24e7af09de1"},"schema_version":"1.0"},"canonical_sha256":"79897d939897e2579e73c4aa31025bcbadc3c24174b409113a49ac87476cd0c3","source":{"kind":"arxiv","id":"2607.00742","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.00742","created_at":"2026-07-02T01:17:53Z"},{"alias_kind":"arxiv_version","alias_value":"2607.00742v1","created_at":"2026-07-02T01:17:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.00742","created_at":"2026-07-02T01:17:53Z"},{"alias_kind":"pith_short_12","alias_value":"PGEX3E4YS7RF","created_at":"2026-07-02T01:17:53Z"},{"alias_kind":"pith_short_16","alias_value":"PGEX3E4YS7RFPHTT","created_at":"2026-07-02T01:17:53Z"},{"alias_kind":"pith_short_8","alias_value":"PGEX3E4Y","created_at":"2026-07-02T01:17:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:PGEX3E4YS7RFPHTTYSVDCAS3ZO","target":"record","payload":{"canonical_record":{"source":{"id":"2607.00742","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2026-07-01T10:24:10Z","cross_cats_sorted":[],"title_canon_sha256":"f65c6430841716196a0f1c07279945bdcbe1489a69e7819b4f57b76b255c547f","abstract_canon_sha256":"a13d15059ded69f903d4e1733b4c3c750bcbb79602c8c9f995a0c24e7af09de1"},"schema_version":"1.0"},"canonical_sha256":"79897d939897e2579e73c4aa31025bcbadc3c24174b409113a49ac87476cd0c3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-02T01:17:53.490803Z","signature_b64":"AyoV0BV8Qt1HRt93dZKfml+prMcCEB1wWUtuOD3m4rNz/OULQ6PTOolPqVfFxpswdrJofQIDEJviABaj47XpAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"79897d939897e2579e73c4aa31025bcbadc3c24174b409113a49ac87476cd0c3","last_reissued_at":"2026-07-02T01:17:53.490258Z","signature_status":"signed_v1","first_computed_at":"2026-07-02T01:17:53.490258Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2607.00742","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-02T01:17:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PIZeNAvB517UCky8rm6cfsQX5195XZMxYT4sAOcTjDgusTZ73XG97WuEPmaWCk4nPFsD6uswvvrbugWSYwM+Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-02T09:44:31.580523Z"},"content_sha256":"905cc17aec4f1b612853e0b5a581b1218dfc18cc2bbcba63c481c79a8d850ee1","schema_version":"1.0","event_id":"sha256:905cc17aec4f1b612853e0b5a581b1218dfc18cc2bbcba63c481c79a8d850ee1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:PGEX3E4YS7RFPHTTYSVDCAS3ZO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Algorithms and fine-grained complexity for nondeterministic and symmetric difference automata","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"Brink van der Merwe, Dmitry Chistikov, Neha Rino, Rados{\\l}aw Pi\\'orkowski","submitted_at":"2026-07-01T10:24:10Z","abstract_excerpt":"Symmetric difference automata (XNFA) are a variant of standard finite automata in which an input word is accepted iff the number of accepting runs is odd. Equivalently, these are weighted automata over the two-element field. We study the fine-grained complexity of the basic decision problems for XNFA: acceptance, emptiness, and equivalence, aiming to optimise the degree of the polynomial in their running-time bounds.\n  Under the assumption of polynomial ambiguity, we provide a randomised reduction of NFA acceptance to XNFA acceptance. For automata of bounded ambiguity (e.g., unambiguous automa"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.00742","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/2607.00742/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-02T01:17:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VSEWsE/Wef82d5KvP+0c/1w+5PtSQ2aRr0C9Om+FAcAbXhdVhowJCOJ5i49Ecs9lFgVie0CqgpSrjESkwrVpBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-02T09:44:31.580896Z"},"content_sha256":"556f3e9a1cc60d33c77c06d4d8b9a78b91b6286ea227ae6bc6c4e6df0862c6e0","schema_version":"1.0","event_id":"sha256:556f3e9a1cc60d33c77c06d4d8b9a78b91b6286ea227ae6bc6c4e6df0862c6e0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PGEX3E4YS7RFPHTTYSVDCAS3ZO/bundle.json","state_url":"https://pith.science/pith/PGEX3E4YS7RFPHTTYSVDCAS3ZO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PGEX3E4YS7RFPHTTYSVDCAS3ZO/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-07-02T09:44:31Z","links":{"resolver":"https://pith.science/pith/PGEX3E4YS7RFPHTTYSVDCAS3ZO","bundle":"https://pith.science/pith/PGEX3E4YS7RFPHTTYSVDCAS3ZO/bundle.json","state":"https://pith.science/pith/PGEX3E4YS7RFPHTTYSVDCAS3ZO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PGEX3E4YS7RFPHTTYSVDCAS3ZO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:PGEX3E4YS7RFPHTTYSVDCAS3ZO","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":"a13d15059ded69f903d4e1733b4c3c750bcbb79602c8c9f995a0c24e7af09de1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2026-07-01T10:24:10Z","title_canon_sha256":"f65c6430841716196a0f1c07279945bdcbe1489a69e7819b4f57b76b255c547f"},"schema_version":"1.0","source":{"id":"2607.00742","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.00742","created_at":"2026-07-02T01:17:53Z"},{"alias_kind":"arxiv_version","alias_value":"2607.00742v1","created_at":"2026-07-02T01:17:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.00742","created_at":"2026-07-02T01:17:53Z"},{"alias_kind":"pith_short_12","alias_value":"PGEX3E4YS7RF","created_at":"2026-07-02T01:17:53Z"},{"alias_kind":"pith_short_16","alias_value":"PGEX3E4YS7RFPHTT","created_at":"2026-07-02T01:17:53Z"},{"alias_kind":"pith_short_8","alias_value":"PGEX3E4Y","created_at":"2026-07-02T01:17:53Z"}],"graph_snapshots":[{"event_id":"sha256:556f3e9a1cc60d33c77c06d4d8b9a78b91b6286ea227ae6bc6c4e6df0862c6e0","target":"graph","created_at":"2026-07-02T01:17:53Z","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/2607.00742/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Symmetric difference automata (XNFA) are a variant of standard finite automata in which an input word is accepted iff the number of accepting runs is odd. Equivalently, these are weighted automata over the two-element field. We study the fine-grained complexity of the basic decision problems for XNFA: acceptance, emptiness, and equivalence, aiming to optimise the degree of the polynomial in their running-time bounds.\n  Under the assumption of polynomial ambiguity, we provide a randomised reduction of NFA acceptance to XNFA acceptance. For automata of bounded ambiguity (e.g., unambiguous automa","authors_text":"Brink van der Merwe, Dmitry Chistikov, Neha Rino, Rados{\\l}aw Pi\\'orkowski","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2026-07-01T10:24:10Z","title":"Algorithms and fine-grained complexity for nondeterministic and symmetric difference automata"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.00742","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:905cc17aec4f1b612853e0b5a581b1218dfc18cc2bbcba63c481c79a8d850ee1","target":"record","created_at":"2026-07-02T01:17:53Z","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":"a13d15059ded69f903d4e1733b4c3c750bcbb79602c8c9f995a0c24e7af09de1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2026-07-01T10:24:10Z","title_canon_sha256":"f65c6430841716196a0f1c07279945bdcbe1489a69e7819b4f57b76b255c547f"},"schema_version":"1.0","source":{"id":"2607.00742","kind":"arxiv","version":1}},"canonical_sha256":"79897d939897e2579e73c4aa31025bcbadc3c24174b409113a49ac87476cd0c3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"79897d939897e2579e73c4aa31025bcbadc3c24174b409113a49ac87476cd0c3","first_computed_at":"2026-07-02T01:17:53.490258Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-02T01:17:53.490258Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"AyoV0BV8Qt1HRt93dZKfml+prMcCEB1wWUtuOD3m4rNz/OULQ6PTOolPqVfFxpswdrJofQIDEJviABaj47XpAQ==","signature_status":"signed_v1","signed_at":"2026-07-02T01:17:53.490803Z","signed_message":"canonical_sha256_bytes"},"source_id":"2607.00742","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:905cc17aec4f1b612853e0b5a581b1218dfc18cc2bbcba63c481c79a8d850ee1","sha256:556f3e9a1cc60d33c77c06d4d8b9a78b91b6286ea227ae6bc6c4e6df0862c6e0"],"state_sha256":"b71e4af8f34ef57ffaa7d12c2565d170359402116c2f7bb661a4ebf33beedf87"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"auYdmZXAZVvA61mQ++FOuCW+JtKZmPhZASRDkeBry6j9EJy8p8iad7rUi4eq4/WhtqGVCzeTVxziqFehDqd8Bg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-02T09:44:31.582938Z","bundle_sha256":"5888ec40b3e26cc37bf858ac445822194d9430c7f7415f8245e41a945b376813"}}