{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:O6U5DCCSJO476ZJ4XZ5UQB6P37","short_pith_number":"pith:O6U5DCCS","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"},"canonical_sha256":"77a9d188524bb9ff653cbe7b4807cfdfc069b41b294e7fbce67246004ac21ca2","source":{"kind":"arxiv","id":"1904.04637","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1904.04637","created_at":"2026-05-17T23:48:58Z"},{"alias_kind":"arxiv_version","alias_value":"1904.04637v1","created_at":"2026-05-17T23:48:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.04637","created_at":"2026-05-17T23:48:58Z"},{"alias_kind":"pith_short_12","alias_value":"O6U5DCCSJO47","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_16","alias_value":"O6U5DCCSJO476ZJ4","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_8","alias_value":"O6U5DCCS","created_at":"2026-05-18T12:33:24Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:O6U5DCCSJO476ZJ4XZ5UQB6P37","target":"record","payload":{"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"},"canonical_sha256":"77a9d188524bb9ff653cbe7b4807cfdfc069b41b294e7fbce67246004ac21ca2","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"},"source_kind":"arxiv","source_id":"1904.04637","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-17T23:48:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"g+y+pMOmARAz+LzSpRbEcCPOcsHkQR3clxNAE+uC5CgjoO1qWCtj2BYVGZjLpQI4nmfg2ZIZlOCPmUYVrFw3Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T08:56:43.296667Z"},"content_sha256":"a61b0195425f16aa953c2d49f7fa53f2ee745ca9c386555769ef1832e0db8035","schema_version":"1.0","event_id":"sha256:a61b0195425f16aa953c2d49f7fa53f2ee745ca9c386555769ef1832e0db8035"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:O6U5DCCSJO476ZJ4XZ5UQB6P37","target":"graph","payload":{"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"},"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-17T23:48:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uwkd0+fkmaBRs3PhMiLk3x3fRLOU5vkE/5Az6+xaK+5q68LyjFUgrw32jN1hra85i8O9dv/6HuWmDUoyzHC5BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T08:56:43.296990Z"},"content_sha256":"31844f3c7a840c11aeb3a4f8b89ed7340f2d1e55b4f0425bc43e0db7f3f9443e","schema_version":"1.0","event_id":"sha256:31844f3c7a840c11aeb3a4f8b89ed7340f2d1e55b4f0425bc43e0db7f3f9443e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/O6U5DCCSJO476ZJ4XZ5UQB6P37/bundle.json","state_url":"https://pith.science/pith/O6U5DCCSJO476ZJ4XZ5UQB6P37/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/O6U5DCCSJO476ZJ4XZ5UQB6P37/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-27T08:56:43Z","links":{"resolver":"https://pith.science/pith/O6U5DCCSJO476ZJ4XZ5UQB6P37","bundle":"https://pith.science/pith/O6U5DCCSJO476ZJ4XZ5UQB6P37/bundle.json","state":"https://pith.science/pith/O6U5DCCSJO476ZJ4XZ5UQB6P37/state.json","well_known_bundle":"https://pith.science/.well-known/pith/O6U5DCCSJO476ZJ4XZ5UQB6P37/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:O6U5DCCSJO476ZJ4XZ5UQB6P37","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":"6309d641ff1ce7a5a7eaf4ebae95eadd95de1e59b308574d50f979f9ff0916d3","cross_cats_sorted":["math.LO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2019-04-09T13:10:24Z","title_canon_sha256":"f95806657971f21be1a3dd12576fef8b7e7b8743f8e45c7aee14e7dfb0600726"},"schema_version":"1.0","source":{"id":"1904.04637","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1904.04637","created_at":"2026-05-17T23:48:58Z"},{"alias_kind":"arxiv_version","alias_value":"1904.04637v1","created_at":"2026-05-17T23:48:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.04637","created_at":"2026-05-17T23:48:58Z"},{"alias_kind":"pith_short_12","alias_value":"O6U5DCCSJO47","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_16","alias_value":"O6U5DCCSJO476ZJ4","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_8","alias_value":"O6U5DCCS","created_at":"2026-05-18T12:33:24Z"}],"graph_snapshots":[{"event_id":"sha256:31844f3c7a840c11aeb3a4f8b89ed7340f2d1e55b4f0425bc43e0db7f3f9443e","target":"graph","created_at":"2026-05-17T23:48:58Z","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":"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","authors_text":"Carlos Areces, Daniel Penazzi, Miguel Campercholi, Pablo Ventura","cross_cats":["math.LO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2019-04-09T13:10:24Z","title":"The Complexity of Definability by Open First-Order Formulas"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.04637","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:a61b0195425f16aa953c2d49f7fa53f2ee745ca9c386555769ef1832e0db8035","target":"record","created_at":"2026-05-17T23:48:58Z","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":"6309d641ff1ce7a5a7eaf4ebae95eadd95de1e59b308574d50f979f9ff0916d3","cross_cats_sorted":["math.LO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2019-04-09T13:10:24Z","title_canon_sha256":"f95806657971f21be1a3dd12576fef8b7e7b8743f8e45c7aee14e7dfb0600726"},"schema_version":"1.0","source":{"id":"1904.04637","kind":"arxiv","version":1}},"canonical_sha256":"77a9d188524bb9ff653cbe7b4807cfdfc069b41b294e7fbce67246004ac21ca2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"77a9d188524bb9ff653cbe7b4807cfdfc069b41b294e7fbce67246004ac21ca2","first_computed_at":"2026-05-17T23:48:58.544877Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:48:58.544877Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"EgEnW183x4iwpRez53Tvddtq5RJ7V7eEf2QqB8pBlTOgI42AYIK70RJ3162dKYfdKqeS7FPDXiE4xbjtRZxUDg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:48:58.545262Z","signed_message":"canonical_sha256_bytes"},"source_id":"1904.04637","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a61b0195425f16aa953c2d49f7fa53f2ee745ca9c386555769ef1832e0db8035","sha256:31844f3c7a840c11aeb3a4f8b89ed7340f2d1e55b4f0425bc43e0db7f3f9443e"],"state_sha256":"649efb42655e4ca3736629115b54159df389b5472095807651170a405b09589d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"USm0hhCxPSggSAgVMMUce53ILsgqUNvC8OZrzd56/dK/X9DhLBEZBBrVmNL4ZTN0MS9URkSIms5WaaMnjIYqBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-27T08:56:43.298824Z","bundle_sha256":"bbeb1922930a803e65bd4df3d755511262846f6e0b8b9bb31a2bae0fb5b2df02"}}