{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:7DVSBIQDJ6SQ3UWVTYIORZCG4U","short_pith_number":"pith:7DVSBIQD","schema_version":"1.0","canonical_sha256":"f8eb20a2034fa50dd2d59e10e8e446e5315b5d6eb10a1f83f587f6dfa452a453","source":{"kind":"arxiv","id":"2501.15303","version":3},"attestation_state":"computed","paper":{"title":"Guarded Negation Transitive Closure Logic","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Diego Figueira, Santiago Figueira, Yoshiki Nakamura","submitted_at":"2025-01-25T19:00:51Z","abstract_excerpt":"We study the guarded negation fragment of transitive closure logic (GNTC). We show that the satisfiability problem for GNTC is 2ExpTime-complete, by establishing the following reductions: (i) a polynomial-time reduction from the satisfiability problem for GNTC to the satisfiability problem for the unary negation fragment UNTC of GNTC, and (ii) a direct exponential-time reduction from the satisfiability problem for UNTC to the non-emptiness problem for 2-way alternating parity tree automata. Furthermore, we show that the model checking problem for GNTC is $\\mathsf{P}^{\\mathsf{NP}[\\mathcal{O}(\\l"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2501.15303","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LO","submitted_at":"2025-01-25T19:00:51Z","cross_cats_sorted":[],"title_canon_sha256":"1c2c281b39ac52f888047f8d86197d3b178c775899b0934eefc7843c72c387c5","abstract_canon_sha256":"e4816b7f94f5376c939ce898eb0aba608067fe30880329ba7c6a506e80b306b8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-20T00:02:48.185267Z","signature_b64":"FOtCutZ6qpiTkRnCBoneSLfEYO+UzsH43ds7Tl7k/TtAyYEICUFUISPM2nJ2pYIFQ5YdjKVhiUuWlXBDXojrBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f8eb20a2034fa50dd2d59e10e8e446e5315b5d6eb10a1f83f587f6dfa452a453","last_reissued_at":"2026-05-20T00:02:48.184410Z","signature_status":"signed_v1","first_computed_at":"2026-05-20T00:02:48.184410Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Guarded Negation Transitive Closure Logic","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Diego Figueira, Santiago Figueira, Yoshiki Nakamura","submitted_at":"2025-01-25T19:00:51Z","abstract_excerpt":"We study the guarded negation fragment of transitive closure logic (GNTC). We show that the satisfiability problem for GNTC is 2ExpTime-complete, by establishing the following reductions: (i) a polynomial-time reduction from the satisfiability problem for GNTC to the satisfiability problem for the unary negation fragment UNTC of GNTC, and (ii) a direct exponential-time reduction from the satisfiability problem for UNTC to the non-emptiness problem for 2-way alternating parity tree automata. Furthermore, we show that the model checking problem for GNTC is $\\mathsf{P}^{\\mathsf{NP}[\\mathcal{O}(\\l"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2501.15303","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2501.15303/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2501.15303","created_at":"2026-05-20T00:02:48.184555+00:00"},{"alias_kind":"arxiv_version","alias_value":"2501.15303v3","created_at":"2026-05-20T00:02:48.184555+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2501.15303","created_at":"2026-05-20T00:02:48.184555+00:00"},{"alias_kind":"pith_short_12","alias_value":"7DVSBIQDJ6SQ","created_at":"2026-05-20T00:02:48.184555+00:00"},{"alias_kind":"pith_short_16","alias_value":"7DVSBIQDJ6SQ3UWV","created_at":"2026-05-20T00:02:48.184555+00:00"},{"alias_kind":"pith_short_8","alias_value":"7DVSBIQD","created_at":"2026-05-20T00:02:48.184555+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/7DVSBIQDJ6SQ3UWVTYIORZCG4U","json":"https://pith.science/pith/7DVSBIQDJ6SQ3UWVTYIORZCG4U.json","graph_json":"https://pith.science/api/pith-number/7DVSBIQDJ6SQ3UWVTYIORZCG4U/graph.json","events_json":"https://pith.science/api/pith-number/7DVSBIQDJ6SQ3UWVTYIORZCG4U/events.json","paper":"https://pith.science/paper/7DVSBIQD"},"agent_actions":{"view_html":"https://pith.science/pith/7DVSBIQDJ6SQ3UWVTYIORZCG4U","download_json":"https://pith.science/pith/7DVSBIQDJ6SQ3UWVTYIORZCG4U.json","view_paper":"https://pith.science/paper/7DVSBIQD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2501.15303&json=true","fetch_graph":"https://pith.science/api/pith-number/7DVSBIQDJ6SQ3UWVTYIORZCG4U/graph.json","fetch_events":"https://pith.science/api/pith-number/7DVSBIQDJ6SQ3UWVTYIORZCG4U/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7DVSBIQDJ6SQ3UWVTYIORZCG4U/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7DVSBIQDJ6SQ3UWVTYIORZCG4U/action/storage_attestation","attest_author":"https://pith.science/pith/7DVSBIQDJ6SQ3UWVTYIORZCG4U/action/author_attestation","sign_citation":"https://pith.science/pith/7DVSBIQDJ6SQ3UWVTYIORZCG4U/action/citation_signature","submit_replication":"https://pith.science/pith/7DVSBIQDJ6SQ3UWVTYIORZCG4U/action/replication_record"}},"created_at":"2026-05-20T00:02:48.184555+00:00","updated_at":"2026-05-20T00:02:48.184555+00:00"}