{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:4OVSY7ARB4E5GLNLQQ3RYDOPMR","short_pith_number":"pith:4OVSY7AR","canonical_record":{"source":{"id":"1503.08792","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2015-03-30T18:56:51Z","cross_cats_sorted":["cs.DM","math.CO","math.LO"],"title_canon_sha256":"213343c22879962af9ef02af0fd717312ff6b53ff808448a42c491d446c998c6","abstract_canon_sha256":"1105503e7978dcea6a647551dd4a767c22cbd4e6f66ae30f291c61b64e15f96b"},"schema_version":"1.0"},"canonical_sha256":"e3ab2c7c110f09d32dab84371c0dcf6476d261fb68d4bcb16bef767483be2b4c","source":{"kind":"arxiv","id":"1503.08792","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1503.08792","created_at":"2026-05-18T02:20:00Z"},{"alias_kind":"arxiv_version","alias_value":"1503.08792v1","created_at":"2026-05-18T02:20:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.08792","created_at":"2026-05-18T02:20:00Z"},{"alias_kind":"pith_short_12","alias_value":"4OVSY7ARB4E5","created_at":"2026-05-18T12:29:05Z"},{"alias_kind":"pith_short_16","alias_value":"4OVSY7ARB4E5GLNL","created_at":"2026-05-18T12:29:05Z"},{"alias_kind":"pith_short_8","alias_value":"4OVSY7AR","created_at":"2026-05-18T12:29:05Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:4OVSY7ARB4E5GLNLQQ3RYDOPMR","target":"record","payload":{"canonical_record":{"source":{"id":"1503.08792","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2015-03-30T18:56:51Z","cross_cats_sorted":["cs.DM","math.CO","math.LO"],"title_canon_sha256":"213343c22879962af9ef02af0fd717312ff6b53ff808448a42c491d446c998c6","abstract_canon_sha256":"1105503e7978dcea6a647551dd4a767c22cbd4e6f66ae30f291c61b64e15f96b"},"schema_version":"1.0"},"canonical_sha256":"e3ab2c7c110f09d32dab84371c0dcf6476d261fb68d4bcb16bef767483be2b4c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:20:00.923160Z","signature_b64":"x0LbH8U+TzctWk5gLQtcCVEkjbuama6N0P7Bw9ziYPjkItSJMDj6D2OlP1eVVTGvH+nhkWAglKO4AIMbEtNDCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e3ab2c7c110f09d32dab84371c0dcf6476d261fb68d4bcb16bef767483be2b4c","last_reissued_at":"2026-05-18T02:20:00.922672Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:20:00.922672Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1503.08792","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-18T02:20:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0iuDBdSuQYs+v+no7YKniXp84x6WAGM7X+T/UOyzHnG6zvQPxYCEFJMe3BHm6QFuF1HY2jiDfodRquljtVofBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T14:36:38.863028Z"},"content_sha256":"74ee48853c9ad391f28a182955f942b2d9ea2447aa02af564f8f8bdaaaafd90a","schema_version":"1.0","event_id":"sha256:74ee48853c9ad391f28a182955f942b2d9ea2447aa02af564f8f8bdaaaafd90a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:4OVSY7ARB4E5GLNLQQ3RYDOPMR","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Graphs Identified by Logics with Counting","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.CO","math.LO"],"primary_cat":"cs.LO","authors_text":"Erkal Selman, Pascal Schweitzer, Sandra Kiefer","submitted_at":"2015-03-30T18:56:51Z","abstract_excerpt":"We classify graphs and, more generally, finite relational structures that are identified by C2, that is, two-variable first-order logic with counting. Using this classification, we show that it can be decided in almost linear time whether a structure is identified by C2. Our classification implies that for every graph identified by this logic, all vertex-colored versions of it are also identified. A similar statement is true for finite relational structures.\n  We provide constructions that solve the inversion problem for finite structures in linear time. This problem has previously been shown "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.08792","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-18T02:20:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YVKn6kvtKqEJKXGTthnL6PHCh1ToKOf0Kkk3o0KmSIFnNrnfy2g/7/8iFb1PzHLdjE/8GkpTAD8T0CCRbPOTDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T14:36:38.863661Z"},"content_sha256":"b8708805bf580a456b7ba994dcc3cd7427d1605706308988fa25244473387017","schema_version":"1.0","event_id":"sha256:b8708805bf580a456b7ba994dcc3cd7427d1605706308988fa25244473387017"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4OVSY7ARB4E5GLNLQQ3RYDOPMR/bundle.json","state_url":"https://pith.science/pith/4OVSY7ARB4E5GLNLQQ3RYDOPMR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4OVSY7ARB4E5GLNLQQ3RYDOPMR/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-05-29T14:36:38Z","links":{"resolver":"https://pith.science/pith/4OVSY7ARB4E5GLNLQQ3RYDOPMR","bundle":"https://pith.science/pith/4OVSY7ARB4E5GLNLQQ3RYDOPMR/bundle.json","state":"https://pith.science/pith/4OVSY7ARB4E5GLNLQQ3RYDOPMR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4OVSY7ARB4E5GLNLQQ3RYDOPMR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:4OVSY7ARB4E5GLNLQQ3RYDOPMR","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":"1105503e7978dcea6a647551dd4a767c22cbd4e6f66ae30f291c61b64e15f96b","cross_cats_sorted":["cs.DM","math.CO","math.LO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2015-03-30T18:56:51Z","title_canon_sha256":"213343c22879962af9ef02af0fd717312ff6b53ff808448a42c491d446c998c6"},"schema_version":"1.0","source":{"id":"1503.08792","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1503.08792","created_at":"2026-05-18T02:20:00Z"},{"alias_kind":"arxiv_version","alias_value":"1503.08792v1","created_at":"2026-05-18T02:20:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.08792","created_at":"2026-05-18T02:20:00Z"},{"alias_kind":"pith_short_12","alias_value":"4OVSY7ARB4E5","created_at":"2026-05-18T12:29:05Z"},{"alias_kind":"pith_short_16","alias_value":"4OVSY7ARB4E5GLNL","created_at":"2026-05-18T12:29:05Z"},{"alias_kind":"pith_short_8","alias_value":"4OVSY7AR","created_at":"2026-05-18T12:29:05Z"}],"graph_snapshots":[{"event_id":"sha256:b8708805bf580a456b7ba994dcc3cd7427d1605706308988fa25244473387017","target":"graph","created_at":"2026-05-18T02:20:00Z","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":"We classify graphs and, more generally, finite relational structures that are identified by C2, that is, two-variable first-order logic with counting. Using this classification, we show that it can be decided in almost linear time whether a structure is identified by C2. Our classification implies that for every graph identified by this logic, all vertex-colored versions of it are also identified. A similar statement is true for finite relational structures.\n  We provide constructions that solve the inversion problem for finite structures in linear time. This problem has previously been shown ","authors_text":"Erkal Selman, Pascal Schweitzer, Sandra Kiefer","cross_cats":["cs.DM","math.CO","math.LO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2015-03-30T18:56:51Z","title":"Graphs Identified by Logics with Counting"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.08792","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:74ee48853c9ad391f28a182955f942b2d9ea2447aa02af564f8f8bdaaaafd90a","target":"record","created_at":"2026-05-18T02:20:00Z","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":"1105503e7978dcea6a647551dd4a767c22cbd4e6f66ae30f291c61b64e15f96b","cross_cats_sorted":["cs.DM","math.CO","math.LO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2015-03-30T18:56:51Z","title_canon_sha256":"213343c22879962af9ef02af0fd717312ff6b53ff808448a42c491d446c998c6"},"schema_version":"1.0","source":{"id":"1503.08792","kind":"arxiv","version":1}},"canonical_sha256":"e3ab2c7c110f09d32dab84371c0dcf6476d261fb68d4bcb16bef767483be2b4c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e3ab2c7c110f09d32dab84371c0dcf6476d261fb68d4bcb16bef767483be2b4c","first_computed_at":"2026-05-18T02:20:00.922672Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:20:00.922672Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"x0LbH8U+TzctWk5gLQtcCVEkjbuama6N0P7Bw9ziYPjkItSJMDj6D2OlP1eVVTGvH+nhkWAglKO4AIMbEtNDCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:20:00.923160Z","signed_message":"canonical_sha256_bytes"},"source_id":"1503.08792","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:74ee48853c9ad391f28a182955f942b2d9ea2447aa02af564f8f8bdaaaafd90a","sha256:b8708805bf580a456b7ba994dcc3cd7427d1605706308988fa25244473387017"],"state_sha256":"daeb79cf067fba1966f9228fb7de4b865f8f39c9efa7801785c54e2e5b5f80b2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Yt8RICUVT3QV6thq3Wl3oiaUPYuJkgjDVt8LrQ1ScxNX39GHaKvfLR1Gx25yt5briIS+5c1fylxgVjAJOgy3Ag==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-29T14:36:38.866526Z","bundle_sha256":"b04d8ae3b9c19f0e710a0f2395bb6e560b4753506097de88bd09a21328e3c1ed"}}