{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:5MAT2TT5YX6LKBE4IXCVOKREYT","short_pith_number":"pith:5MAT2TT5","canonical_record":{"source":{"id":"1610.01521","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-10-05T16:47:26Z","cross_cats_sorted":[],"title_canon_sha256":"4507da9aafba0dfaa134a30d59b393cced0db55c0c5dbb0ace479321beed5af0","abstract_canon_sha256":"926dbe5d784b6a85f3bc3bd1fd69e5ee085fc463fddc96fcc73c148ed009cbad"},"schema_version":"1.0"},"canonical_sha256":"eb013d4e7dc5fcb5049c45c5572a24c4e9088f17798b2153469b69d7e6bc3f0f","source":{"kind":"arxiv","id":"1610.01521","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1610.01521","created_at":"2026-05-18T00:36:39Z"},{"alias_kind":"arxiv_version","alias_value":"1610.01521v2","created_at":"2026-05-18T00:36:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.01521","created_at":"2026-05-18T00:36:39Z"},{"alias_kind":"pith_short_12","alias_value":"5MAT2TT5YX6L","created_at":"2026-05-18T12:30:01Z"},{"alias_kind":"pith_short_16","alias_value":"5MAT2TT5YX6LKBE4","created_at":"2026-05-18T12:30:01Z"},{"alias_kind":"pith_short_8","alias_value":"5MAT2TT5","created_at":"2026-05-18T12:30:01Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:5MAT2TT5YX6LKBE4IXCVOKREYT","target":"record","payload":{"canonical_record":{"source":{"id":"1610.01521","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-10-05T16:47:26Z","cross_cats_sorted":[],"title_canon_sha256":"4507da9aafba0dfaa134a30d59b393cced0db55c0c5dbb0ace479321beed5af0","abstract_canon_sha256":"926dbe5d784b6a85f3bc3bd1fd69e5ee085fc463fddc96fcc73c148ed009cbad"},"schema_version":"1.0"},"canonical_sha256":"eb013d4e7dc5fcb5049c45c5572a24c4e9088f17798b2153469b69d7e6bc3f0f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:36:39.250078Z","signature_b64":"z2DJ1ekvajc0O3DA+cp5Ueff/UXukKWYdWt4WWW+JOJkl4iiuqJaoq8SSaxTCNNjqCaELwKZ1QtJdtZtieTkBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"eb013d4e7dc5fcb5049c45c5572a24c4e9088f17798b2153469b69d7e6bc3f0f","last_reissued_at":"2026-05-18T00:36:39.249524Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:36:39.249524Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1610.01521","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-18T00:36:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4N3uyKd1VS4Ew8JueZlJJ0MR1vE9r4YyvPMjKcoc1koKprgtUXO4ZbAlCP4v6Bl4IXFs90UfSqS0vtxQl964DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T10:09:29.192548Z"},"content_sha256":"8e9db845fbd6221f54125950ddcc5520d0b04684a0b1b91730cbbe59eb0f30c9","schema_version":"1.0","event_id":"sha256:8e9db845fbd6221f54125950ddcc5520d0b04684a0b1b91730cbbe59eb0f30c9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:5MAT2TT5YX6LKBE4IXCVOKREYT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Supersaturation in Posets and Applications Involving the Container Method","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Alex Scott, Benny Sudakov, Jonathan A. Noel","submitted_at":"2016-10-05T16:47:26Z","abstract_excerpt":"We consider 'supersaturation' problems in partially ordered sets (posets) of the following form. Given a finite poset $P$ and an integer $m$ greater than the cardinality of the largest antichain in $P$, what is the minimum number of comparable pairs in a subset of $P$ of cardinality $m$? We provide a framework for obtaining lower bounds on this quantity based on counting comparable pairs relative to a random chain and apply this framework to obtain supersaturation results for three classical posets: the boolean lattice, the collection of subspaces of $\\mathbb{F}_q^n$ ordered by set inclusion a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.01521","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-18T00:36:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TOWkoynXbEzMEg747l4z/T3ft5pGWTO7WyG+dRAQJ3wqmcPbKVwxAwPCbEWpFQl8HT37m3XvWTecaerCXlxUCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T10:09:29.192901Z"},"content_sha256":"1274636a2bef455420703a2928f943b9994f900933f773e64775179912000ee4","schema_version":"1.0","event_id":"sha256:1274636a2bef455420703a2928f943b9994f900933f773e64775179912000ee4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5MAT2TT5YX6LKBE4IXCVOKREYT/bundle.json","state_url":"https://pith.science/pith/5MAT2TT5YX6LKBE4IXCVOKREYT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5MAT2TT5YX6LKBE4IXCVOKREYT/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-30T10:09:29Z","links":{"resolver":"https://pith.science/pith/5MAT2TT5YX6LKBE4IXCVOKREYT","bundle":"https://pith.science/pith/5MAT2TT5YX6LKBE4IXCVOKREYT/bundle.json","state":"https://pith.science/pith/5MAT2TT5YX6LKBE4IXCVOKREYT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5MAT2TT5YX6LKBE4IXCVOKREYT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:5MAT2TT5YX6LKBE4IXCVOKREYT","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":"926dbe5d784b6a85f3bc3bd1fd69e5ee085fc463fddc96fcc73c148ed009cbad","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-10-05T16:47:26Z","title_canon_sha256":"4507da9aafba0dfaa134a30d59b393cced0db55c0c5dbb0ace479321beed5af0"},"schema_version":"1.0","source":{"id":"1610.01521","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1610.01521","created_at":"2026-05-18T00:36:39Z"},{"alias_kind":"arxiv_version","alias_value":"1610.01521v2","created_at":"2026-05-18T00:36:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.01521","created_at":"2026-05-18T00:36:39Z"},{"alias_kind":"pith_short_12","alias_value":"5MAT2TT5YX6L","created_at":"2026-05-18T12:30:01Z"},{"alias_kind":"pith_short_16","alias_value":"5MAT2TT5YX6LKBE4","created_at":"2026-05-18T12:30:01Z"},{"alias_kind":"pith_short_8","alias_value":"5MAT2TT5","created_at":"2026-05-18T12:30:01Z"}],"graph_snapshots":[{"event_id":"sha256:1274636a2bef455420703a2928f943b9994f900933f773e64775179912000ee4","target":"graph","created_at":"2026-05-18T00:36:39Z","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 consider 'supersaturation' problems in partially ordered sets (posets) of the following form. Given a finite poset $P$ and an integer $m$ greater than the cardinality of the largest antichain in $P$, what is the minimum number of comparable pairs in a subset of $P$ of cardinality $m$? We provide a framework for obtaining lower bounds on this quantity based on counting comparable pairs relative to a random chain and apply this framework to obtain supersaturation results for three classical posets: the boolean lattice, the collection of subspaces of $\\mathbb{F}_q^n$ ordered by set inclusion a","authors_text":"Alex Scott, Benny Sudakov, Jonathan A. Noel","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-10-05T16:47:26Z","title":"Supersaturation in Posets and Applications Involving the Container Method"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.01521","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:8e9db845fbd6221f54125950ddcc5520d0b04684a0b1b91730cbbe59eb0f30c9","target":"record","created_at":"2026-05-18T00:36:39Z","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":"926dbe5d784b6a85f3bc3bd1fd69e5ee085fc463fddc96fcc73c148ed009cbad","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-10-05T16:47:26Z","title_canon_sha256":"4507da9aafba0dfaa134a30d59b393cced0db55c0c5dbb0ace479321beed5af0"},"schema_version":"1.0","source":{"id":"1610.01521","kind":"arxiv","version":2}},"canonical_sha256":"eb013d4e7dc5fcb5049c45c5572a24c4e9088f17798b2153469b69d7e6bc3f0f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"eb013d4e7dc5fcb5049c45c5572a24c4e9088f17798b2153469b69d7e6bc3f0f","first_computed_at":"2026-05-18T00:36:39.249524Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:36:39.249524Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"z2DJ1ekvajc0O3DA+cp5Ueff/UXukKWYdWt4WWW+JOJkl4iiuqJaoq8SSaxTCNNjqCaELwKZ1QtJdtZtieTkBA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:36:39.250078Z","signed_message":"canonical_sha256_bytes"},"source_id":"1610.01521","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8e9db845fbd6221f54125950ddcc5520d0b04684a0b1b91730cbbe59eb0f30c9","sha256:1274636a2bef455420703a2928f943b9994f900933f773e64775179912000ee4"],"state_sha256":"1b2f9dc00a72057dbc62842e7df17d58bbde774077df617b9baa293d041dc47a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8DOt7Ha9taqnFjnLhDDpW10uWRa0rF1QRI/x3QxMeRDRDg3TIErQmVWLQdiPVI3r4MJfbO0FKzN2mj5pobZkDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T10:09:29.195296Z","bundle_sha256":"eb1e776f7b80eab8a59bdb225cbfc4a28606168ed99338a06dcf6c5062db357e"}}