{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2009:HG64CRWXE4OVIH67XJ6DR5AVWQ","short_pith_number":"pith:HG64CRWX","canonical_record":{"source":{"id":"0903.4051","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.LO","submitted_at":"2009-03-24T09:47:52Z","cross_cats_sorted":[],"title_canon_sha256":"dfacb962f3fab44e87a8097360f1568b7c941069b869f0a85a66b8f097a69ac3","abstract_canon_sha256":"0ef676a924acae2d929a86b546f1ee075769859ed727122d72947333f6bed593"},"schema_version":"1.0"},"canonical_sha256":"39bdc146d7271d541fdfba7c38f415b42a98c0928817a6d7ffa342b060a815d0","source":{"kind":"arxiv","id":"0903.4051","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0903.4051","created_at":"2026-05-18T02:59:48Z"},{"alias_kind":"arxiv_version","alias_value":"0903.4051v1","created_at":"2026-05-18T02:59:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0903.4051","created_at":"2026-05-18T02:59:48Z"},{"alias_kind":"pith_short_12","alias_value":"HG64CRWXE4OV","created_at":"2026-05-18T12:25:59Z"},{"alias_kind":"pith_short_16","alias_value":"HG64CRWXE4OVIH67","created_at":"2026-05-18T12:25:59Z"},{"alias_kind":"pith_short_8","alias_value":"HG64CRWX","created_at":"2026-05-18T12:25:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2009:HG64CRWXE4OVIH67XJ6DR5AVWQ","target":"record","payload":{"canonical_record":{"source":{"id":"0903.4051","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.LO","submitted_at":"2009-03-24T09:47:52Z","cross_cats_sorted":[],"title_canon_sha256":"dfacb962f3fab44e87a8097360f1568b7c941069b869f0a85a66b8f097a69ac3","abstract_canon_sha256":"0ef676a924acae2d929a86b546f1ee075769859ed727122d72947333f6bed593"},"schema_version":"1.0"},"canonical_sha256":"39bdc146d7271d541fdfba7c38f415b42a98c0928817a6d7ffa342b060a815d0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:59:48.872880Z","signature_b64":"VP2ygeEQjFqY/QZTaF7E0RBN948o+e7YVmx9A+1+hc0P5YVlZORJxv/L8Q01yDI7OxZy0xVGmwcmIWwjFVNoCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"39bdc146d7271d541fdfba7c38f415b42a98c0928817a6d7ffa342b060a815d0","last_reissued_at":"2026-05-18T02:59:48.871942Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:59:48.871942Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"0903.4051","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:59:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fNNLgM7PnDkZLQ3Ty4tT9uEdOHI2crvG4GQa9694x3K/M2mEezQkXWAlgcGEtLr6rJYVrCeAo/9Lts2Vp07pBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T04:57:25.105627Z"},"content_sha256":"bc73dc978ad00ca1732bab2924976adff5fff0eb4d2962329f6760c497d68600","schema_version":"1.0","event_id":"sha256:bc73dc978ad00ca1732bab2924976adff5fff0eb4d2962329f6760c497d68600"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2009:HG64CRWXE4OVIH67XJ6DR5AVWQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A proof of completeness for continuous first-order logic","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.LO","authors_text":"Arthur Paul Pedersen, Ita\\\"i Ben Yaacov (ICJ)","submitted_at":"2009-03-24T09:47:52Z","abstract_excerpt":"The primary purpose of this article is to show that a certain natural set of axioms yields a completeness result for continuous first-order logic. In particular, we show that in continuous first-order logic a set of formulae is (completely) satisfiable if (and only if) it is consistent. From this result it follows that continuous first-order logic also satisfies an \\emph{approximated} form of strong completeness, whereby $\\Sigma\\vDash\\varphi$ (if and) only if $\\Sigma\\vdash\\varphi\\dotminus 2^{-n}$ for all $n<\\omega$. This approximated form of strong completeness asserts that if $\\Sigma\\vDash\\va"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0903.4051","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:59:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8b4BsCBs4w07yOK+IpRXmR3uX9HhwK4lZ0vPZTYwljbIpVOk8SWjhA5nJRBtw4klAWYIe30+IZCauXa3Hxk+AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T04:57:25.105982Z"},"content_sha256":"74106259728fa3dcf5cc74f9023a92994b2c2df4e32e9e4a9c062b8ffa9bdb7b","schema_version":"1.0","event_id":"sha256:74106259728fa3dcf5cc74f9023a92994b2c2df4e32e9e4a9c062b8ffa9bdb7b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HG64CRWXE4OVIH67XJ6DR5AVWQ/bundle.json","state_url":"https://pith.science/pith/HG64CRWXE4OVIH67XJ6DR5AVWQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HG64CRWXE4OVIH67XJ6DR5AVWQ/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-24T04:57:25Z","links":{"resolver":"https://pith.science/pith/HG64CRWXE4OVIH67XJ6DR5AVWQ","bundle":"https://pith.science/pith/HG64CRWXE4OVIH67XJ6DR5AVWQ/bundle.json","state":"https://pith.science/pith/HG64CRWXE4OVIH67XJ6DR5AVWQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HG64CRWXE4OVIH67XJ6DR5AVWQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2009:HG64CRWXE4OVIH67XJ6DR5AVWQ","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":"0ef676a924acae2d929a86b546f1ee075769859ed727122d72947333f6bed593","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.LO","submitted_at":"2009-03-24T09:47:52Z","title_canon_sha256":"dfacb962f3fab44e87a8097360f1568b7c941069b869f0a85a66b8f097a69ac3"},"schema_version":"1.0","source":{"id":"0903.4051","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0903.4051","created_at":"2026-05-18T02:59:48Z"},{"alias_kind":"arxiv_version","alias_value":"0903.4051v1","created_at":"2026-05-18T02:59:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0903.4051","created_at":"2026-05-18T02:59:48Z"},{"alias_kind":"pith_short_12","alias_value":"HG64CRWXE4OV","created_at":"2026-05-18T12:25:59Z"},{"alias_kind":"pith_short_16","alias_value":"HG64CRWXE4OVIH67","created_at":"2026-05-18T12:25:59Z"},{"alias_kind":"pith_short_8","alias_value":"HG64CRWX","created_at":"2026-05-18T12:25:59Z"}],"graph_snapshots":[{"event_id":"sha256:74106259728fa3dcf5cc74f9023a92994b2c2df4e32e9e4a9c062b8ffa9bdb7b","target":"graph","created_at":"2026-05-18T02:59:48Z","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":"The primary purpose of this article is to show that a certain natural set of axioms yields a completeness result for continuous first-order logic. In particular, we show that in continuous first-order logic a set of formulae is (completely) satisfiable if (and only if) it is consistent. From this result it follows that continuous first-order logic also satisfies an \\emph{approximated} form of strong completeness, whereby $\\Sigma\\vDash\\varphi$ (if and) only if $\\Sigma\\vdash\\varphi\\dotminus 2^{-n}$ for all $n<\\omega$. This approximated form of strong completeness asserts that if $\\Sigma\\vDash\\va","authors_text":"Arthur Paul Pedersen, Ita\\\"i Ben Yaacov (ICJ)","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.LO","submitted_at":"2009-03-24T09:47:52Z","title":"A proof of completeness for continuous first-order logic"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0903.4051","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:bc73dc978ad00ca1732bab2924976adff5fff0eb4d2962329f6760c497d68600","target":"record","created_at":"2026-05-18T02:59:48Z","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":"0ef676a924acae2d929a86b546f1ee075769859ed727122d72947333f6bed593","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.LO","submitted_at":"2009-03-24T09:47:52Z","title_canon_sha256":"dfacb962f3fab44e87a8097360f1568b7c941069b869f0a85a66b8f097a69ac3"},"schema_version":"1.0","source":{"id":"0903.4051","kind":"arxiv","version":1}},"canonical_sha256":"39bdc146d7271d541fdfba7c38f415b42a98c0928817a6d7ffa342b060a815d0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"39bdc146d7271d541fdfba7c38f415b42a98c0928817a6d7ffa342b060a815d0","first_computed_at":"2026-05-18T02:59:48.871942Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:59:48.871942Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"VP2ygeEQjFqY/QZTaF7E0RBN948o+e7YVmx9A+1+hc0P5YVlZORJxv/L8Q01yDI7OxZy0xVGmwcmIWwjFVNoCg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:59:48.872880Z","signed_message":"canonical_sha256_bytes"},"source_id":"0903.4051","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bc73dc978ad00ca1732bab2924976adff5fff0eb4d2962329f6760c497d68600","sha256:74106259728fa3dcf5cc74f9023a92994b2c2df4e32e9e4a9c062b8ffa9bdb7b"],"state_sha256":"d765b6955ff0606f27659a6cf0a6446ea9ae99241c6307da3e8a72b99dcabf9e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0brH+qH3tBwwVy5tkFuAZ7Xl03mWm0tcU4DSAqYWolGBhBQxHCs6mhM6gfiaeGmD/lDL2TmNC0TGpZa1NK50Cg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-24T04:57:25.107920Z","bundle_sha256":"dc31807f52c22c7371319365d117d3018e74a17fad58b050d8c38c159a42d776"}}