{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:QOEIVHDMGOWFKTYXOMYTNROEBJ","short_pith_number":"pith:QOEIVHDM","canonical_record":{"source":{"id":"1802.08018","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-02-22T12:52:31Z","cross_cats_sorted":[],"title_canon_sha256":"054a3a6f4a80113748e8f0f4d5a0e98b9851512019eb5a5f75e1c42faeddfb8c","abstract_canon_sha256":"bf72ef3a01239de881d65674afe197d6a330ad5c8a85086ec10802da4a5de311"},"schema_version":"1.0"},"canonical_sha256":"83888a9c6c33ac554f17733136c5c40a4bf9ec8320c630ad59d3f41a849d352f","source":{"kind":"arxiv","id":"1802.08018","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.08018","created_at":"2026-05-17T23:43:51Z"},{"alias_kind":"arxiv_version","alias_value":"1802.08018v2","created_at":"2026-05-17T23:43:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.08018","created_at":"2026-05-17T23:43:51Z"},{"alias_kind":"pith_short_12","alias_value":"QOEIVHDMGOWF","created_at":"2026-05-18T12:32:46Z"},{"alias_kind":"pith_short_16","alias_value":"QOEIVHDMGOWFKTYX","created_at":"2026-05-18T12:32:46Z"},{"alias_kind":"pith_short_8","alias_value":"QOEIVHDM","created_at":"2026-05-18T12:32:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:QOEIVHDMGOWFKTYXOMYTNROEBJ","target":"record","payload":{"canonical_record":{"source":{"id":"1802.08018","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-02-22T12:52:31Z","cross_cats_sorted":[],"title_canon_sha256":"054a3a6f4a80113748e8f0f4d5a0e98b9851512019eb5a5f75e1c42faeddfb8c","abstract_canon_sha256":"bf72ef3a01239de881d65674afe197d6a330ad5c8a85086ec10802da4a5de311"},"schema_version":"1.0"},"canonical_sha256":"83888a9c6c33ac554f17733136c5c40a4bf9ec8320c630ad59d3f41a849d352f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:43:51.424033Z","signature_b64":"ovJ/6+gL0+e63T0eeZORizSc7oOwsGh6UMm/4iNLILbSQHMJMf86mj8dunIXtFIoU9OTOeVts9afAao2zIsuBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"83888a9c6c33ac554f17733136c5c40a4bf9ec8320c630ad59d3f41a849d352f","last_reissued_at":"2026-05-17T23:43:51.423272Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:43:51.423272Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1802.08018","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-17T23:43:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"taopnYprvykrcWkoICcNw2WDWsQrgtk7v5aP+FVEKkiyabmmbStQExcKgSbllXGz3yCH2bIbr/fbnnUgj0HOAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T20:44:21.314337Z"},"content_sha256":"2bba2922570cc36ea1000b6177b8b74d9cbf8f240b4014f433fe5444c4b9d5fb","schema_version":"1.0","event_id":"sha256:2bba2922570cc36ea1000b6177b8b74d9cbf8f240b4014f433fe5444c4b9d5fb"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:QOEIVHDMGOWFKTYXOMYTNROEBJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Structure and Supersaturation for Intersecting Families","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Hong Liu, J\\'ozsef Balogh, Maryam Sharifzadeh, Shagnik Das, Tuan Tran","submitted_at":"2018-02-22T12:52:31Z","abstract_excerpt":"The extremal problems regarding the maximum possible size of intersecting families of various combinatorial objects have been extensively studied. In this paper, we investigate supersaturation extensions, which in this context ask for the minimum number of disjoint pairs that must appear in families larger than the extremal threshold. We study the minimum number of disjoint pairs in families of permutations and in $k$-uniform set families, and determine the structure of the optimal families. Our main tool is a removal lemma for disjoint pairs. We also determine the typical structure of $k$-uni"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.08018","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-17T23:43:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cAiZshJsuaDa4r4N19xCp9SC7t/0x1JEmydKOpTco1U6ucQSsjPPVSKnHNcSf1x3YV38386MTyFTUBpLM7GdCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T20:44:21.315012Z"},"content_sha256":"a1b0990ea768c067853a14b002de9b8c8083c6dd6151eaa0123d816187ba03ce","schema_version":"1.0","event_id":"sha256:a1b0990ea768c067853a14b002de9b8c8083c6dd6151eaa0123d816187ba03ce"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QOEIVHDMGOWFKTYXOMYTNROEBJ/bundle.json","state_url":"https://pith.science/pith/QOEIVHDMGOWFKTYXOMYTNROEBJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QOEIVHDMGOWFKTYXOMYTNROEBJ/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-28T20:44:21Z","links":{"resolver":"https://pith.science/pith/QOEIVHDMGOWFKTYXOMYTNROEBJ","bundle":"https://pith.science/pith/QOEIVHDMGOWFKTYXOMYTNROEBJ/bundle.json","state":"https://pith.science/pith/QOEIVHDMGOWFKTYXOMYTNROEBJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QOEIVHDMGOWFKTYXOMYTNROEBJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:QOEIVHDMGOWFKTYXOMYTNROEBJ","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":"bf72ef3a01239de881d65674afe197d6a330ad5c8a85086ec10802da4a5de311","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-02-22T12:52:31Z","title_canon_sha256":"054a3a6f4a80113748e8f0f4d5a0e98b9851512019eb5a5f75e1c42faeddfb8c"},"schema_version":"1.0","source":{"id":"1802.08018","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.08018","created_at":"2026-05-17T23:43:51Z"},{"alias_kind":"arxiv_version","alias_value":"1802.08018v2","created_at":"2026-05-17T23:43:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.08018","created_at":"2026-05-17T23:43:51Z"},{"alias_kind":"pith_short_12","alias_value":"QOEIVHDMGOWF","created_at":"2026-05-18T12:32:46Z"},{"alias_kind":"pith_short_16","alias_value":"QOEIVHDMGOWFKTYX","created_at":"2026-05-18T12:32:46Z"},{"alias_kind":"pith_short_8","alias_value":"QOEIVHDM","created_at":"2026-05-18T12:32:46Z"}],"graph_snapshots":[{"event_id":"sha256:a1b0990ea768c067853a14b002de9b8c8083c6dd6151eaa0123d816187ba03ce","target":"graph","created_at":"2026-05-17T23:43:51Z","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":"The extremal problems regarding the maximum possible size of intersecting families of various combinatorial objects have been extensively studied. In this paper, we investigate supersaturation extensions, which in this context ask for the minimum number of disjoint pairs that must appear in families larger than the extremal threshold. We study the minimum number of disjoint pairs in families of permutations and in $k$-uniform set families, and determine the structure of the optimal families. Our main tool is a removal lemma for disjoint pairs. We also determine the typical structure of $k$-uni","authors_text":"Hong Liu, J\\'ozsef Balogh, Maryam Sharifzadeh, Shagnik Das, Tuan Tran","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-02-22T12:52:31Z","title":"Structure and Supersaturation for Intersecting Families"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.08018","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:2bba2922570cc36ea1000b6177b8b74d9cbf8f240b4014f433fe5444c4b9d5fb","target":"record","created_at":"2026-05-17T23:43:51Z","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":"bf72ef3a01239de881d65674afe197d6a330ad5c8a85086ec10802da4a5de311","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-02-22T12:52:31Z","title_canon_sha256":"054a3a6f4a80113748e8f0f4d5a0e98b9851512019eb5a5f75e1c42faeddfb8c"},"schema_version":"1.0","source":{"id":"1802.08018","kind":"arxiv","version":2}},"canonical_sha256":"83888a9c6c33ac554f17733136c5c40a4bf9ec8320c630ad59d3f41a849d352f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"83888a9c6c33ac554f17733136c5c40a4bf9ec8320c630ad59d3f41a849d352f","first_computed_at":"2026-05-17T23:43:51.423272Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:43:51.423272Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ovJ/6+gL0+e63T0eeZORizSc7oOwsGh6UMm/4iNLILbSQHMJMf86mj8dunIXtFIoU9OTOeVts9afAao2zIsuBw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:43:51.424033Z","signed_message":"canonical_sha256_bytes"},"source_id":"1802.08018","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2bba2922570cc36ea1000b6177b8b74d9cbf8f240b4014f433fe5444c4b9d5fb","sha256:a1b0990ea768c067853a14b002de9b8c8083c6dd6151eaa0123d816187ba03ce"],"state_sha256":"1406e743427736f537d819c50bde149f3f373bf7b4614eef0b65eb4909200032"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KC4RjRVLyfE9kmhRAdtaEmR67P+38TrBkOLaWQQdaRFwzoIEo8knQ0sWOXZ6A+w0NDh8FuqB56bxL/JzvJyZCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T20:44:21.318981Z","bundle_sha256":"24b2973866499f5b5fc0750a17e5300bf2eb072739b6e4b2c5095511f8fd77a7"}}