{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:KJZ4BKPUV3ETII2UBRDA3M6UAH","short_pith_number":"pith:KJZ4BKPU","canonical_record":{"source":{"id":"1512.05565","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-12-17T12:50:37Z","cross_cats_sorted":[],"title_canon_sha256":"bb21ba97939322ac84a9dbe6872ee58deae745a13af382c2883b75d0732ffda8","abstract_canon_sha256":"7ece477448194acd21caf4f3e7513696ccb34812e20d3b9889973ff4df9061bb"},"schema_version":"1.0"},"canonical_sha256":"5273c0a9f4aec93423540c460db3d401e88f68cc38d8dd317c14f413ee1c8254","source":{"kind":"arxiv","id":"1512.05565","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1512.05565","created_at":"2026-05-18T01:24:09Z"},{"alias_kind":"arxiv_version","alias_value":"1512.05565v1","created_at":"2026-05-18T01:24:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.05565","created_at":"2026-05-18T01:24:09Z"},{"alias_kind":"pith_short_12","alias_value":"KJZ4BKPUV3ET","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_16","alias_value":"KJZ4BKPUV3ETII2U","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_8","alias_value":"KJZ4BKPU","created_at":"2026-05-18T12:29:29Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:KJZ4BKPUV3ETII2UBRDA3M6UAH","target":"record","payload":{"canonical_record":{"source":{"id":"1512.05565","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-12-17T12:50:37Z","cross_cats_sorted":[],"title_canon_sha256":"bb21ba97939322ac84a9dbe6872ee58deae745a13af382c2883b75d0732ffda8","abstract_canon_sha256":"7ece477448194acd21caf4f3e7513696ccb34812e20d3b9889973ff4df9061bb"},"schema_version":"1.0"},"canonical_sha256":"5273c0a9f4aec93423540c460db3d401e88f68cc38d8dd317c14f413ee1c8254","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:24:09.788535Z","signature_b64":"EYdSExH3LEFdNk/9/RP/5FDfd8fZUFx5NLViw7cKhsmoVo4YvFd+MnmgDMLowDBaOGpnynMYBzv/r84K4tXFCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5273c0a9f4aec93423540c460db3d401e88f68cc38d8dd317c14f413ee1c8254","last_reissued_at":"2026-05-18T01:24:09.787889Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:24:09.787889Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1512.05565","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-18T01:24:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aK1DDcGgfb1fBbPTGeMwjzg3Wz4DA3/ZzLS8O/I/HcZrdCBsHcIYaNI9H32kZZPBkhWakkTbpm/lcAXAyp2pAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T05:06:27.073880Z"},"content_sha256":"b15bbd948ed70d5776ddc3849c5903b6915db2c5803d260300aa76a2c2adb1b7","schema_version":"1.0","event_id":"sha256:b15bbd948ed70d5776ddc3849c5903b6915db2c5803d260300aa76a2c2adb1b7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:KJZ4BKPUV3ETII2UBRDA3M6UAH","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Boolean lattices: Ramsey properties and embeddings","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Maria Axenovich, Stefan Walzer","submitted_at":"2015-12-17T12:50:37Z","abstract_excerpt":"A subposet $Q'$ of a poset $Q$ is a copy of a poset $P$ if there is a bijection $f$ between elements of $P$ and $Q'$ such that $x\\leq y$ in $P$ iff $f(x)\\leq f(y)$ in $Q'$. For posets $P, P'$, let the poset Ramsey number $R(P,P')$ be the smallest $N$ such that no matter how the elements of the Boolean lattice $Q_N$ are colored red and blue, there is a copy of $P$ with all red elements or a copy of $P'$ with all blue elements. We provide some general bounds on $R(P,P')$ and focus on the situation when $P$ and $P'$ are both Boolean lattices. In addition, we give asymptotically tight bounds for t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.05565","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-18T01:24:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qZJstavh2Ckpmu9h6PvEUHImQuiWn0a5xyssqse7Upolz6x8fxRXkTUaBTdBiGVjY7bEaAi9zBP0ZEDJkw+iDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T05:06:27.074534Z"},"content_sha256":"1fb17eb22480a43920f7e8afff92ee5fb41b2e2c2e9d616aaf78e46c3d71c962","schema_version":"1.0","event_id":"sha256:1fb17eb22480a43920f7e8afff92ee5fb41b2e2c2e9d616aaf78e46c3d71c962"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KJZ4BKPUV3ETII2UBRDA3M6UAH/bundle.json","state_url":"https://pith.science/pith/KJZ4BKPUV3ETII2UBRDA3M6UAH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KJZ4BKPUV3ETII2UBRDA3M6UAH/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-27T05:06:27Z","links":{"resolver":"https://pith.science/pith/KJZ4BKPUV3ETII2UBRDA3M6UAH","bundle":"https://pith.science/pith/KJZ4BKPUV3ETII2UBRDA3M6UAH/bundle.json","state":"https://pith.science/pith/KJZ4BKPUV3ETII2UBRDA3M6UAH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KJZ4BKPUV3ETII2UBRDA3M6UAH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:KJZ4BKPUV3ETII2UBRDA3M6UAH","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":"7ece477448194acd21caf4f3e7513696ccb34812e20d3b9889973ff4df9061bb","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-12-17T12:50:37Z","title_canon_sha256":"bb21ba97939322ac84a9dbe6872ee58deae745a13af382c2883b75d0732ffda8"},"schema_version":"1.0","source":{"id":"1512.05565","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1512.05565","created_at":"2026-05-18T01:24:09Z"},{"alias_kind":"arxiv_version","alias_value":"1512.05565v1","created_at":"2026-05-18T01:24:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.05565","created_at":"2026-05-18T01:24:09Z"},{"alias_kind":"pith_short_12","alias_value":"KJZ4BKPUV3ET","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_16","alias_value":"KJZ4BKPUV3ETII2U","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_8","alias_value":"KJZ4BKPU","created_at":"2026-05-18T12:29:29Z"}],"graph_snapshots":[{"event_id":"sha256:1fb17eb22480a43920f7e8afff92ee5fb41b2e2c2e9d616aaf78e46c3d71c962","target":"graph","created_at":"2026-05-18T01:24:09Z","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 subposet $Q'$ of a poset $Q$ is a copy of a poset $P$ if there is a bijection $f$ between elements of $P$ and $Q'$ such that $x\\leq y$ in $P$ iff $f(x)\\leq f(y)$ in $Q'$. For posets $P, P'$, let the poset Ramsey number $R(P,P')$ be the smallest $N$ such that no matter how the elements of the Boolean lattice $Q_N$ are colored red and blue, there is a copy of $P$ with all red elements or a copy of $P'$ with all blue elements. We provide some general bounds on $R(P,P')$ and focus on the situation when $P$ and $P'$ are both Boolean lattices. In addition, we give asymptotically tight bounds for t","authors_text":"Maria Axenovich, Stefan Walzer","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-12-17T12:50:37Z","title":"Boolean lattices: Ramsey properties and embeddings"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.05565","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:b15bbd948ed70d5776ddc3849c5903b6915db2c5803d260300aa76a2c2adb1b7","target":"record","created_at":"2026-05-18T01:24:09Z","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":"7ece477448194acd21caf4f3e7513696ccb34812e20d3b9889973ff4df9061bb","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-12-17T12:50:37Z","title_canon_sha256":"bb21ba97939322ac84a9dbe6872ee58deae745a13af382c2883b75d0732ffda8"},"schema_version":"1.0","source":{"id":"1512.05565","kind":"arxiv","version":1}},"canonical_sha256":"5273c0a9f4aec93423540c460db3d401e88f68cc38d8dd317c14f413ee1c8254","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5273c0a9f4aec93423540c460db3d401e88f68cc38d8dd317c14f413ee1c8254","first_computed_at":"2026-05-18T01:24:09.787889Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:24:09.787889Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"EYdSExH3LEFdNk/9/RP/5FDfd8fZUFx5NLViw7cKhsmoVo4YvFd+MnmgDMLowDBaOGpnynMYBzv/r84K4tXFCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:24:09.788535Z","signed_message":"canonical_sha256_bytes"},"source_id":"1512.05565","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b15bbd948ed70d5776ddc3849c5903b6915db2c5803d260300aa76a2c2adb1b7","sha256:1fb17eb22480a43920f7e8afff92ee5fb41b2e2c2e9d616aaf78e46c3d71c962"],"state_sha256":"927f0cd2655404bfa80717bb1672f1e0b4b6dd3ebbae96d05293d190b2521590"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Nnmh6NiIW87jywAr7UpLmKeziy35BbUQhPFU7463KyyZFmVd5zcXj7qdy6Lk5Gp8vGaQGBOYzfcCjRPdaTvvCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T05:06:27.078478Z","bundle_sha256":"62a55972d0b2610324f0f7b57813c0e0980c0e685a4427da945dff1df16caaaf"}}