{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:WRAJLCTPHO3Y5LWDEL25SXI33I","short_pith_number":"pith:WRAJLCTP","schema_version":"1.0","canonical_sha256":"b440958a6f3bb78eaec322f5d95d1bda1bf8f8d2ca1e1f576656d4fe91565d4c","source":{"kind":"arxiv","id":"1507.05175","version":2},"attestation_state":"computed","paper":{"title":"Finite-Degree Predicates and Two-Variable First-Order Logic","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Charles Paperman","submitted_at":"2015-07-18T11:54:48Z","abstract_excerpt":"We consider two-variable first-order logic on finite words with a fixed number of quantifier alternations. We show that all languages with a neutral letter definable using the order and finite-degree predicates are also definable with the order predicate only. From this result we derive the separation of the alternation hierarchy of two-variable logic on this signature."},"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":"1507.05175","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2015-07-18T11:54:48Z","cross_cats_sorted":[],"title_canon_sha256":"9488493284bc9be93ad1a3eff9c98e7be0c53496fd66a434c07751c81e9f075a","abstract_canon_sha256":"f112d6e32c4d3c693f810ac2d3d4fbe9351ad54fc07f84b7112f2955e55d9bc9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:36:08.960418Z","signature_b64":"FruH2Yf4PYl8Y61hon8FS0sm02wZbkBTyDeEsgq+YoJvYq72sE2V7cxO8pgSr1CeKRpfdeSYf3UMN1wQbx0+DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b440958a6f3bb78eaec322f5d95d1bda1bf8f8d2ca1e1f576656d4fe91565d4c","last_reissued_at":"2026-05-18T01:36:08.960001Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:36:08.960001Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Finite-Degree Predicates and Two-Variable First-Order Logic","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Charles Paperman","submitted_at":"2015-07-18T11:54:48Z","abstract_excerpt":"We consider two-variable first-order logic on finite words with a fixed number of quantifier alternations. We show that all languages with a neutral letter definable using the order and finite-degree predicates are also definable with the order predicate only. From this result we derive the separation of the alternation hierarchy of two-variable logic on this signature."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.05175","kind":"arxiv","version":2},"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":"1507.05175","created_at":"2026-05-18T01:36:08.960063+00:00"},{"alias_kind":"arxiv_version","alias_value":"1507.05175v2","created_at":"2026-05-18T01:36:08.960063+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.05175","created_at":"2026-05-18T01:36:08.960063+00:00"},{"alias_kind":"pith_short_12","alias_value":"WRAJLCTPHO3Y","created_at":"2026-05-18T12:29:47.479230+00:00"},{"alias_kind":"pith_short_16","alias_value":"WRAJLCTPHO3Y5LWD","created_at":"2026-05-18T12:29:47.479230+00:00"},{"alias_kind":"pith_short_8","alias_value":"WRAJLCTP","created_at":"2026-05-18T12:29:47.479230+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/WRAJLCTPHO3Y5LWDEL25SXI33I","json":"https://pith.science/pith/WRAJLCTPHO3Y5LWDEL25SXI33I.json","graph_json":"https://pith.science/api/pith-number/WRAJLCTPHO3Y5LWDEL25SXI33I/graph.json","events_json":"https://pith.science/api/pith-number/WRAJLCTPHO3Y5LWDEL25SXI33I/events.json","paper":"https://pith.science/paper/WRAJLCTP"},"agent_actions":{"view_html":"https://pith.science/pith/WRAJLCTPHO3Y5LWDEL25SXI33I","download_json":"https://pith.science/pith/WRAJLCTPHO3Y5LWDEL25SXI33I.json","view_paper":"https://pith.science/paper/WRAJLCTP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1507.05175&json=true","fetch_graph":"https://pith.science/api/pith-number/WRAJLCTPHO3Y5LWDEL25SXI33I/graph.json","fetch_events":"https://pith.science/api/pith-number/WRAJLCTPHO3Y5LWDEL25SXI33I/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WRAJLCTPHO3Y5LWDEL25SXI33I/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WRAJLCTPHO3Y5LWDEL25SXI33I/action/storage_attestation","attest_author":"https://pith.science/pith/WRAJLCTPHO3Y5LWDEL25SXI33I/action/author_attestation","sign_citation":"https://pith.science/pith/WRAJLCTPHO3Y5LWDEL25SXI33I/action/citation_signature","submit_replication":"https://pith.science/pith/WRAJLCTPHO3Y5LWDEL25SXI33I/action/replication_record"}},"created_at":"2026-05-18T01:36:08.960063+00:00","updated_at":"2026-05-18T01:36:08.960063+00:00"}