{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:RAO6T4USEREYTOHVVEV47ALLTP","short_pith_number":"pith:RAO6T4US","canonical_record":{"source":{"id":"1406.1887","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-06-07T11:32:29Z","cross_cats_sorted":[],"title_canon_sha256":"8cb6e9553632534e4a1851ede1011bb6af01109e594c377447cbda6bd70b0616","abstract_canon_sha256":"0d5612c10922fd52ec5089dad4e44f22dfbbb6a2f1f7dc9e5159499ba53d43d8"},"schema_version":"1.0"},"canonical_sha256":"881de9f292244989b8f5a92bcf816b9bff2879711329a6905a644265b95d76bb","source":{"kind":"arxiv","id":"1406.1887","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1406.1887","created_at":"2026-05-18T01:37:21Z"},{"alias_kind":"arxiv_version","alias_value":"1406.1887v2","created_at":"2026-05-18T01:37:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1406.1887","created_at":"2026-05-18T01:37:21Z"},{"alias_kind":"pith_short_12","alias_value":"RAO6T4USEREY","created_at":"2026-05-18T12:28:46Z"},{"alias_kind":"pith_short_16","alias_value":"RAO6T4USEREYTOHV","created_at":"2026-05-18T12:28:46Z"},{"alias_kind":"pith_short_8","alias_value":"RAO6T4US","created_at":"2026-05-18T12:28:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:RAO6T4USEREYTOHVVEV47ALLTP","target":"record","payload":{"canonical_record":{"source":{"id":"1406.1887","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-06-07T11:32:29Z","cross_cats_sorted":[],"title_canon_sha256":"8cb6e9553632534e4a1851ede1011bb6af01109e594c377447cbda6bd70b0616","abstract_canon_sha256":"0d5612c10922fd52ec5089dad4e44f22dfbbb6a2f1f7dc9e5159499ba53d43d8"},"schema_version":"1.0"},"canonical_sha256":"881de9f292244989b8f5a92bcf816b9bff2879711329a6905a644265b95d76bb","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:37:21.532199Z","signature_b64":"LFj6bpHIGeQQUWSssWD/ES2WKUIuN35ylfGRT9d1KqNNRCwaRnaWa2+2rtld11LCRhGQB9mnwQK9A82EulWlAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"881de9f292244989b8f5a92bcf816b9bff2879711329a6905a644265b95d76bb","last_reissued_at":"2026-05-18T01:37:21.531671Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:37:21.531671Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1406.1887","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:37:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dP+AO2ANsDoqRWLas50hDOqxHABMUZS9piU/hrGFviEL+FeG/P0YLT+eoJQmJ47Zq2SsGBGktS/+HZXZXllCAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T10:24:16.963138Z"},"content_sha256":"fad245bd20dd5270d45fe75ec2c31b2935689623776ea4f3c43430cb50582690","schema_version":"1.0","event_id":"sha256:fad245bd20dd5270d45fe75ec2c31b2935689623776ea4f3c43430cb50582690"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:RAO6T4USEREYTOHVVEV47ALLTP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Supersaturation and stability for forbidden subposet problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Balazs Patkos","submitted_at":"2014-06-07T11:32:29Z","abstract_excerpt":"We address a supersaturation problem in the context of forbidden subposets. A family $\\mathcal{F}$ of sets is said to contain the poset $P$ if there is an injection $i:P \\rightarrow \\mathcal{F}$ such that $p \\le_P q$ implies $i(p) \\subset i (q)$. The poset on four elements $a,b,c,d$ with $a,b \\le c,d$ is called butterfly. The maximum size of a family $\\mathcal{F} \\subseteq 2^{[n]}$ that does not contain a butterfly is $\\Sigma(n,2)=\\binom{n}{\\lfloor n/2 \\rfloor}+\\binom{n}{\\lfloor n/2 \\rfloor+1}$ as proved by De Bonis, Katona, and Swanepoel. We prove that if $\\mathcal{F} \\subseteq 2^{[n]}$ conta"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1406.1887","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:37:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XXiyNC2TQuiKVLJrMfwmuBLqeDTjk/P1GguoJPw2vlIRl/dAcVjWb7QclVCEkqBIpCSNWIX7BcnndOMxa3V/Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T10:24:16.963507Z"},"content_sha256":"6a0b905001ae82c16603b540dcae15ebdc0a93faf3cea40e43367d14a7d12524","schema_version":"1.0","event_id":"sha256:6a0b905001ae82c16603b540dcae15ebdc0a93faf3cea40e43367d14a7d12524"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RAO6T4USEREYTOHVVEV47ALLTP/bundle.json","state_url":"https://pith.science/pith/RAO6T4USEREYTOHVVEV47ALLTP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RAO6T4USEREYTOHVVEV47ALLTP/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-01T10:24:16Z","links":{"resolver":"https://pith.science/pith/RAO6T4USEREYTOHVVEV47ALLTP","bundle":"https://pith.science/pith/RAO6T4USEREYTOHVVEV47ALLTP/bundle.json","state":"https://pith.science/pith/RAO6T4USEREYTOHVVEV47ALLTP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RAO6T4USEREYTOHVVEV47ALLTP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:RAO6T4USEREYTOHVVEV47ALLTP","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":"0d5612c10922fd52ec5089dad4e44f22dfbbb6a2f1f7dc9e5159499ba53d43d8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-06-07T11:32:29Z","title_canon_sha256":"8cb6e9553632534e4a1851ede1011bb6af01109e594c377447cbda6bd70b0616"},"schema_version":"1.0","source":{"id":"1406.1887","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1406.1887","created_at":"2026-05-18T01:37:21Z"},{"alias_kind":"arxiv_version","alias_value":"1406.1887v2","created_at":"2026-05-18T01:37:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1406.1887","created_at":"2026-05-18T01:37:21Z"},{"alias_kind":"pith_short_12","alias_value":"RAO6T4USEREY","created_at":"2026-05-18T12:28:46Z"},{"alias_kind":"pith_short_16","alias_value":"RAO6T4USEREYTOHV","created_at":"2026-05-18T12:28:46Z"},{"alias_kind":"pith_short_8","alias_value":"RAO6T4US","created_at":"2026-05-18T12:28:46Z"}],"graph_snapshots":[{"event_id":"sha256:6a0b905001ae82c16603b540dcae15ebdc0a93faf3cea40e43367d14a7d12524","target":"graph","created_at":"2026-05-18T01:37:21Z","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 address a supersaturation problem in the context of forbidden subposets. A family $\\mathcal{F}$ of sets is said to contain the poset $P$ if there is an injection $i:P \\rightarrow \\mathcal{F}$ such that $p \\le_P q$ implies $i(p) \\subset i (q)$. The poset on four elements $a,b,c,d$ with $a,b \\le c,d$ is called butterfly. The maximum size of a family $\\mathcal{F} \\subseteq 2^{[n]}$ that does not contain a butterfly is $\\Sigma(n,2)=\\binom{n}{\\lfloor n/2 \\rfloor}+\\binom{n}{\\lfloor n/2 \\rfloor+1}$ as proved by De Bonis, Katona, and Swanepoel. We prove that if $\\mathcal{F} \\subseteq 2^{[n]}$ conta","authors_text":"Balazs Patkos","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-06-07T11:32:29Z","title":"Supersaturation and stability for forbidden subposet problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1406.1887","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:fad245bd20dd5270d45fe75ec2c31b2935689623776ea4f3c43430cb50582690","target":"record","created_at":"2026-05-18T01:37:21Z","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":"0d5612c10922fd52ec5089dad4e44f22dfbbb6a2f1f7dc9e5159499ba53d43d8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-06-07T11:32:29Z","title_canon_sha256":"8cb6e9553632534e4a1851ede1011bb6af01109e594c377447cbda6bd70b0616"},"schema_version":"1.0","source":{"id":"1406.1887","kind":"arxiv","version":2}},"canonical_sha256":"881de9f292244989b8f5a92bcf816b9bff2879711329a6905a644265b95d76bb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"881de9f292244989b8f5a92bcf816b9bff2879711329a6905a644265b95d76bb","first_computed_at":"2026-05-18T01:37:21.531671Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:37:21.531671Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"LFj6bpHIGeQQUWSssWD/ES2WKUIuN35ylfGRT9d1KqNNRCwaRnaWa2+2rtld11LCRhGQB9mnwQK9A82EulWlAA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:37:21.532199Z","signed_message":"canonical_sha256_bytes"},"source_id":"1406.1887","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fad245bd20dd5270d45fe75ec2c31b2935689623776ea4f3c43430cb50582690","sha256:6a0b905001ae82c16603b540dcae15ebdc0a93faf3cea40e43367d14a7d12524"],"state_sha256":"a7f850bc15d670880d84c48f46bd10e667e4e404ac619c46c7b61a4ba97b6dca"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kKj0BNS3RLGrukTfyRASpQsvBQAQFC85uMVuXuNoTwDmVTJIf4mwCJTWwqa7a4ovdCUs5TvrAL/3rX1C7D9iDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T10:24:16.965464Z","bundle_sha256":"e6b1fe3fdf3c762285c6badc1f5d28a4e982de6a0659b4a1843efcd26f7b06f8"}}