{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:O6U5DCCSJO476ZJ4XZ5UQB6P37","short_pith_number":"pith:O6U5DCCS","schema_version":"1.0","canonical_sha256":"77a9d188524bb9ff653cbe7b4807cfdfc069b41b294e7fbce67246004ac21ca2","source":{"kind":"arxiv","id":"1904.04637","version":1},"attestation_state":"computed","paper":{"title":"The Complexity of Definability by Open First-Order Formulas","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.LO"],"primary_cat":"cs.CC","authors_text":"Carlos Areces, Daniel Penazzi, Miguel Campercholi, Pablo Ventura","submitted_at":"2019-04-09T13:10:24Z","abstract_excerpt":"In this article we formally define and investigate the computational complexity of the Definability Problem for open first-order formulas (i.e., quantifier free first-order formulas) with equality. Given a logic $\\mathbf{\\mathcal{L}}$, the $\\mathbf{\\mathcal{L}}$-Definability Problem for finite structures takes as input a finite structure $\\mathbf{A}$ and a target relation $T$ over the domain of $\\mathbf{A}$, and determines whether there is a formula of $\\mathbf{\\mathcal{L}}$ whose interpretation in $\\mathbf{A}$ coincides with $T$. We show that the complexity of this problem for open first-orde"},"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":"1904.04637","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2019-04-09T13:10:24Z","cross_cats_sorted":["math.LO"],"title_canon_sha256":"f95806657971f21be1a3dd12576fef8b7e7b8743f8e45c7aee14e7dfb0600726","abstract_canon_sha256":"6309d641ff1ce7a5a7eaf4ebae95eadd95de1e59b308574d50f979f9ff0916d3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:48:58.545262Z","signature_b64":"EgEnW183x4iwpRez53Tvddtq5RJ7V7eEf2QqB8pBlTOgI42AYIK70RJ3162dKYfdKqeS7FPDXiE4xbjtRZxUDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"77a9d188524bb9ff653cbe7b4807cfdfc069b41b294e7fbce67246004ac21ca2","last_reissued_at":"2026-05-17T23:48:58.544877Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:48:58.544877Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Complexity of Definability by Open First-Order Formulas","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.LO"],"primary_cat":"cs.CC","authors_text":"Carlos Areces, Daniel Penazzi, Miguel Campercholi, Pablo Ventura","submitted_at":"2019-04-09T13:10:24Z","abstract_excerpt":"In this article we formally define and investigate the computational complexity of the Definability Problem for open first-order formulas (i.e., quantifier free first-order formulas) with equality. Given a logic $\\mathbf{\\mathcal{L}}$, the $\\mathbf{\\mathcal{L}}$-Definability Problem for finite structures takes as input a finite structure $\\mathbf{A}$ and a target relation $T$ over the domain of $\\mathbf{A}$, and determines whether there is a formula of $\\mathbf{\\mathcal{L}}$ whose interpretation in $\\mathbf{A}$ coincides with $T$. We show that the complexity of this problem for open first-orde"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.04637","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":"1904.04637","created_at":"2026-05-17T23:48:58.544939+00:00"},{"alias_kind":"arxiv_version","alias_value":"1904.04637v1","created_at":"2026-05-17T23:48:58.544939+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.04637","created_at":"2026-05-17T23:48:58.544939+00:00"},{"alias_kind":"pith_short_12","alias_value":"O6U5DCCSJO47","created_at":"2026-05-18T12:33:24.271573+00:00"},{"alias_kind":"pith_short_16","alias_value":"O6U5DCCSJO476ZJ4","created_at":"2026-05-18T12:33:24.271573+00:00"},{"alias_kind":"pith_short_8","alias_value":"O6U5DCCS","created_at":"2026-05-18T12:33:24.271573+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/O6U5DCCSJO476ZJ4XZ5UQB6P37","json":"https://pith.science/pith/O6U5DCCSJO476ZJ4XZ5UQB6P37.json","graph_json":"https://pith.science/api/pith-number/O6U5DCCSJO476ZJ4XZ5UQB6P37/graph.json","events_json":"https://pith.science/api/pith-number/O6U5DCCSJO476ZJ4XZ5UQB6P37/events.json","paper":"https://pith.science/paper/O6U5DCCS"},"agent_actions":{"view_html":"https://pith.science/pith/O6U5DCCSJO476ZJ4XZ5UQB6P37","download_json":"https://pith.science/pith/O6U5DCCSJO476ZJ4XZ5UQB6P37.json","view_paper":"https://pith.science/paper/O6U5DCCS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1904.04637&json=true","fetch_graph":"https://pith.science/api/pith-number/O6U5DCCSJO476ZJ4XZ5UQB6P37/graph.json","fetch_events":"https://pith.science/api/pith-number/O6U5DCCSJO476ZJ4XZ5UQB6P37/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/O6U5DCCSJO476ZJ4XZ5UQB6P37/action/timestamp_anchor","attest_storage":"https://pith.science/pith/O6U5DCCSJO476ZJ4XZ5UQB6P37/action/storage_attestation","attest_author":"https://pith.science/pith/O6U5DCCSJO476ZJ4XZ5UQB6P37/action/author_attestation","sign_citation":"https://pith.science/pith/O6U5DCCSJO476ZJ4XZ5UQB6P37/action/citation_signature","submit_replication":"https://pith.science/pith/O6U5DCCSJO476ZJ4XZ5UQB6P37/action/replication_record"}},"created_at":"2026-05-17T23:48:58.544939+00:00","updated_at":"2026-05-17T23:48:58.544939+00:00"}