{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:QVFG6KYBCRTPSXIJZB6ENMA66F","short_pith_number":"pith:QVFG6KYB","schema_version":"1.0","canonical_sha256":"854a6f2b011466f95d09c87c46b01ef14453fc021ca4ef6bcde7560750f589da","source":{"kind":"arxiv","id":"1808.02782","version":1},"attestation_state":"computed","paper":{"title":"Generically Computable Equivalence Structures and Isomorphisms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.LO","authors_text":"Douglas Cenzer, Valentina Harizanov, Wesley Calvert","submitted_at":"2018-08-08T13:56:28Z","abstract_excerpt":"We define notions of generically and coarsely computable relations and structures and functions between structures. We investigate the existence and uniqueness of equivalence structures in the context of these definitions"},"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":"1808.02782","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.LO","submitted_at":"2018-08-08T13:56:28Z","cross_cats_sorted":[],"title_canon_sha256":"7e2b1eb619de885cffb4f657e0686c5f2ccc3775aebd3caccb302ea73883482e","abstract_canon_sha256":"0cf0dd37b349b782de50c0976f7b241a701dd202a431e2e1cc4efb90f1d765e5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:08:32.204347Z","signature_b64":"LUmVlMY2wIwNnKt/UkgdoCJtMTHw8TowS2KuMj+fcV39keNdEfCgv5Vr0YZ2ru++xzJTdEBD5RDH/TjfzDlQBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"854a6f2b011466f95d09c87c46b01ef14453fc021ca4ef6bcde7560750f589da","last_reissued_at":"2026-05-18T00:08:32.203624Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:08:32.203624Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Generically Computable Equivalence Structures and Isomorphisms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.LO","authors_text":"Douglas Cenzer, Valentina Harizanov, Wesley Calvert","submitted_at":"2018-08-08T13:56:28Z","abstract_excerpt":"We define notions of generically and coarsely computable relations and structures and functions between structures. We investigate the existence and uniqueness of equivalence structures in the context of these definitions"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.02782","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":"1808.02782","created_at":"2026-05-18T00:08:32.203749+00:00"},{"alias_kind":"arxiv_version","alias_value":"1808.02782v1","created_at":"2026-05-18T00:08:32.203749+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.02782","created_at":"2026-05-18T00:08:32.203749+00:00"},{"alias_kind":"pith_short_12","alias_value":"QVFG6KYBCRTP","created_at":"2026-05-18T12:32:46.962924+00:00"},{"alias_kind":"pith_short_16","alias_value":"QVFG6KYBCRTPSXIJ","created_at":"2026-05-18T12:32:46.962924+00:00"},{"alias_kind":"pith_short_8","alias_value":"QVFG6KYB","created_at":"2026-05-18T12:32:46.962924+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/QVFG6KYBCRTPSXIJZB6ENMA66F","json":"https://pith.science/pith/QVFG6KYBCRTPSXIJZB6ENMA66F.json","graph_json":"https://pith.science/api/pith-number/QVFG6KYBCRTPSXIJZB6ENMA66F/graph.json","events_json":"https://pith.science/api/pith-number/QVFG6KYBCRTPSXIJZB6ENMA66F/events.json","paper":"https://pith.science/paper/QVFG6KYB"},"agent_actions":{"view_html":"https://pith.science/pith/QVFG6KYBCRTPSXIJZB6ENMA66F","download_json":"https://pith.science/pith/QVFG6KYBCRTPSXIJZB6ENMA66F.json","view_paper":"https://pith.science/paper/QVFG6KYB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1808.02782&json=true","fetch_graph":"https://pith.science/api/pith-number/QVFG6KYBCRTPSXIJZB6ENMA66F/graph.json","fetch_events":"https://pith.science/api/pith-number/QVFG6KYBCRTPSXIJZB6ENMA66F/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QVFG6KYBCRTPSXIJZB6ENMA66F/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QVFG6KYBCRTPSXIJZB6ENMA66F/action/storage_attestation","attest_author":"https://pith.science/pith/QVFG6KYBCRTPSXIJZB6ENMA66F/action/author_attestation","sign_citation":"https://pith.science/pith/QVFG6KYBCRTPSXIJZB6ENMA66F/action/citation_signature","submit_replication":"https://pith.science/pith/QVFG6KYBCRTPSXIJZB6ENMA66F/action/replication_record"}},"created_at":"2026-05-18T00:08:32.203749+00:00","updated_at":"2026-05-18T00:08:32.203749+00:00"}