{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:OWFHHD46TOFQTR3AE7BOLEXUCE","short_pith_number":"pith:OWFHHD46","schema_version":"1.0","canonical_sha256":"758a738f9e9b8b09c76027c2e592f41123c67630c5e467d74ecdbd55478824a6","source":{"kind":"arxiv","id":"2604.27693","version":2},"attestation_state":"computed","paper":{"title":"Order-invariant cluster first-order logic on graph classes of bounded degree","license":"http://creativecommons.org/licenses/by/4.0/","headline":"Order-invariant cluster first-order logic has the same expressive power as plain first-order logic on bounded-degree graph classes.","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Fatemeh Ghasemi, Julien Grange","submitted_at":"2026-04-30T10:34:30Z","abstract_excerpt":"We introduce a new logic, called \\emph{cluster first-order logic}, a restricted fragment of first-order logic specifically designed to study order invariance. An order-invariant formula is one on a vocabulary that contains an order; however, whether a structure satisfies it or not is independent of the interpretation of the order.\n  We show that while order-invariant cluster first-order logic can define properties outside the scope of plain first-order logic in general, its expressive power is included in that of first-order logic when it comes to classes of bounded degree.\n  We establish this"},"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":"2604.27693","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LO","submitted_at":"2026-04-30T10:34:30Z","cross_cats_sorted":[],"title_canon_sha256":"ed4f746fd3a7b37dd97e132c47741719070d68066771f6b4d5e1225471f72b7d","abstract_canon_sha256":"85d34506d4bca81c4f2b1efdd1023bdcb74d137a05f50ef7e681c99a69109f1f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-26T01:15:52.860549Z","signature_b64":"U4F+6pFhEq67n/LH+fmcJ2ScuelC3sOttOKUR0nyvzymfee/wgxp3ZUsdJLrzsBz59RwLLsep6L7CAOivkTvDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"758a738f9e9b8b09c76027c2e592f41123c67630c5e467d74ecdbd55478824a6","last_reissued_at":"2026-06-26T01:15:52.860206Z","signature_status":"signed_v1","first_computed_at":"2026-06-26T01:15:52.860206Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Order-invariant cluster first-order logic on graph classes of bounded degree","license":"http://creativecommons.org/licenses/by/4.0/","headline":"Order-invariant cluster first-order logic has the same expressive power as plain first-order logic on bounded-degree graph classes.","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Fatemeh Ghasemi, Julien Grange","submitted_at":"2026-04-30T10:34:30Z","abstract_excerpt":"We introduce a new logic, called \\emph{cluster first-order logic}, a restricted fragment of first-order logic specifically designed to study order invariance. An order-invariant formula is one on a vocabulary that contains an order; however, whether a structure satisfies it or not is independent of the interpretation of the order.\n  We show that while order-invariant cluster first-order logic can define properties outside the scope of plain first-order logic in general, its expressive power is included in that of first-order logic when it comes to classes of bounded degree.\n  We establish this"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"We show that while order-invariant cluster first-order logic can define properties outside the scope of plain first-order logic in general, its expressive power is included in that of first-order logic when it comes to classes of bounded degree.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"That there exist linear orders on the universes of any two sufficiently similar bounded-degree structures such that the expanded structures remain similar (i.e., the local-to-global similarity-preserving construction succeeds).","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"Order-invariant cluster first-order logic has the same expressive power as first-order logic on every class of graphs with bounded degree.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"Order-invariant cluster first-order logic has the same expressive power as plain first-order logic on bounded-degree graph classes.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"2c64ecc18e206e6adde31802461691185bc7d8b6f5f0ea51c362f982b08837d8"},"source":{"id":"2604.27693","kind":"arxiv","version":2},"verdict":{"id":"ade94221-8a4b-4afb-b8c6-0d88521815d1","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-07T05:31:33.081076Z","strongest_claim":"We show that while order-invariant cluster first-order logic can define properties outside the scope of plain first-order logic in general, its expressive power is included in that of first-order logic when it comes to classes of bounded degree.","one_line_summary":"Order-invariant cluster first-order logic has the same expressive power as first-order logic on every class of graphs with bounded degree.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"That there exist linear orders on the universes of any two sufficiently similar bounded-degree structures such that the expanded structures remain similar (i.e., the local-to-global similarity-preserving construction succeeds).","pith_extraction_headline":"Order-invariant cluster first-order logic has the same expressive power as plain first-order logic on bounded-degree graph classes."},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2604.27693/integrity.json","findings":[],"available":true,"detectors_run":[{"name":"ai_meta_artifact","ran_at":"2026-05-20T21:41:08.088212Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"doi_compliance","ran_at":"2026-05-19T19:01:48.143778Z","status":"completed","version":"1.0.0","findings_count":0}],"snapshot_sha256":"99eb766c8c6314ae8ebf72b6b5209d59f62b9758fd6e29b8b8540f061fd25f0d"},"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":"2604.27693","created_at":"2026-06-26T01:15:52.860258+00:00"},{"alias_kind":"arxiv_version","alias_value":"2604.27693v2","created_at":"2026-06-26T01:15:52.860258+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2604.27693","created_at":"2026-06-26T01:15:52.860258+00:00"},{"alias_kind":"pith_short_12","alias_value":"OWFHHD46TOFQ","created_at":"2026-06-26T01:15:52.860258+00:00"},{"alias_kind":"pith_short_16","alias_value":"OWFHHD46TOFQTR3A","created_at":"2026-06-26T01:15:52.860258+00:00"},{"alias_kind":"pith_short_8","alias_value":"OWFHHD46","created_at":"2026-06-26T01:15:52.860258+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/OWFHHD46TOFQTR3AE7BOLEXUCE","json":"https://pith.science/pith/OWFHHD46TOFQTR3AE7BOLEXUCE.json","graph_json":"https://pith.science/api/pith-number/OWFHHD46TOFQTR3AE7BOLEXUCE/graph.json","events_json":"https://pith.science/api/pith-number/OWFHHD46TOFQTR3AE7BOLEXUCE/events.json","paper":"https://pith.science/paper/OWFHHD46"},"agent_actions":{"view_html":"https://pith.science/pith/OWFHHD46TOFQTR3AE7BOLEXUCE","download_json":"https://pith.science/pith/OWFHHD46TOFQTR3AE7BOLEXUCE.json","view_paper":"https://pith.science/paper/OWFHHD46","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2604.27693&json=true","fetch_graph":"https://pith.science/api/pith-number/OWFHHD46TOFQTR3AE7BOLEXUCE/graph.json","fetch_events":"https://pith.science/api/pith-number/OWFHHD46TOFQTR3AE7BOLEXUCE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OWFHHD46TOFQTR3AE7BOLEXUCE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OWFHHD46TOFQTR3AE7BOLEXUCE/action/storage_attestation","attest_author":"https://pith.science/pith/OWFHHD46TOFQTR3AE7BOLEXUCE/action/author_attestation","sign_citation":"https://pith.science/pith/OWFHHD46TOFQTR3AE7BOLEXUCE/action/citation_signature","submit_replication":"https://pith.science/pith/OWFHHD46TOFQTR3AE7BOLEXUCE/action/replication_record"}},"created_at":"2026-06-26T01:15:52.860258+00:00","updated_at":"2026-06-26T01:15:52.860258+00:00"}