{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:6FMMRPVLPJRI5N6HLYYL6QLBZZ","short_pith_number":"pith:6FMMRPVL","canonical_record":{"source":{"id":"1301.0994","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.LO","submitted_at":"2013-01-06T11:43:21Z","cross_cats_sorted":[],"title_canon_sha256":"1ab3c3aa206401987d5fb892647ac2620bad9770e7d91e77d8842829a6e08270","abstract_canon_sha256":"c06ae76b3adaab6c3e5da73ca71c15ca52d651e7cfe5388bbde97a15dd7a8342"},"schema_version":"1.0"},"canonical_sha256":"f158c8beab7a628eb7c75e30bf4161ce5d8466d582bdae3f832f6166c52dd165","source":{"kind":"arxiv","id":"1301.0994","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1301.0994","created_at":"2026-05-18T01:00:20Z"},{"alias_kind":"arxiv_version","alias_value":"1301.0994v2","created_at":"2026-05-18T01:00:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.0994","created_at":"2026-05-18T01:00:20Z"},{"alias_kind":"pith_short_12","alias_value":"6FMMRPVLPJRI","created_at":"2026-05-18T12:27:36Z"},{"alias_kind":"pith_short_16","alias_value":"6FMMRPVLPJRI5N6H","created_at":"2026-05-18T12:27:36Z"},{"alias_kind":"pith_short_8","alias_value":"6FMMRPVL","created_at":"2026-05-18T12:27:36Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:6FMMRPVLPJRI5N6HLYYL6QLBZZ","target":"record","payload":{"canonical_record":{"source":{"id":"1301.0994","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.LO","submitted_at":"2013-01-06T11:43:21Z","cross_cats_sorted":[],"title_canon_sha256":"1ab3c3aa206401987d5fb892647ac2620bad9770e7d91e77d8842829a6e08270","abstract_canon_sha256":"c06ae76b3adaab6c3e5da73ca71c15ca52d651e7cfe5388bbde97a15dd7a8342"},"schema_version":"1.0"},"canonical_sha256":"f158c8beab7a628eb7c75e30bf4161ce5d8466d582bdae3f832f6166c52dd165","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:00:20.930521Z","signature_b64":"ex91B/o0fPMRpJgohxmcU2qve4vo5FpqfH3TdCKtxECVwz6nsdxo/60Na9hehWAgMrQZcxOe4RcGaQ2DsccLCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f158c8beab7a628eb7c75e30bf4161ce5d8466d582bdae3f832f6166c52dd165","last_reissued_at":"2026-05-18T01:00:20.929707Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:00:20.929707Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1301.0994","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-18T01:00:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ANbydnWTj2x1+C9KtXHGP9xtPGkZoros/CCPR1/uX2PTiUYi6ePPlzhp9+nX7W5rTZ1zRqN50Or1o4KR1FtwBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T12:39:21.587012Z"},"content_sha256":"c3d522c469bda960419a797b0f67b1291dac8cea1294a5414078778e421a3739","schema_version":"1.0","event_id":"sha256:c3d522c469bda960419a797b0f67b1291dac8cea1294a5414078778e421a3739"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:6FMMRPVLPJRI5N6HLYYL6QLBZZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Distinguishing Models by Formulas and the Number of Countable Models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.LO","authors_text":"Mohammad Assem","submitted_at":"2013-01-06T11:43:21Z","abstract_excerpt":"We indicate a way of distinguishing between structures, for which, we call two structures distinguishable. Roughly, being distinguishable means that they differ in the number of realizations each gives for some formula. Being non-distinguishable turns out to be an interesting equivalence relation that is weaker than isomorphism and stronger than elementary equivalence. We show that this equivalence relation is Borel in a Polish space that codes countable structures. It then follows, without assuming the Continuum Hypothesis, that for any first order theory in a countable language, if it has an"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.0994","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-18T01:00:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"omNVaKNLeq8NnJHCcu+zwohq+VQDdOJO0GrZvAfcByrjDMC3CrHUiZ19UWk8FN1K7TXAlKp0SDnIOrMBGDYkBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T12:39:21.587600Z"},"content_sha256":"69a47e1c3f032e6a9551744f992b283e12e0a740aed311371d26be9910583250","schema_version":"1.0","event_id":"sha256:69a47e1c3f032e6a9551744f992b283e12e0a740aed311371d26be9910583250"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6FMMRPVLPJRI5N6HLYYL6QLBZZ/bundle.json","state_url":"https://pith.science/pith/6FMMRPVLPJRI5N6HLYYL6QLBZZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6FMMRPVLPJRI5N6HLYYL6QLBZZ/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-26T12:39:21Z","links":{"resolver":"https://pith.science/pith/6FMMRPVLPJRI5N6HLYYL6QLBZZ","bundle":"https://pith.science/pith/6FMMRPVLPJRI5N6HLYYL6QLBZZ/bundle.json","state":"https://pith.science/pith/6FMMRPVLPJRI5N6HLYYL6QLBZZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6FMMRPVLPJRI5N6HLYYL6QLBZZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:6FMMRPVLPJRI5N6HLYYL6QLBZZ","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":"c06ae76b3adaab6c3e5da73ca71c15ca52d651e7cfe5388bbde97a15dd7a8342","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.LO","submitted_at":"2013-01-06T11:43:21Z","title_canon_sha256":"1ab3c3aa206401987d5fb892647ac2620bad9770e7d91e77d8842829a6e08270"},"schema_version":"1.0","source":{"id":"1301.0994","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1301.0994","created_at":"2026-05-18T01:00:20Z"},{"alias_kind":"arxiv_version","alias_value":"1301.0994v2","created_at":"2026-05-18T01:00:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.0994","created_at":"2026-05-18T01:00:20Z"},{"alias_kind":"pith_short_12","alias_value":"6FMMRPVLPJRI","created_at":"2026-05-18T12:27:36Z"},{"alias_kind":"pith_short_16","alias_value":"6FMMRPVLPJRI5N6H","created_at":"2026-05-18T12:27:36Z"},{"alias_kind":"pith_short_8","alias_value":"6FMMRPVL","created_at":"2026-05-18T12:27:36Z"}],"graph_snapshots":[{"event_id":"sha256:69a47e1c3f032e6a9551744f992b283e12e0a740aed311371d26be9910583250","target":"graph","created_at":"2026-05-18T01:00:20Z","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 indicate a way of distinguishing between structures, for which, we call two structures distinguishable. Roughly, being distinguishable means that they differ in the number of realizations each gives for some formula. Being non-distinguishable turns out to be an interesting equivalence relation that is weaker than isomorphism and stronger than elementary equivalence. We show that this equivalence relation is Borel in a Polish space that codes countable structures. It then follows, without assuming the Continuum Hypothesis, that for any first order theory in a countable language, if it has an","authors_text":"Mohammad Assem","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.LO","submitted_at":"2013-01-06T11:43:21Z","title":"Distinguishing Models by Formulas and the Number of Countable Models"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.0994","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:c3d522c469bda960419a797b0f67b1291dac8cea1294a5414078778e421a3739","target":"record","created_at":"2026-05-18T01:00:20Z","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":"c06ae76b3adaab6c3e5da73ca71c15ca52d651e7cfe5388bbde97a15dd7a8342","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.LO","submitted_at":"2013-01-06T11:43:21Z","title_canon_sha256":"1ab3c3aa206401987d5fb892647ac2620bad9770e7d91e77d8842829a6e08270"},"schema_version":"1.0","source":{"id":"1301.0994","kind":"arxiv","version":2}},"canonical_sha256":"f158c8beab7a628eb7c75e30bf4161ce5d8466d582bdae3f832f6166c52dd165","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f158c8beab7a628eb7c75e30bf4161ce5d8466d582bdae3f832f6166c52dd165","first_computed_at":"2026-05-18T01:00:20.929707Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:00:20.929707Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ex91B/o0fPMRpJgohxmcU2qve4vo5FpqfH3TdCKtxECVwz6nsdxo/60Na9hehWAgMrQZcxOe4RcGaQ2DsccLCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:00:20.930521Z","signed_message":"canonical_sha256_bytes"},"source_id":"1301.0994","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c3d522c469bda960419a797b0f67b1291dac8cea1294a5414078778e421a3739","sha256:69a47e1c3f032e6a9551744f992b283e12e0a740aed311371d26be9910583250"],"state_sha256":"06987c1a111ef44753d765f51c32e41780d7309d82d99b1a56485deb6ed45664"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4OGXWdjSN6U1pULBhR58dy7jGhi9llhtf0lXh9LFSbUbZ77/JZ2nHHE1VB6wVLFzFDNjALx59EZ9dWi/sDs6Bg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-26T12:39:21.590372Z","bundle_sha256":"1d62f36faf4cba9704cbbcb8a1753211e8f809cfef3cbd3e6f11e33630f7d46d"}}