{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:I265AG6DLM3GXEPQFK4UL5L6MJ","short_pith_number":"pith:I265AG6D","canonical_record":{"source":{"id":"1802.00756","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LO","submitted_at":"2018-02-02T16:26:04Z","cross_cats_sorted":[],"title_canon_sha256":"1b93b3ef57f9a2f6ff7389ed42d960cbc43cce47b323af225bf75dcd12d6769a","abstract_canon_sha256":"63fb80dd7f4f42d79e938c6670449a052991f15daae0ddefcc04cfd79d5dcbbc"},"schema_version":"1.0"},"canonical_sha256":"46bdd01bc35b366b91f02ab945f57e62589fc45be5e862d6c92b1f52492e1097","source":{"kind":"arxiv","id":"1802.00756","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.00756","created_at":"2026-05-18T00:12:08Z"},{"alias_kind":"arxiv_version","alias_value":"1802.00756v3","created_at":"2026-05-18T00:12:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.00756","created_at":"2026-05-18T00:12:08Z"},{"alias_kind":"pith_short_12","alias_value":"I265AG6DLM3G","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_16","alias_value":"I265AG6DLM3GXEPQ","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_8","alias_value":"I265AG6D","created_at":"2026-05-18T12:32:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:I265AG6DLM3GXEPQFK4UL5L6MJ","target":"record","payload":{"canonical_record":{"source":{"id":"1802.00756","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LO","submitted_at":"2018-02-02T16:26:04Z","cross_cats_sorted":[],"title_canon_sha256":"1b93b3ef57f9a2f6ff7389ed42d960cbc43cce47b323af225bf75dcd12d6769a","abstract_canon_sha256":"63fb80dd7f4f42d79e938c6670449a052991f15daae0ddefcc04cfd79d5dcbbc"},"schema_version":"1.0"},"canonical_sha256":"46bdd01bc35b366b91f02ab945f57e62589fc45be5e862d6c92b1f52492e1097","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:12:08.956528Z","signature_b64":"no52EOEbmgmla3BzqZtokggwlk9SHe8PPZx6oiBMX2Y2iY1JkRs5NrQbiExyQNkrwqU8zf0C359o1ZmYn1S8Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"46bdd01bc35b366b91f02ab945f57e62589fc45be5e862d6c92b1f52492e1097","last_reissued_at":"2026-05-18T00:12:08.955973Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:12:08.955973Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1802.00756","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-18T00:12:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2owQg9A2C1GcXY8R7YAg87fk6JCeZt1TlYmDtXBpngx3F6DEbil/EvUhzeBgYv7i7jnBXdwrK7YWtAVvDCLFAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T07:50:33.949608Z"},"content_sha256":"03bd0a220e2c39f26e4084e0445e1a08e4ffdea27db305a801275430bec4cb16","schema_version":"1.0","event_id":"sha256:03bd0a220e2c39f26e4084e0445e1a08e4ffdea27db305a801275430bec4cb16"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:I265AG6DLM3GXEPQFK4UL5L6MJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Infinitary and Cyclic Proof Systems for Transitive Closure Logic","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Liron Cohen, Reuben N. S. Rowe","submitted_at":"2018-02-02T16:26:04Z","abstract_excerpt":"Transitive closure logic is a known extension of first-order logic obtained by introducing a transitive closure operator. While other extensions of first-order logic with inductive definitions are a priori parametrized by a set of inductive definitions, the addition of the transitive closure operator uniformly captures all finitary inductive definitions. In this paper we present an infinitary proof system for transitive closure logic which is an infinite descent-style counterpart to the existing (explicit induction) proof system for the logic. We show that, as for similar systems for first-ord"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.00756","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":""},"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-18T00:12:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+9w8QMownGWSem+dcAgYy4UbppcoFkc6kOgh06g6rT7MPfJl03Rxo8Io+UF1PCg6HMVnqCqRs2NghK5/4EMKAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T07:50:33.949997Z"},"content_sha256":"307627b61cbdea5af4dabdbb9509ad71da45d73423004b41e872ac80c1791c44","schema_version":"1.0","event_id":"sha256:307627b61cbdea5af4dabdbb9509ad71da45d73423004b41e872ac80c1791c44"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/I265AG6DLM3GXEPQFK4UL5L6MJ/bundle.json","state_url":"https://pith.science/pith/I265AG6DLM3GXEPQFK4UL5L6MJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/I265AG6DLM3GXEPQFK4UL5L6MJ/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-06-03T07:50:33Z","links":{"resolver":"https://pith.science/pith/I265AG6DLM3GXEPQFK4UL5L6MJ","bundle":"https://pith.science/pith/I265AG6DLM3GXEPQFK4UL5L6MJ/bundle.json","state":"https://pith.science/pith/I265AG6DLM3GXEPQFK4UL5L6MJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/I265AG6DLM3GXEPQFK4UL5L6MJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:I265AG6DLM3GXEPQFK4UL5L6MJ","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":"63fb80dd7f4f42d79e938c6670449a052991f15daae0ddefcc04cfd79d5dcbbc","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LO","submitted_at":"2018-02-02T16:26:04Z","title_canon_sha256":"1b93b3ef57f9a2f6ff7389ed42d960cbc43cce47b323af225bf75dcd12d6769a"},"schema_version":"1.0","source":{"id":"1802.00756","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.00756","created_at":"2026-05-18T00:12:08Z"},{"alias_kind":"arxiv_version","alias_value":"1802.00756v3","created_at":"2026-05-18T00:12:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.00756","created_at":"2026-05-18T00:12:08Z"},{"alias_kind":"pith_short_12","alias_value":"I265AG6DLM3G","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_16","alias_value":"I265AG6DLM3GXEPQ","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_8","alias_value":"I265AG6D","created_at":"2026-05-18T12:32:28Z"}],"graph_snapshots":[{"event_id":"sha256:307627b61cbdea5af4dabdbb9509ad71da45d73423004b41e872ac80c1791c44","target":"graph","created_at":"2026-05-18T00:12:08Z","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"},"paper":{"abstract_excerpt":"Transitive closure logic is a known extension of first-order logic obtained by introducing a transitive closure operator. While other extensions of first-order logic with inductive definitions are a priori parametrized by a set of inductive definitions, the addition of the transitive closure operator uniformly captures all finitary inductive definitions. In this paper we present an infinitary proof system for transitive closure logic which is an infinite descent-style counterpart to the existing (explicit induction) proof system for the logic. We show that, as for similar systems for first-ord","authors_text":"Liron Cohen, Reuben N. S. Rowe","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LO","submitted_at":"2018-02-02T16:26:04Z","title":"Infinitary and Cyclic Proof Systems for Transitive Closure Logic"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.00756","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:03bd0a220e2c39f26e4084e0445e1a08e4ffdea27db305a801275430bec4cb16","target":"record","created_at":"2026-05-18T00:12:08Z","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":"63fb80dd7f4f42d79e938c6670449a052991f15daae0ddefcc04cfd79d5dcbbc","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LO","submitted_at":"2018-02-02T16:26:04Z","title_canon_sha256":"1b93b3ef57f9a2f6ff7389ed42d960cbc43cce47b323af225bf75dcd12d6769a"},"schema_version":"1.0","source":{"id":"1802.00756","kind":"arxiv","version":3}},"canonical_sha256":"46bdd01bc35b366b91f02ab945f57e62589fc45be5e862d6c92b1f52492e1097","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"46bdd01bc35b366b91f02ab945f57e62589fc45be5e862d6c92b1f52492e1097","first_computed_at":"2026-05-18T00:12:08.955973Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:12:08.955973Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"no52EOEbmgmla3BzqZtokggwlk9SHe8PPZx6oiBMX2Y2iY1JkRs5NrQbiExyQNkrwqU8zf0C359o1ZmYn1S8Cw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:12:08.956528Z","signed_message":"canonical_sha256_bytes"},"source_id":"1802.00756","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:03bd0a220e2c39f26e4084e0445e1a08e4ffdea27db305a801275430bec4cb16","sha256:307627b61cbdea5af4dabdbb9509ad71da45d73423004b41e872ac80c1791c44"],"state_sha256":"357b49478b2e88c466beed073ee77f8a05b4ba9eb6fa8b98aa540a6663739495"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ei9Yhy0CNNNyFiyJidAnl3+7ZGN0QgJLEUcMdzWgVUz5aFDXY/AgPABc7zJpZo9ahRFprcwfIV/W7D8+fCzaDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T07:50:33.952010Z","bundle_sha256":"906808efe919f5b357394290a7f5003b76680cf23087f13481232516adf9b749"}}