{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:AN3JCCHPEZ3TXEXT6H4HOOZEDE","short_pith_number":"pith:AN3JCCHP","canonical_record":{"source":{"id":"1905.05531","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.LO","submitted_at":"2019-05-14T11:44:47Z","cross_cats_sorted":[],"title_canon_sha256":"3de259bced6794df402ab330aefbd740d4632f33c73b755b44cb519d8a13d9d4","abstract_canon_sha256":"ee8fe6fade6e81d829fba020efc211d6bee28f94be84ebbd66a437a587d80bd6"},"schema_version":"1.0"},"canonical_sha256":"03769108ef26773b92f3f1f8773b24190f8183d3cf2b41b691fea7e19befefe0","source":{"kind":"arxiv","id":"1905.05531","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.05531","created_at":"2026-05-17T23:46:16Z"},{"alias_kind":"arxiv_version","alias_value":"1905.05531v1","created_at":"2026-05-17T23:46:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.05531","created_at":"2026-05-17T23:46:16Z"},{"alias_kind":"pith_short_12","alias_value":"AN3JCCHPEZ3T","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_16","alias_value":"AN3JCCHPEZ3TXEXT","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_8","alias_value":"AN3JCCHP","created_at":"2026-05-18T12:33:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:AN3JCCHPEZ3TXEXT6H4HOOZEDE","target":"record","payload":{"canonical_record":{"source":{"id":"1905.05531","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.LO","submitted_at":"2019-05-14T11:44:47Z","cross_cats_sorted":[],"title_canon_sha256":"3de259bced6794df402ab330aefbd740d4632f33c73b755b44cb519d8a13d9d4","abstract_canon_sha256":"ee8fe6fade6e81d829fba020efc211d6bee28f94be84ebbd66a437a587d80bd6"},"schema_version":"1.0"},"canonical_sha256":"03769108ef26773b92f3f1f8773b24190f8183d3cf2b41b691fea7e19befefe0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:46:16.224867Z","signature_b64":"wI2j2Q6QjW0DIOy4YJq4xyaonwEC4s/4XkX2kKUILHWBSaZxExImdUY+ASd6xyXkEITq8ygWjylooTsSqjq1Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"03769108ef26773b92f3f1f8773b24190f8183d3cf2b41b691fea7e19befefe0","last_reissued_at":"2026-05-17T23:46:16.223952Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:46:16.223952Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1905.05531","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-17T23:46:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mSPdbVz+as+/xTvOVHwm7BNyio+tVLr9piYP1kQFtTfpszs9tjlKeNnikQtaUiEBQWjm5tzklQrUeEsvUAB9AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T22:53:02.914822Z"},"content_sha256":"76fa1ce96489ce13016f2e57e69664449e2e246798f9d4edc654d64e1b665779","schema_version":"1.0","event_id":"sha256:76fa1ce96489ce13016f2e57e69664449e2e246798f9d4edc654d64e1b665779"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:AN3JCCHPEZ3TXEXT6H4HOOZEDE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Vaught's Conjecture for Almost Chainable Theories","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.LO","authors_text":"Milo\\v{s} S. Kurili\\'c","submitted_at":"2019-05-14T11:44:47Z","abstract_excerpt":"A structure ${\\mathbb Y}$ of a relational language $L$ is called almost chainable iff there are a finite set $F \\subset Y$ and a linear order $<$ on the set $Y\\setminus F$ such that for each partial automorphism $\\varphi$ (i.e., local automorphism, in Fra\\\"{\\i}ss\\'{e}'s terminology) of the linear order $\\langle Y\\setminus F, < \\rangle$ the mapping ${\\mathrm{id}} _F \\cup \\varphi$ is a partial automorphism of ${\\mathbb Y}$. By a theorem of Fra\\\"{\\i}ss\\'{e}, if $|L|<\\omega$, then ${\\mathbb Y}$ is almost chainable iff the profile of ${\\mathbb Y}$ is bounded; namely, iff there is a positive integer"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.05531","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-17T23:46:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"g6roJ0/vYS/+7Z9jrF4wH6repm7L28eCa2U0cf0Elq0JLjoeKKBjVnTEqW1KWwJLb6NUEVE+WveLBm0IS/06BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T22:53:02.915539Z"},"content_sha256":"fc37b2292ebdf102c0dd51cd8170ae966f5127cbacf135cdc2286ad92da4806a","schema_version":"1.0","event_id":"sha256:fc37b2292ebdf102c0dd51cd8170ae966f5127cbacf135cdc2286ad92da4806a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/AN3JCCHPEZ3TXEXT6H4HOOZEDE/bundle.json","state_url":"https://pith.science/pith/AN3JCCHPEZ3TXEXT6H4HOOZEDE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/AN3JCCHPEZ3TXEXT6H4HOOZEDE/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-07T22:53:02Z","links":{"resolver":"https://pith.science/pith/AN3JCCHPEZ3TXEXT6H4HOOZEDE","bundle":"https://pith.science/pith/AN3JCCHPEZ3TXEXT6H4HOOZEDE/bundle.json","state":"https://pith.science/pith/AN3JCCHPEZ3TXEXT6H4HOOZEDE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/AN3JCCHPEZ3TXEXT6H4HOOZEDE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:AN3JCCHPEZ3TXEXT6H4HOOZEDE","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":"ee8fe6fade6e81d829fba020efc211d6bee28f94be84ebbd66a437a587d80bd6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.LO","submitted_at":"2019-05-14T11:44:47Z","title_canon_sha256":"3de259bced6794df402ab330aefbd740d4632f33c73b755b44cb519d8a13d9d4"},"schema_version":"1.0","source":{"id":"1905.05531","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.05531","created_at":"2026-05-17T23:46:16Z"},{"alias_kind":"arxiv_version","alias_value":"1905.05531v1","created_at":"2026-05-17T23:46:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.05531","created_at":"2026-05-17T23:46:16Z"},{"alias_kind":"pith_short_12","alias_value":"AN3JCCHPEZ3T","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_16","alias_value":"AN3JCCHPEZ3TXEXT","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_8","alias_value":"AN3JCCHP","created_at":"2026-05-18T12:33:12Z"}],"graph_snapshots":[{"event_id":"sha256:fc37b2292ebdf102c0dd51cd8170ae966f5127cbacf135cdc2286ad92da4806a","target":"graph","created_at":"2026-05-17T23:46:16Z","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 structure ${\\mathbb Y}$ of a relational language $L$ is called almost chainable iff there are a finite set $F \\subset Y$ and a linear order $<$ on the set $Y\\setminus F$ such that for each partial automorphism $\\varphi$ (i.e., local automorphism, in Fra\\\"{\\i}ss\\'{e}'s terminology) of the linear order $\\langle Y\\setminus F, < \\rangle$ the mapping ${\\mathrm{id}} _F \\cup \\varphi$ is a partial automorphism of ${\\mathbb Y}$. By a theorem of Fra\\\"{\\i}ss\\'{e}, if $|L|<\\omega$, then ${\\mathbb Y}$ is almost chainable iff the profile of ${\\mathbb Y}$ is bounded; namely, iff there is a positive integer","authors_text":"Milo\\v{s} S. Kurili\\'c","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.LO","submitted_at":"2019-05-14T11:44:47Z","title":"Vaught's Conjecture for Almost Chainable Theories"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.05531","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:76fa1ce96489ce13016f2e57e69664449e2e246798f9d4edc654d64e1b665779","target":"record","created_at":"2026-05-17T23:46:16Z","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":"ee8fe6fade6e81d829fba020efc211d6bee28f94be84ebbd66a437a587d80bd6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.LO","submitted_at":"2019-05-14T11:44:47Z","title_canon_sha256":"3de259bced6794df402ab330aefbd740d4632f33c73b755b44cb519d8a13d9d4"},"schema_version":"1.0","source":{"id":"1905.05531","kind":"arxiv","version":1}},"canonical_sha256":"03769108ef26773b92f3f1f8773b24190f8183d3cf2b41b691fea7e19befefe0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"03769108ef26773b92f3f1f8773b24190f8183d3cf2b41b691fea7e19befefe0","first_computed_at":"2026-05-17T23:46:16.223952Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:46:16.223952Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"wI2j2Q6QjW0DIOy4YJq4xyaonwEC4s/4XkX2kKUILHWBSaZxExImdUY+ASd6xyXkEITq8ygWjylooTsSqjq1Dg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:46:16.224867Z","signed_message":"canonical_sha256_bytes"},"source_id":"1905.05531","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:76fa1ce96489ce13016f2e57e69664449e2e246798f9d4edc654d64e1b665779","sha256:fc37b2292ebdf102c0dd51cd8170ae966f5127cbacf135cdc2286ad92da4806a"],"state_sha256":"66e0f9a263b23974a1ec3b33a7d834c99e68da8883e69e5f742d733ad6f760d3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tQ36ErgPCaFnWqQgx27tFD3uG+U3ZlpoMP6H/n0esuzm6VqGgaaZ6RQFLzgF87XegRWN2WEMpYNfLdLxWSJPBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T22:53:02.919122Z","bundle_sha256":"953a834bd76d3b54a0b0b6a13502f52e02d038433c0afea7d7f770faaa17b095"}}