{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:3SIUXXIQQPDPS27KHGIS7MFZME","short_pith_number":"pith:3SIUXXIQ","canonical_record":{"source":{"id":"1207.4067","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.LO","submitted_at":"2012-07-17T17:04:56Z","cross_cats_sorted":[],"title_canon_sha256":"38d518d9be67ca9073f57a68447082e86d90fbe4b13c6c52cf1a99d49522b23d","abstract_canon_sha256":"f2365503cecbd7063311886b74290b8299d359edc9cfa32d3c69f04d6bbc3cc5"},"schema_version":"1.0"},"canonical_sha256":"dc914bdd1083c6f96bea39912fb0b96130788d9b3b923c2cf428ac703f8d3476","source":{"kind":"arxiv","id":"1207.4067","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1207.4067","created_at":"2026-05-18T03:28:17Z"},{"alias_kind":"arxiv_version","alias_value":"1207.4067v2","created_at":"2026-05-18T03:28:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.4067","created_at":"2026-05-18T03:28:17Z"},{"alias_kind":"pith_short_12","alias_value":"3SIUXXIQQPDP","created_at":"2026-05-18T12:26:53Z"},{"alias_kind":"pith_short_16","alias_value":"3SIUXXIQQPDPS27K","created_at":"2026-05-18T12:26:53Z"},{"alias_kind":"pith_short_8","alias_value":"3SIUXXIQ","created_at":"2026-05-18T12:26:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:3SIUXXIQQPDPS27KHGIS7MFZME","target":"record","payload":{"canonical_record":{"source":{"id":"1207.4067","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.LO","submitted_at":"2012-07-17T17:04:56Z","cross_cats_sorted":[],"title_canon_sha256":"38d518d9be67ca9073f57a68447082e86d90fbe4b13c6c52cf1a99d49522b23d","abstract_canon_sha256":"f2365503cecbd7063311886b74290b8299d359edc9cfa32d3c69f04d6bbc3cc5"},"schema_version":"1.0"},"canonical_sha256":"dc914bdd1083c6f96bea39912fb0b96130788d9b3b923c2cf428ac703f8d3476","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:28:17.451374Z","signature_b64":"YYFOCBU5ypByrNIBotQNLIAQkv8oBO8Kgjg9CKunbucA/GCKKdDaS2oB8mhNKv305kBg1qDzpDHyXno7M1a1DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dc914bdd1083c6f96bea39912fb0b96130788d9b3b923c2cf428ac703f8d3476","last_reissued_at":"2026-05-18T03:28:17.450620Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:28:17.450620Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1207.4067","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-05-18T03:28:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XtLb532zLzvw+9J8pWzII89Qpm4o0rJmGLWsfpk1lALtrBFIXqqPFiL5CrQP26w7X1H+fhFm2dGCM/22+iQQAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T18:09:00.219208Z"},"content_sha256":"09a82999eb2d4518bdd9288dcb337302a7c7d16eff545d2f6335e74b8dd152af","schema_version":"1.0","event_id":"sha256:09a82999eb2d4518bdd9288dcb337302a7c7d16eff545d2f6335e74b8dd152af"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:3SIUXXIQQPDPS27KHGIS7MFZME","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A note on noncompact logics","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.LO","authors_text":"Vera Koponen","submitted_at":"2012-07-17T17:04:56Z","abstract_excerpt":"A condition, in two variants, is given such that if a property P satisfies this condition, then every logic which is at least as strong as first-order logic and can express P fails to have the compactness property. The result is used to prove that for a number of natural properties P speaking about automorphism groups, every logic which is at least as strong as first-order logic and can express P fails to have the compactness property. The basic idea underlying the results and examples presented here is that, using results from random graph theory, it is possible to construct a countable first"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.4067","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"},"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-18T03:28:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xtVU0u+c4L6NOCFNi7bBreK8HrvOjt4r/kynhzewVT7Ht8K0CE4EuWhk3SguWZEshlYlWTn0qMs6vf9S+xMbDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T18:09:00.219575Z"},"content_sha256":"b921aa3e5a0cd0013c3f83ab7fda453d301ab27e55684d51596c323801fe3b0b","schema_version":"1.0","event_id":"sha256:b921aa3e5a0cd0013c3f83ab7fda453d301ab27e55684d51596c323801fe3b0b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3SIUXXIQQPDPS27KHGIS7MFZME/bundle.json","state_url":"https://pith.science/pith/3SIUXXIQQPDPS27KHGIS7MFZME/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3SIUXXIQQPDPS27KHGIS7MFZME/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-06-24T18:09:00Z","links":{"resolver":"https://pith.science/pith/3SIUXXIQQPDPS27KHGIS7MFZME","bundle":"https://pith.science/pith/3SIUXXIQQPDPS27KHGIS7MFZME/bundle.json","state":"https://pith.science/pith/3SIUXXIQQPDPS27KHGIS7MFZME/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3SIUXXIQQPDPS27KHGIS7MFZME/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:3SIUXXIQQPDPS27KHGIS7MFZME","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":"f2365503cecbd7063311886b74290b8299d359edc9cfa32d3c69f04d6bbc3cc5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.LO","submitted_at":"2012-07-17T17:04:56Z","title_canon_sha256":"38d518d9be67ca9073f57a68447082e86d90fbe4b13c6c52cf1a99d49522b23d"},"schema_version":"1.0","source":{"id":"1207.4067","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1207.4067","created_at":"2026-05-18T03:28:17Z"},{"alias_kind":"arxiv_version","alias_value":"1207.4067v2","created_at":"2026-05-18T03:28:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.4067","created_at":"2026-05-18T03:28:17Z"},{"alias_kind":"pith_short_12","alias_value":"3SIUXXIQQPDP","created_at":"2026-05-18T12:26:53Z"},{"alias_kind":"pith_short_16","alias_value":"3SIUXXIQQPDPS27K","created_at":"2026-05-18T12:26:53Z"},{"alias_kind":"pith_short_8","alias_value":"3SIUXXIQ","created_at":"2026-05-18T12:26:53Z"}],"graph_snapshots":[{"event_id":"sha256:b921aa3e5a0cd0013c3f83ab7fda453d301ab27e55684d51596c323801fe3b0b","target":"graph","created_at":"2026-05-18T03:28:17Z","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":"A condition, in two variants, is given such that if a property P satisfies this condition, then every logic which is at least as strong as first-order logic and can express P fails to have the compactness property. The result is used to prove that for a number of natural properties P speaking about automorphism groups, every logic which is at least as strong as first-order logic and can express P fails to have the compactness property. The basic idea underlying the results and examples presented here is that, using results from random graph theory, it is possible to construct a countable first","authors_text":"Vera Koponen","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.LO","submitted_at":"2012-07-17T17:04:56Z","title":"A note on noncompact logics"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.4067","kind":"arxiv","version":2},"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:09a82999eb2d4518bdd9288dcb337302a7c7d16eff545d2f6335e74b8dd152af","target":"record","created_at":"2026-05-18T03:28:17Z","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":"f2365503cecbd7063311886b74290b8299d359edc9cfa32d3c69f04d6bbc3cc5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.LO","submitted_at":"2012-07-17T17:04:56Z","title_canon_sha256":"38d518d9be67ca9073f57a68447082e86d90fbe4b13c6c52cf1a99d49522b23d"},"schema_version":"1.0","source":{"id":"1207.4067","kind":"arxiv","version":2}},"canonical_sha256":"dc914bdd1083c6f96bea39912fb0b96130788d9b3b923c2cf428ac703f8d3476","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"dc914bdd1083c6f96bea39912fb0b96130788d9b3b923c2cf428ac703f8d3476","first_computed_at":"2026-05-18T03:28:17.450620Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:28:17.450620Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"YYFOCBU5ypByrNIBotQNLIAQkv8oBO8Kgjg9CKunbucA/GCKKdDaS2oB8mhNKv305kBg1qDzpDHyXno7M1a1DA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:28:17.451374Z","signed_message":"canonical_sha256_bytes"},"source_id":"1207.4067","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:09a82999eb2d4518bdd9288dcb337302a7c7d16eff545d2f6335e74b8dd152af","sha256:b921aa3e5a0cd0013c3f83ab7fda453d301ab27e55684d51596c323801fe3b0b"],"state_sha256":"8d85e3a3bdbaa5c26bd7591ba957cd3924f44c3d4d5bc1abf8452c953997cc90"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CncZIwrIF3pk3CUWDNSzOlVy34+hTodx2SVRvKHSTYsrbd/eoUhMSBxLgtYz9uKcAQjmMNnCjjDyfirP1CQzAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-24T18:09:00.221536Z","bundle_sha256":"c4791f887b1951c3fceb2e94e5cce61ddf2cccc925fd71888c19ab0a927e9d11"}}