{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:PFIJ3UF6U4CVYELTGKHNHWBGJD","short_pith_number":"pith:PFIJ3UF6","schema_version":"1.0","canonical_sha256":"79509dd0bea7055c1173328ed3d82648d39b7db050d2e074dac101da769b895b","source":{"kind":"arxiv","id":"1803.08727","version":1},"attestation_state":"computed","paper":{"title":"Equivariant ZFA with Choice: a position paper","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.LO"],"primary_cat":"cs.LO","authors_text":"Murdoch J. Gabbay","submitted_at":"2018-03-23T10:44:48Z","abstract_excerpt":"We propose Equivariant ZFA with Choice as a foundation for nominal techniques that is stronger than ZFC and weaker than FM, and why this may be particularly helpful in the context of automated reasoning."},"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":"1803.08727","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2018-03-23T10:44:48Z","cross_cats_sorted":["math.LO"],"title_canon_sha256":"0d169c7cd18b3c7f077af3aee4848209889eb83fc60dc983ea89d7ab888bfea2","abstract_canon_sha256":"ee4cf7bc1bd94148c3e1b8ed1501980b75e7fd7478c297d1f7a4f2b07cd50df1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:20:18.699871Z","signature_b64":"GrH5P3iKveQSAZ56XUrELL699zVVoDikbkjrD92WKHgSGTtzt1cqbSwfuOsQZHZCsR0PaSvTN3gJOuzRZTcuCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"79509dd0bea7055c1173328ed3d82648d39b7db050d2e074dac101da769b895b","last_reissued_at":"2026-05-18T00:20:18.699203Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:20:18.699203Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Equivariant ZFA with Choice: a position paper","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.LO"],"primary_cat":"cs.LO","authors_text":"Murdoch J. Gabbay","submitted_at":"2018-03-23T10:44:48Z","abstract_excerpt":"We propose Equivariant ZFA with Choice as a foundation for nominal techniques that is stronger than ZFC and weaker than FM, and why this may be particularly helpful in the context of automated reasoning."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.08727","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1803.08727","created_at":"2026-05-18T00:20:18.699297+00:00"},{"alias_kind":"arxiv_version","alias_value":"1803.08727v1","created_at":"2026-05-18T00:20:18.699297+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.08727","created_at":"2026-05-18T00:20:18.699297+00:00"},{"alias_kind":"pith_short_12","alias_value":"PFIJ3UF6U4CV","created_at":"2026-05-18T12:32:43.782077+00:00"},{"alias_kind":"pith_short_16","alias_value":"PFIJ3UF6U4CVYELT","created_at":"2026-05-18T12:32:43.782077+00:00"},{"alias_kind":"pith_short_8","alias_value":"PFIJ3UF6","created_at":"2026-05-18T12:32:43.782077+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/PFIJ3UF6U4CVYELTGKHNHWBGJD","json":"https://pith.science/pith/PFIJ3UF6U4CVYELTGKHNHWBGJD.json","graph_json":"https://pith.science/api/pith-number/PFIJ3UF6U4CVYELTGKHNHWBGJD/graph.json","events_json":"https://pith.science/api/pith-number/PFIJ3UF6U4CVYELTGKHNHWBGJD/events.json","paper":"https://pith.science/paper/PFIJ3UF6"},"agent_actions":{"view_html":"https://pith.science/pith/PFIJ3UF6U4CVYELTGKHNHWBGJD","download_json":"https://pith.science/pith/PFIJ3UF6U4CVYELTGKHNHWBGJD.json","view_paper":"https://pith.science/paper/PFIJ3UF6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1803.08727&json=true","fetch_graph":"https://pith.science/api/pith-number/PFIJ3UF6U4CVYELTGKHNHWBGJD/graph.json","fetch_events":"https://pith.science/api/pith-number/PFIJ3UF6U4CVYELTGKHNHWBGJD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PFIJ3UF6U4CVYELTGKHNHWBGJD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PFIJ3UF6U4CVYELTGKHNHWBGJD/action/storage_attestation","attest_author":"https://pith.science/pith/PFIJ3UF6U4CVYELTGKHNHWBGJD/action/author_attestation","sign_citation":"https://pith.science/pith/PFIJ3UF6U4CVYELTGKHNHWBGJD/action/citation_signature","submit_replication":"https://pith.science/pith/PFIJ3UF6U4CVYELTGKHNHWBGJD/action/replication_record"}},"created_at":"2026-05-18T00:20:18.699297+00:00","updated_at":"2026-05-18T00:20:18.699297+00:00"}