{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:YAUJE4YJD5ET7YYXZFGWZFVXMW","short_pith_number":"pith:YAUJE4YJ","canonical_record":{"source":{"id":"1312.4840","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2013-12-17T15:58:24Z","cross_cats_sorted":[],"title_canon_sha256":"b53980dabddd4bd179ce106fef2feafe79d00a552a1700c7a595e59f6c7da459","abstract_canon_sha256":"39bab508d70ea17c3f98b01b2f10a696eaa152cbdb6d2ee006e6a1c71e191bb0"},"schema_version":"1.0"},"canonical_sha256":"c0289273091f493fe317c94d6c96b765987b11cb0085a155f255a9c34c2530bc","source":{"kind":"arxiv","id":"1312.4840","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1312.4840","created_at":"2026-05-18T03:04:23Z"},{"alias_kind":"arxiv_version","alias_value":"1312.4840v1","created_at":"2026-05-18T03:04:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.4840","created_at":"2026-05-18T03:04:23Z"},{"alias_kind":"pith_short_12","alias_value":"YAUJE4YJD5ET","created_at":"2026-05-18T12:28:06Z"},{"alias_kind":"pith_short_16","alias_value":"YAUJE4YJD5ET7YYX","created_at":"2026-05-18T12:28:06Z"},{"alias_kind":"pith_short_8","alias_value":"YAUJE4YJ","created_at":"2026-05-18T12:28:06Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:YAUJE4YJD5ET7YYXZFGWZFVXMW","target":"record","payload":{"canonical_record":{"source":{"id":"1312.4840","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2013-12-17T15:58:24Z","cross_cats_sorted":[],"title_canon_sha256":"b53980dabddd4bd179ce106fef2feafe79d00a552a1700c7a595e59f6c7da459","abstract_canon_sha256":"39bab508d70ea17c3f98b01b2f10a696eaa152cbdb6d2ee006e6a1c71e191bb0"},"schema_version":"1.0"},"canonical_sha256":"c0289273091f493fe317c94d6c96b765987b11cb0085a155f255a9c34c2530bc","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:04:23.019797Z","signature_b64":"tCMZlenDfkHQXeFYumP0p8w/R0pvPzq4HUEywkEye0vs637VIKXtevNLvr4bPDRbN7X3tbJmltfBPMIFICfMBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c0289273091f493fe317c94d6c96b765987b11cb0085a155f255a9c34c2530bc","last_reissued_at":"2026-05-18T03:04:23.019361Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:04:23.019361Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1312.4840","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-05-18T03:04:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Jn1XiDzx5P23OqiHZjr3gKDGgPbxXK6yuW5LFAVlERxJlMKf8HMZxnqsjgaJ0+itPmC0FikNx5dxRMWeVRGVAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T20:34:37.916205Z"},"content_sha256":"e049f7b174b974153317c4325b46108980057386834ec34e29ef110acb608387","schema_version":"1.0","event_id":"sha256:e049f7b174b974153317c4325b46108980057386834ec34e29ef110acb608387"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:YAUJE4YJD5ET7YYXZFGWZFVXMW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A simple sequent calculus for nominal logic","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"James Cheney","submitted_at":"2013-12-17T15:58:24Z","abstract_excerpt":"Nominal logic is a variant of first-order logic that provides support for reasoning about bound names in abstract syntax. A key feature of nominal logic is the new-quantifier, which quantifies over fresh names (names not appearing in any values considered so far). Previous attempts have been made to develop convenient rules for reasoning with the new-quantifier, but we argue that none of these attempts is completely satisfactory.\n  In this article we develop a new sequent calculus for nominal logic in which the rules for the new- quantifier are much simpler than in previous attempts. We also p"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.4840","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":""},"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-18T03:04:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5+E2W9EMEyZQU7yILtxiiCdQkWXIpn0exi2Rat+nhZs5MTlRetQfKi+pVNkMOHANVxd7FyvV+N6fTW+7Qek8Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T20:34:37.916633Z"},"content_sha256":"52148c878b47ecf29c64bb9fa06e1bd57ae05610c10b5f5e35a5db434cedf8df","schema_version":"1.0","event_id":"sha256:52148c878b47ecf29c64bb9fa06e1bd57ae05610c10b5f5e35a5db434cedf8df"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YAUJE4YJD5ET7YYXZFGWZFVXMW/bundle.json","state_url":"https://pith.science/pith/YAUJE4YJD5ET7YYXZFGWZFVXMW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YAUJE4YJD5ET7YYXZFGWZFVXMW/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-06T20:34:37Z","links":{"resolver":"https://pith.science/pith/YAUJE4YJD5ET7YYXZFGWZFVXMW","bundle":"https://pith.science/pith/YAUJE4YJD5ET7YYXZFGWZFVXMW/bundle.json","state":"https://pith.science/pith/YAUJE4YJD5ET7YYXZFGWZFVXMW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YAUJE4YJD5ET7YYXZFGWZFVXMW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:YAUJE4YJD5ET7YYXZFGWZFVXMW","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":"39bab508d70ea17c3f98b01b2f10a696eaa152cbdb6d2ee006e6a1c71e191bb0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2013-12-17T15:58:24Z","title_canon_sha256":"b53980dabddd4bd179ce106fef2feafe79d00a552a1700c7a595e59f6c7da459"},"schema_version":"1.0","source":{"id":"1312.4840","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1312.4840","created_at":"2026-05-18T03:04:23Z"},{"alias_kind":"arxiv_version","alias_value":"1312.4840v1","created_at":"2026-05-18T03:04:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.4840","created_at":"2026-05-18T03:04:23Z"},{"alias_kind":"pith_short_12","alias_value":"YAUJE4YJD5ET","created_at":"2026-05-18T12:28:06Z"},{"alias_kind":"pith_short_16","alias_value":"YAUJE4YJD5ET7YYX","created_at":"2026-05-18T12:28:06Z"},{"alias_kind":"pith_short_8","alias_value":"YAUJE4YJ","created_at":"2026-05-18T12:28:06Z"}],"graph_snapshots":[{"event_id":"sha256:52148c878b47ecf29c64bb9fa06e1bd57ae05610c10b5f5e35a5db434cedf8df","target":"graph","created_at":"2026-05-18T03:04:23Z","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":"Nominal logic is a variant of first-order logic that provides support for reasoning about bound names in abstract syntax. A key feature of nominal logic is the new-quantifier, which quantifies over fresh names (names not appearing in any values considered so far). Previous attempts have been made to develop convenient rules for reasoning with the new-quantifier, but we argue that none of these attempts is completely satisfactory.\n  In this article we develop a new sequent calculus for nominal logic in which the rules for the new- quantifier are much simpler than in previous attempts. We also p","authors_text":"James Cheney","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2013-12-17T15:58:24Z","title":"A simple sequent calculus for nominal logic"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.4840","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:e049f7b174b974153317c4325b46108980057386834ec34e29ef110acb608387","target":"record","created_at":"2026-05-18T03:04:23Z","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":"39bab508d70ea17c3f98b01b2f10a696eaa152cbdb6d2ee006e6a1c71e191bb0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2013-12-17T15:58:24Z","title_canon_sha256":"b53980dabddd4bd179ce106fef2feafe79d00a552a1700c7a595e59f6c7da459"},"schema_version":"1.0","source":{"id":"1312.4840","kind":"arxiv","version":1}},"canonical_sha256":"c0289273091f493fe317c94d6c96b765987b11cb0085a155f255a9c34c2530bc","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c0289273091f493fe317c94d6c96b765987b11cb0085a155f255a9c34c2530bc","first_computed_at":"2026-05-18T03:04:23.019361Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:04:23.019361Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"tCMZlenDfkHQXeFYumP0p8w/R0pvPzq4HUEywkEye0vs637VIKXtevNLvr4bPDRbN7X3tbJmltfBPMIFICfMBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:04:23.019797Z","signed_message":"canonical_sha256_bytes"},"source_id":"1312.4840","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e049f7b174b974153317c4325b46108980057386834ec34e29ef110acb608387","sha256:52148c878b47ecf29c64bb9fa06e1bd57ae05610c10b5f5e35a5db434cedf8df"],"state_sha256":"8bda812239f559f4ff0b819c5c58ce7a53c275eb407e41025e4f84c508d352e7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mCjUivFDDGDYvgVH6uiVXkNXJ2U+JS7b9Q5C5mnhGT+xBn41cg7u3kIBKI+Gx7A9My0h25E1m/Y4Vb5MtbU/DQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T20:34:37.919932Z","bundle_sha256":"5aac04908aa66d04e71046d353ebc52d14362a846cfdbcae489711a8a39854bc"}}