{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2005:UYCY2H2GV2GLXMJAFXITWXDRNW","short_pith_number":"pith:UYCY2H2G","schema_version":"1.0","canonical_sha256":"a6058d1f46ae8cbbb1202dd13b5c716db395fbf1a685a61f3f6fd232651d56bb","source":{"kind":"arxiv","id":"cs/0502047","version":3},"attestation_state":"computed","paper":{"title":"The succinctness of first-order logic on linear orders","license":"","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Martin Grohe, Nicole Schweikardt","submitted_at":"2005-02-09T11:00:12Z","abstract_excerpt":"Succinctness is a natural measure for comparing the strength of different logics. Intuitively, a logic L_1 is more succinct than another logic L_2 if all properties that can be expressed in L_2 can be expressed in L_1 by formulas of (approximately) the same size, but some properties can be expressed in L_1 by (significantly) smaller formulas.\n  We study the succinctness of logics on linear orders. Our first theorem is concerned with the finite variable fragments of first-order logic. We prove that:\n  (i) Up to a polynomial factor, the 2- and the 3-variable fragments of first-order logic on lin"},"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":"cs/0502047","kind":"arxiv","version":3},"metadata":{"license":"","primary_cat":"cs.LO","submitted_at":"2005-02-09T11:00:12Z","cross_cats_sorted":[],"title_canon_sha256":"c4a9043ced14b51788bdcc9d9a2476241b42acc31a8af98836f174e6b6016341","abstract_canon_sha256":"10831a0f080074a4bb3a2352d0d688eff1bc74f435a98c478f4aca9d5f5c76de"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:53:03.531925Z","signature_b64":"fZA5eiQx+Fe11IM7hFsNMr6Y3m8wCA9R7QbgYG560oNUOWba6v04tEGXUtQj0TbvtmIebjTDtiyW/qZcykpOAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a6058d1f46ae8cbbb1202dd13b5c716db395fbf1a685a61f3f6fd232651d56bb","last_reissued_at":"2026-05-18T00:53:03.531512Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:53:03.531512Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The succinctness of first-order logic on linear orders","license":"","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Martin Grohe, Nicole Schweikardt","submitted_at":"2005-02-09T11:00:12Z","abstract_excerpt":"Succinctness is a natural measure for comparing the strength of different logics. Intuitively, a logic L_1 is more succinct than another logic L_2 if all properties that can be expressed in L_2 can be expressed in L_1 by formulas of (approximately) the same size, but some properties can be expressed in L_1 by (significantly) smaller formulas.\n  We study the succinctness of logics on linear orders. Our first theorem is concerned with the finite variable fragments of first-order logic. We prove that:\n  (i) Up to a polynomial factor, the 2- and the 3-variable fragments of first-order logic on lin"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"cs/0502047","kind":"arxiv","version":3},"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":"cs/0502047","created_at":"2026-05-18T00:53:03.531569+00:00"},{"alias_kind":"arxiv_version","alias_value":"cs/0502047v3","created_at":"2026-05-18T00:53:03.531569+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cs/0502047","created_at":"2026-05-18T00:53:03.531569+00:00"},{"alias_kind":"pith_short_12","alias_value":"UYCY2H2GV2GL","created_at":"2026-05-18T12:25:53.939244+00:00"},{"alias_kind":"pith_short_16","alias_value":"UYCY2H2GV2GLXMJA","created_at":"2026-05-18T12:25:53.939244+00:00"},{"alias_kind":"pith_short_8","alias_value":"UYCY2H2G","created_at":"2026-05-18T12:25:53.939244+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/UYCY2H2GV2GLXMJAFXITWXDRNW","json":"https://pith.science/pith/UYCY2H2GV2GLXMJAFXITWXDRNW.json","graph_json":"https://pith.science/api/pith-number/UYCY2H2GV2GLXMJAFXITWXDRNW/graph.json","events_json":"https://pith.science/api/pith-number/UYCY2H2GV2GLXMJAFXITWXDRNW/events.json","paper":"https://pith.science/paper/UYCY2H2G"},"agent_actions":{"view_html":"https://pith.science/pith/UYCY2H2GV2GLXMJAFXITWXDRNW","download_json":"https://pith.science/pith/UYCY2H2GV2GLXMJAFXITWXDRNW.json","view_paper":"https://pith.science/paper/UYCY2H2G","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=cs/0502047&json=true","fetch_graph":"https://pith.science/api/pith-number/UYCY2H2GV2GLXMJAFXITWXDRNW/graph.json","fetch_events":"https://pith.science/api/pith-number/UYCY2H2GV2GLXMJAFXITWXDRNW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UYCY2H2GV2GLXMJAFXITWXDRNW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UYCY2H2GV2GLXMJAFXITWXDRNW/action/storage_attestation","attest_author":"https://pith.science/pith/UYCY2H2GV2GLXMJAFXITWXDRNW/action/author_attestation","sign_citation":"https://pith.science/pith/UYCY2H2GV2GLXMJAFXITWXDRNW/action/citation_signature","submit_replication":"https://pith.science/pith/UYCY2H2GV2GLXMJAFXITWXDRNW/action/replication_record"}},"created_at":"2026-05-18T00:53:03.531569+00:00","updated_at":"2026-05-18T00:53:03.531569+00:00"}