{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:7DVSBIQDJ6SQ3UWVTYIORZCG4U","short_pith_number":"pith:7DVSBIQD","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"},"canonical_sha256":"f8eb20a2034fa50dd2d59e10e8e446e5315b5d6eb10a1f83f587f6dfa452a453","source":{"kind":"arxiv","id":"2501.15303","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2501.15303","created_at":"2026-05-20T00:02:48Z"},{"alias_kind":"arxiv_version","alias_value":"2501.15303v3","created_at":"2026-05-20T00:02:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2501.15303","created_at":"2026-05-20T00:02:48Z"},{"alias_kind":"pith_short_12","alias_value":"7DVSBIQDJ6SQ","created_at":"2026-05-20T00:02:48Z"},{"alias_kind":"pith_short_16","alias_value":"7DVSBIQDJ6SQ3UWV","created_at":"2026-05-20T00:02:48Z"},{"alias_kind":"pith_short_8","alias_value":"7DVSBIQD","created_at":"2026-05-20T00:02:48Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:7DVSBIQDJ6SQ3UWVTYIORZCG4U","target":"record","payload":{"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"},"canonical_sha256":"f8eb20a2034fa50dd2d59e10e8e446e5315b5d6eb10a1f83f587f6dfa452a453","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"},"source_kind":"arxiv","source_id":"2501.15303","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-20T00:02:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tGTNvuaXhCAU38jheqeSlhqywAAgrTWN3jo60+h94KCprXkUetJOlhJIvVU+tJFS/gkXX7hY85yaN5vju1Y7Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T05:52:39.910228Z"},"content_sha256":"d796afd559caed011371e10bd79f98870e4f4a16314e1a68c3b7c70dd6c8fe8f","schema_version":"1.0","event_id":"sha256:d796afd559caed011371e10bd79f98870e4f4a16314e1a68c3b7c70dd6c8fe8f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:7DVSBIQDJ6SQ3UWVTYIORZCG4U","target":"graph","payload":{"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"},"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-20T00:02:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kagLGca19xgP5fHWBINNhwhGqdb+yyFw9j/tpIbxyGqtdAGVgIfz9DE7VmfMT8vgHT6Uz1iFTGxq3Po5+9O6BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T05:52:39.910723Z"},"content_sha256":"5c8869a6e598526c8a5713db35f46fd14e33f471a3b71a3f960a9858c55866d8","schema_version":"1.0","event_id":"sha256:5c8869a6e598526c8a5713db35f46fd14e33f471a3b71a3f960a9858c55866d8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7DVSBIQDJ6SQ3UWVTYIORZCG4U/bundle.json","state_url":"https://pith.science/pith/7DVSBIQDJ6SQ3UWVTYIORZCG4U/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7DVSBIQDJ6SQ3UWVTYIORZCG4U/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-05-25T05:52:39Z","links":{"resolver":"https://pith.science/pith/7DVSBIQDJ6SQ3UWVTYIORZCG4U","bundle":"https://pith.science/pith/7DVSBIQDJ6SQ3UWVTYIORZCG4U/bundle.json","state":"https://pith.science/pith/7DVSBIQDJ6SQ3UWVTYIORZCG4U/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7DVSBIQDJ6SQ3UWVTYIORZCG4U/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:7DVSBIQDJ6SQ3UWVTYIORZCG4U","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":"e4816b7f94f5376c939ce898eb0aba608067fe30880329ba7c6a506e80b306b8","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LO","submitted_at":"2025-01-25T19:00:51Z","title_canon_sha256":"1c2c281b39ac52f888047f8d86197d3b178c775899b0934eefc7843c72c387c5"},"schema_version":"1.0","source":{"id":"2501.15303","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2501.15303","created_at":"2026-05-20T00:02:48Z"},{"alias_kind":"arxiv_version","alias_value":"2501.15303v3","created_at":"2026-05-20T00:02:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2501.15303","created_at":"2026-05-20T00:02:48Z"},{"alias_kind":"pith_short_12","alias_value":"7DVSBIQDJ6SQ","created_at":"2026-05-20T00:02:48Z"},{"alias_kind":"pith_short_16","alias_value":"7DVSBIQDJ6SQ3UWV","created_at":"2026-05-20T00:02:48Z"},{"alias_kind":"pith_short_8","alias_value":"7DVSBIQD","created_at":"2026-05-20T00:02:48Z"}],"graph_snapshots":[{"event_id":"sha256:5c8869a6e598526c8a5713db35f46fd14e33f471a3b71a3f960a9858c55866d8","target":"graph","created_at":"2026-05-20T00:02:48Z","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/2501.15303/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Diego Figueira, Santiago Figueira, Yoshiki Nakamura","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LO","submitted_at":"2025-01-25T19:00:51Z","title":"Guarded Negation Transitive Closure Logic"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2501.15303","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:d796afd559caed011371e10bd79f98870e4f4a16314e1a68c3b7c70dd6c8fe8f","target":"record","created_at":"2026-05-20T00:02:48Z","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":"e4816b7f94f5376c939ce898eb0aba608067fe30880329ba7c6a506e80b306b8","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LO","submitted_at":"2025-01-25T19:00:51Z","title_canon_sha256":"1c2c281b39ac52f888047f8d86197d3b178c775899b0934eefc7843c72c387c5"},"schema_version":"1.0","source":{"id":"2501.15303","kind":"arxiv","version":3}},"canonical_sha256":"f8eb20a2034fa50dd2d59e10e8e446e5315b5d6eb10a1f83f587f6dfa452a453","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f8eb20a2034fa50dd2d59e10e8e446e5315b5d6eb10a1f83f587f6dfa452a453","first_computed_at":"2026-05-20T00:02:48.184410Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-20T00:02:48.184410Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"FOtCutZ6qpiTkRnCBoneSLfEYO+UzsH43ds7Tl7k/TtAyYEICUFUISPM2nJ2pYIFQ5YdjKVhiUuWlXBDXojrBA==","signature_status":"signed_v1","signed_at":"2026-05-20T00:02:48.185267Z","signed_message":"canonical_sha256_bytes"},"source_id":"2501.15303","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d796afd559caed011371e10bd79f98870e4f4a16314e1a68c3b7c70dd6c8fe8f","sha256:5c8869a6e598526c8a5713db35f46fd14e33f471a3b71a3f960a9858c55866d8"],"state_sha256":"0e17386ed62b7f6f690017a8b017c6bee24b9cd63ac5fcd66f92a50a22f64bda"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wWpwX7+uNYNK7IF/LV3QHOdQcK8pcw8oRBBAYZmuVEit7KQ0M2XOlROJksXLMR8nroqi7XI90Bqk4/qHxhpDAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T05:52:39.914324Z","bundle_sha256":"fa46849b91b4c3327d1c9e67434d477d6d2c0277691bf9d64089f4672e39d618"}}