{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:OWFHHD46TOFQTR3AE7BOLEXUCE","short_pith_number":"pith:OWFHHD46","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"},"canonical_sha256":"758a738f9e9b8b09c76027c2e592f41123c67630c5e467d74ecdbd55478824a6","source":{"kind":"arxiv","id":"2604.27693","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2604.27693","created_at":"2026-06-26T01:15:52Z"},{"alias_kind":"arxiv_version","alias_value":"2604.27693v2","created_at":"2026-06-26T01:15:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2604.27693","created_at":"2026-06-26T01:15:52Z"},{"alias_kind":"pith_short_12","alias_value":"OWFHHD46TOFQ","created_at":"2026-06-26T01:15:52Z"},{"alias_kind":"pith_short_16","alias_value":"OWFHHD46TOFQTR3A","created_at":"2026-06-26T01:15:52Z"},{"alias_kind":"pith_short_8","alias_value":"OWFHHD46","created_at":"2026-06-26T01:15:52Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:OWFHHD46TOFQTR3AE7BOLEXUCE","target":"record","payload":{"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"},"canonical_sha256":"758a738f9e9b8b09c76027c2e592f41123c67630c5e467d74ecdbd55478824a6","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"},"source_kind":"arxiv","source_id":"2604.27693","source_version":2,"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-06-26T01:15:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"r0dygzMLro2srpYnFqf8z2IbmfAlhCUjaWd3ikmB4f0QM+3MbnvVqd8F9ErZ/kqQHA1kh4ZDgqHNhOK4KoivAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-19T15:08:25.088653Z"},"content_sha256":"6b1e0ab9604382fbc04839965e310e9d9d7a11337ddd77f12e02aa150d5191b8","schema_version":"1.0","event_id":"sha256:6b1e0ab9604382fbc04839965e310e9d9d7a11337ddd77f12e02aa150d5191b8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:OWFHHD46TOFQTR3AE7BOLEXUCE","target":"graph","payload":{"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"},"verdict_id":"ade94221-8a4b-4afb-b8c6-0d88521815d1"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-06-26T01:15:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VDvP96gnr1Q6RWj3nA7wVfda0pXnKmnBcxWDAXvZaboGLYvwD2OT2adggneNxpVZYhGPKy0TolJeW4kSkwJdCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-19T15:08:25.089131Z"},"content_sha256":"6f65f27407551e3d15598cfac9ce43f29e61f5bc9470d2f20e9ac634fdd212cf","schema_version":"1.0","event_id":"sha256:6f65f27407551e3d15598cfac9ce43f29e61f5bc9470d2f20e9ac634fdd212cf"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OWFHHD46TOFQTR3AE7BOLEXUCE/bundle.json","state_url":"https://pith.science/pith/OWFHHD46TOFQTR3AE7BOLEXUCE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OWFHHD46TOFQTR3AE7BOLEXUCE/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-07-19T15:08:25Z","links":{"resolver":"https://pith.science/pith/OWFHHD46TOFQTR3AE7BOLEXUCE","bundle":"https://pith.science/pith/OWFHHD46TOFQTR3AE7BOLEXUCE/bundle.json","state":"https://pith.science/pith/OWFHHD46TOFQTR3AE7BOLEXUCE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OWFHHD46TOFQTR3AE7BOLEXUCE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:OWFHHD46TOFQTR3AE7BOLEXUCE","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":"85d34506d4bca81c4f2b1efdd1023bdcb74d137a05f50ef7e681c99a69109f1f","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LO","submitted_at":"2026-04-30T10:34:30Z","title_canon_sha256":"ed4f746fd3a7b37dd97e132c47741719070d68066771f6b4d5e1225471f72b7d"},"schema_version":"1.0","source":{"id":"2604.27693","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2604.27693","created_at":"2026-06-26T01:15:52Z"},{"alias_kind":"arxiv_version","alias_value":"2604.27693v2","created_at":"2026-06-26T01:15:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2604.27693","created_at":"2026-06-26T01:15:52Z"},{"alias_kind":"pith_short_12","alias_value":"OWFHHD46TOFQ","created_at":"2026-06-26T01:15:52Z"},{"alias_kind":"pith_short_16","alias_value":"OWFHHD46TOFQTR3A","created_at":"2026-06-26T01:15:52Z"},{"alias_kind":"pith_short_8","alias_value":"OWFHHD46","created_at":"2026-06-26T01:15:52Z"}],"graph_snapshots":[{"event_id":"sha256:6f65f27407551e3d15598cfac9ce43f29e61f5bc9470d2f20e9ac634fdd212cf","target":"graph","created_at":"2026-06-26T01:15:52Z","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":4,"items":[{"attestation":"unclaimed","claim_id":"C1","kind":"strongest_claim","source":"verdict.strongest_claim","status":"machine_extracted","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."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","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)."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"Order-invariant cluster first-order logic has the same expressive power as first-order logic on every class of graphs with bounded degree."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"Order-invariant cluster first-order logic has the same expressive power as plain first-order logic on bounded-degree graph classes."}],"snapshot_sha256":"2c64ecc18e206e6adde31802461691185bc7d8b6f5f0ea51c362f982b08837d8"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[{"findings_count":0,"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"}],"endpoint":"/pith/2604.27693/integrity.json","findings":[],"snapshot_sha256":"99eb766c8c6314ae8ebf72b6b5209d59f62b9758fd6e29b8b8540f061fd25f0d","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Fatemeh Ghasemi, Julien Grange","cross_cats":[],"headline":"Order-invariant cluster first-order logic has the same expressive power as plain first-order logic on bounded-degree graph classes.","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LO","submitted_at":"2026-04-30T10:34:30Z","title":"Order-invariant cluster first-order logic on graph classes of bounded degree"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2604.27693","kind":"arxiv","version":2},"verdict":{"created_at":"2026-05-07T05:31:33.081076Z","id":"ade94221-8a4b-4afb-b8c6-0d88521815d1","model_set":{"reader":"grok-4.3"},"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","pith_extraction_headline":"Order-invariant cluster first-order logic has the same expressive power as plain first-order logic on bounded-degree graph classes.","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.","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)."}},"verdict_id":"ade94221-8a4b-4afb-b8c6-0d88521815d1"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:6b1e0ab9604382fbc04839965e310e9d9d7a11337ddd77f12e02aa150d5191b8","target":"record","created_at":"2026-06-26T01:15:52Z","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":"85d34506d4bca81c4f2b1efdd1023bdcb74d137a05f50ef7e681c99a69109f1f","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LO","submitted_at":"2026-04-30T10:34:30Z","title_canon_sha256":"ed4f746fd3a7b37dd97e132c47741719070d68066771f6b4d5e1225471f72b7d"},"schema_version":"1.0","source":{"id":"2604.27693","kind":"arxiv","version":2}},"canonical_sha256":"758a738f9e9b8b09c76027c2e592f41123c67630c5e467d74ecdbd55478824a6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"758a738f9e9b8b09c76027c2e592f41123c67630c5e467d74ecdbd55478824a6","first_computed_at":"2026-06-26T01:15:52.860206Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-26T01:15:52.860206Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"U4F+6pFhEq67n/LH+fmcJ2ScuelC3sOttOKUR0nyvzymfee/wgxp3ZUsdJLrzsBz59RwLLsep6L7CAOivkTvDg==","signature_status":"signed_v1","signed_at":"2026-06-26T01:15:52.860549Z","signed_message":"canonical_sha256_bytes"},"source_id":"2604.27693","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6b1e0ab9604382fbc04839965e310e9d9d7a11337ddd77f12e02aa150d5191b8","sha256:6f65f27407551e3d15598cfac9ce43f29e61f5bc9470d2f20e9ac634fdd212cf"],"state_sha256":"aa0e9b324dcac879afb40c071a4f473c293f3e58ec877470888dc204c9c6822a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"k5eanxNq9+tKjHlF4DM0BXCp11h7/NGPB/QGipcgrkQ/UnMw0nWfkN8GFLczvBNitOg+ItxcFMqHumFMZKh9Aw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-19T15:08:25.092676Z","bundle_sha256":"b414e77cad9fba9e16e90109378eed3e891025ac51bf83cc9ae7f5dd67680e28"}}