{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2009:VPKMMYYM6RBUMUWDZX2LAUGUCA","short_pith_number":"pith:VPKMMYYM","canonical_record":{"source":{"id":"0912.5039","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2009-12-26T20:27:08Z","cross_cats_sorted":[],"title_canon_sha256":"c2999a66e079d03e5024a6e72ae205f5f310b3afa6631270f8f2bc4d901d5477","abstract_canon_sha256":"55624edcd1d8d0c69981d7bbb0ccfe3184739bbfeb7b5ca36b356f9c50267569"},"schema_version":"1.0"},"canonical_sha256":"abd4c6630cf4434652c3cdf4b050d4102b3ab33978e715f909f4e17af165605f","source":{"kind":"arxiv","id":"0912.5039","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0912.5039","created_at":"2026-05-18T01:14:18Z"},{"alias_kind":"arxiv_version","alias_value":"0912.5039v3","created_at":"2026-05-18T01:14:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0912.5039","created_at":"2026-05-18T01:14:18Z"},{"alias_kind":"pith_short_12","alias_value":"VPKMMYYM6RBU","created_at":"2026-05-18T12:26:02Z"},{"alias_kind":"pith_short_16","alias_value":"VPKMMYYM6RBUMUWD","created_at":"2026-05-18T12:26:02Z"},{"alias_kind":"pith_short_8","alias_value":"VPKMMYYM","created_at":"2026-05-18T12:26:02Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2009:VPKMMYYM6RBUMUWDZX2LAUGUCA","target":"record","payload":{"canonical_record":{"source":{"id":"0912.5039","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2009-12-26T20:27:08Z","cross_cats_sorted":[],"title_canon_sha256":"c2999a66e079d03e5024a6e72ae205f5f310b3afa6631270f8f2bc4d901d5477","abstract_canon_sha256":"55624edcd1d8d0c69981d7bbb0ccfe3184739bbfeb7b5ca36b356f9c50267569"},"schema_version":"1.0"},"canonical_sha256":"abd4c6630cf4434652c3cdf4b050d4102b3ab33978e715f909f4e17af165605f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:14:18.714652Z","signature_b64":"G7mtbb7qgMqhGnv5SXI1/ALCx4ufrGZPmlDVBSCYQ9+WUYYXP71eVenMOWJ19UvVcuJbXjhAr2d52+bwYFpfAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"abd4c6630cf4434652c3cdf4b050d4102b3ab33978e715f909f4e17af165605f","last_reissued_at":"2026-05-18T01:14:18.714093Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:14:18.714093Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"0912.5039","source_version":3,"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:14:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YdnSxBZ3QPFwdcBez0F/WyGeDdRlVOfqgSbIFXXK2U3JMkQQSO9b0tsFcwiad5hGJyU+N4VKgnHf77VonWWbDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-19T01:30:39.138730Z"},"content_sha256":"71b37a97ac3ddc5aabf9da9a236b2258f88336ac5ddfff80d5de0cb807b88ef6","schema_version":"1.0","event_id":"sha256:71b37a97ac3ddc5aabf9da9a236b2258f88336ac5ddfff80d5de0cb807b88ef6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2009:VPKMMYYM6RBUMUWDZX2LAUGUCA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"$Q_2$-free families in the Boolean lattice","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jacob Manske, Maria Axenovich, Ryan R. Martin","submitted_at":"2009-12-26T20:27:08Z","abstract_excerpt":"For a family $\\mathcal{F}$ of subsets of [n]=\\{1, 2, ..., n} ordered by inclusion, and a partially ordered set P, we say that $\\mathcal{F}$ is P-free if it does not contain a subposet isomorphic to P. Let $ex(n, P)$ be the largest size of a P-free family of subsets of [n]. Let $Q_2$ be the poset with distinct elements a, b, c, d, a<b, c<d; i.e., the 2-dimensional Boolean lattice. We show that $2N -o(N) \\leq ex(n, Q_2)\\leq 2.283261N +o(N), $ where $N = \\binom{n}{\\lfloor n/2 \\rfloor}$. We also prove that the largest $Q_2$-free family of subsets of [n] having at most three different sizes has at "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0912.5039","kind":"arxiv","version":3},"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:14:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6kFV/WKvIpHCkGPySVWwNzzbVuno1nOLItdm/hp4MbIhdWJxTXCI5lzCJLQwrPIxyqXxmTdPoOebRkcl6YbVDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-19T01:30:39.139402Z"},"content_sha256":"d06541305060181b3a0c6cf4643308a718a8d3cbdc56cf6f6c182fa5b013299e","schema_version":"1.0","event_id":"sha256:d06541305060181b3a0c6cf4643308a718a8d3cbdc56cf6f6c182fa5b013299e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VPKMMYYM6RBUMUWDZX2LAUGUCA/bundle.json","state_url":"https://pith.science/pith/VPKMMYYM6RBUMUWDZX2LAUGUCA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VPKMMYYM6RBUMUWDZX2LAUGUCA/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-19T01:30:39Z","links":{"resolver":"https://pith.science/pith/VPKMMYYM6RBUMUWDZX2LAUGUCA","bundle":"https://pith.science/pith/VPKMMYYM6RBUMUWDZX2LAUGUCA/bundle.json","state":"https://pith.science/pith/VPKMMYYM6RBUMUWDZX2LAUGUCA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VPKMMYYM6RBUMUWDZX2LAUGUCA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2009:VPKMMYYM6RBUMUWDZX2LAUGUCA","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":"55624edcd1d8d0c69981d7bbb0ccfe3184739bbfeb7b5ca36b356f9c50267569","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2009-12-26T20:27:08Z","title_canon_sha256":"c2999a66e079d03e5024a6e72ae205f5f310b3afa6631270f8f2bc4d901d5477"},"schema_version":"1.0","source":{"id":"0912.5039","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0912.5039","created_at":"2026-05-18T01:14:18Z"},{"alias_kind":"arxiv_version","alias_value":"0912.5039v3","created_at":"2026-05-18T01:14:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0912.5039","created_at":"2026-05-18T01:14:18Z"},{"alias_kind":"pith_short_12","alias_value":"VPKMMYYM6RBU","created_at":"2026-05-18T12:26:02Z"},{"alias_kind":"pith_short_16","alias_value":"VPKMMYYM6RBUMUWD","created_at":"2026-05-18T12:26:02Z"},{"alias_kind":"pith_short_8","alias_value":"VPKMMYYM","created_at":"2026-05-18T12:26:02Z"}],"graph_snapshots":[{"event_id":"sha256:d06541305060181b3a0c6cf4643308a718a8d3cbdc56cf6f6c182fa5b013299e","target":"graph","created_at":"2026-05-18T01:14:18Z","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":"For a family $\\mathcal{F}$ of subsets of [n]=\\{1, 2, ..., n} ordered by inclusion, and a partially ordered set P, we say that $\\mathcal{F}$ is P-free if it does not contain a subposet isomorphic to P. Let $ex(n, P)$ be the largest size of a P-free family of subsets of [n]. Let $Q_2$ be the poset with distinct elements a, b, c, d, a<b, c<d; i.e., the 2-dimensional Boolean lattice. We show that $2N -o(N) \\leq ex(n, Q_2)\\leq 2.283261N +o(N), $ where $N = \\binom{n}{\\lfloor n/2 \\rfloor}$. We also prove that the largest $Q_2$-free family of subsets of [n] having at most three different sizes has at ","authors_text":"Jacob Manske, Maria Axenovich, Ryan R. Martin","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2009-12-26T20:27:08Z","title":"$Q_2$-free families in the Boolean lattice"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0912.5039","kind":"arxiv","version":3},"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:71b37a97ac3ddc5aabf9da9a236b2258f88336ac5ddfff80d5de0cb807b88ef6","target":"record","created_at":"2026-05-18T01:14:18Z","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":"55624edcd1d8d0c69981d7bbb0ccfe3184739bbfeb7b5ca36b356f9c50267569","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2009-12-26T20:27:08Z","title_canon_sha256":"c2999a66e079d03e5024a6e72ae205f5f310b3afa6631270f8f2bc4d901d5477"},"schema_version":"1.0","source":{"id":"0912.5039","kind":"arxiv","version":3}},"canonical_sha256":"abd4c6630cf4434652c3cdf4b050d4102b3ab33978e715f909f4e17af165605f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"abd4c6630cf4434652c3cdf4b050d4102b3ab33978e715f909f4e17af165605f","first_computed_at":"2026-05-18T01:14:18.714093Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:14:18.714093Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"G7mtbb7qgMqhGnv5SXI1/ALCx4ufrGZPmlDVBSCYQ9+WUYYXP71eVenMOWJ19UvVcuJbXjhAr2d52+bwYFpfAw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:14:18.714652Z","signed_message":"canonical_sha256_bytes"},"source_id":"0912.5039","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:71b37a97ac3ddc5aabf9da9a236b2258f88336ac5ddfff80d5de0cb807b88ef6","sha256:d06541305060181b3a0c6cf4643308a718a8d3cbdc56cf6f6c182fa5b013299e"],"state_sha256":"a76e5edf9ee3f58fa90e39abd535a52fc6e953a628be1a21a6aa5a98d7deb507"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DJgRF5EJXgmuGKX6lHTEckMUxGGALnUoIuvahRXChFzTlnWDqTIo4fSoq8Yhqr1Ca33YpJ9f/ZJ/hN2VAvdFCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-19T01:30:39.141825Z","bundle_sha256":"4f1be14afe3b6adc52a12abe37963ca070d46d58dd34b048545d95d92ee53c55"}}