{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:PQPAGDKI6R4IR3LDH27UFYU2X2","short_pith_number":"pith:PQPAGDKI","canonical_record":{"source":{"id":"1109.1079","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-09-06T06:24:44Z","cross_cats_sorted":[],"title_canon_sha256":"a1df979bb99b67578cc884713283caf276b5845cea7b562fce8b9af115c61f3c","abstract_canon_sha256":"9382180344a862002bc0f4cfc9915931c94531cd9b3c90cc31566653c20afb57"},"schema_version":"1.0"},"canonical_sha256":"7c1e030d48f47888ed633ebf42e29abe94dc4acfb5d145f835c1ca1120608eab","source":{"kind":"arxiv","id":"1109.1079","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1109.1079","created_at":"2026-05-18T02:50:50Z"},{"alias_kind":"arxiv_version","alias_value":"1109.1079v1","created_at":"2026-05-18T02:50:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1109.1079","created_at":"2026-05-18T02:50:50Z"},{"alias_kind":"pith_short_12","alias_value":"PQPAGDKI6R4I","created_at":"2026-05-18T12:26:39Z"},{"alias_kind":"pith_short_16","alias_value":"PQPAGDKI6R4IR3LD","created_at":"2026-05-18T12:26:39Z"},{"alias_kind":"pith_short_8","alias_value":"PQPAGDKI","created_at":"2026-05-18T12:26:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:PQPAGDKI6R4IR3LDH27UFYU2X2","target":"record","payload":{"canonical_record":{"source":{"id":"1109.1079","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-09-06T06:24:44Z","cross_cats_sorted":[],"title_canon_sha256":"a1df979bb99b67578cc884713283caf276b5845cea7b562fce8b9af115c61f3c","abstract_canon_sha256":"9382180344a862002bc0f4cfc9915931c94531cd9b3c90cc31566653c20afb57"},"schema_version":"1.0"},"canonical_sha256":"7c1e030d48f47888ed633ebf42e29abe94dc4acfb5d145f835c1ca1120608eab","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:50:50.701792Z","signature_b64":"cQI1S7rZYS5ZxiLiIibPWt2YE+z5puTzYohkhAeQYMlWuKx7lLmDHWRpjqlZWAfsBvaov8kMG3srzhWovAvxBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7c1e030d48f47888ed633ebf42e29abe94dc4acfb5d145f835c1ca1120608eab","last_reissued_at":"2026-05-18T02:50:50.701344Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:50:50.701344Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1109.1079","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-18T02:50:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2wJ9zN8LqQCLInAWU9zo2jE4PNm5vhpOEhqS3qIaIEbPn3ZXudDzSElKN2h4yF/ce3F7vLgETYXGu2sQ9Q4MDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T09:06:14.975180Z"},"content_sha256":"73c35f1dfd9869ee0225f2847ebbcd012349d9ba069470092cb0940234c71f63","schema_version":"1.0","event_id":"sha256:73c35f1dfd9869ee0225f2847ebbcd012349d9ba069470092cb0940234c71f63"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:PQPAGDKI6R4IR3LDH27UFYU2X2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the ratio of maximum and minimum degree in maximal intersecting families","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Bal\\'azs Patk\\'os, Lale \\\"Ozkahya, M\\'at\\'e Vizer, Zolt\\'an Lor\\'ant Nagy","submitted_at":"2011-09-06T06:24:44Z","abstract_excerpt":"To study how balanced or unbalanced a maximal intersecting family $\\mathcal{F}\\subseteq \\binom{[n]}{r}$ is we consider the ratio $\\mathcal{R}(\\mathcal{F})=\\frac{\\Delta(\\mathcal{F})}{\\delta(\\mathcal{F})}$ of its maximum and minimum degree. We determine the order of magnitude of the function $m(n,r)$, the minimum possible value of $\\mathcal{R}(\\mathcal{F})$, and establish some lower and upper bounds on the function $M(n,r)$, the maximum possible value of $\\mathcal{R}(\\mathcal{F})$. To obtain constructions that show the bounds on $m(n,r)$ we use a theorem of Blokhuis on the minimum size of a non-"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1109.1079","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-18T02:50:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Vgn+the4Ksa5xp6Fy318CYyMJacDqAUCkIw2A8hra30g9QiYHWuv6VS4vnn3MyZN9gVaoZ00pvWTh9fMLrRwCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T09:06:14.975558Z"},"content_sha256":"16ea8321d8370b886bdfa63840f06f07a8ec605d51fb34c72ab75f864aab8f66","schema_version":"1.0","event_id":"sha256:16ea8321d8370b886bdfa63840f06f07a8ec605d51fb34c72ab75f864aab8f66"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PQPAGDKI6R4IR3LDH27UFYU2X2/bundle.json","state_url":"https://pith.science/pith/PQPAGDKI6R4IR3LDH27UFYU2X2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PQPAGDKI6R4IR3LDH27UFYU2X2/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-30T09:06:14Z","links":{"resolver":"https://pith.science/pith/PQPAGDKI6R4IR3LDH27UFYU2X2","bundle":"https://pith.science/pith/PQPAGDKI6R4IR3LDH27UFYU2X2/bundle.json","state":"https://pith.science/pith/PQPAGDKI6R4IR3LDH27UFYU2X2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PQPAGDKI6R4IR3LDH27UFYU2X2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:PQPAGDKI6R4IR3LDH27UFYU2X2","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":"9382180344a862002bc0f4cfc9915931c94531cd9b3c90cc31566653c20afb57","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-09-06T06:24:44Z","title_canon_sha256":"a1df979bb99b67578cc884713283caf276b5845cea7b562fce8b9af115c61f3c"},"schema_version":"1.0","source":{"id":"1109.1079","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1109.1079","created_at":"2026-05-18T02:50:50Z"},{"alias_kind":"arxiv_version","alias_value":"1109.1079v1","created_at":"2026-05-18T02:50:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1109.1079","created_at":"2026-05-18T02:50:50Z"},{"alias_kind":"pith_short_12","alias_value":"PQPAGDKI6R4I","created_at":"2026-05-18T12:26:39Z"},{"alias_kind":"pith_short_16","alias_value":"PQPAGDKI6R4IR3LD","created_at":"2026-05-18T12:26:39Z"},{"alias_kind":"pith_short_8","alias_value":"PQPAGDKI","created_at":"2026-05-18T12:26:39Z"}],"graph_snapshots":[{"event_id":"sha256:16ea8321d8370b886bdfa63840f06f07a8ec605d51fb34c72ab75f864aab8f66","target":"graph","created_at":"2026-05-18T02:50:50Z","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":"To study how balanced or unbalanced a maximal intersecting family $\\mathcal{F}\\subseteq \\binom{[n]}{r}$ is we consider the ratio $\\mathcal{R}(\\mathcal{F})=\\frac{\\Delta(\\mathcal{F})}{\\delta(\\mathcal{F})}$ of its maximum and minimum degree. We determine the order of magnitude of the function $m(n,r)$, the minimum possible value of $\\mathcal{R}(\\mathcal{F})$, and establish some lower and upper bounds on the function $M(n,r)$, the maximum possible value of $\\mathcal{R}(\\mathcal{F})$. To obtain constructions that show the bounds on $m(n,r)$ we use a theorem of Blokhuis on the minimum size of a non-","authors_text":"Bal\\'azs Patk\\'os, Lale \\\"Ozkahya, M\\'at\\'e Vizer, Zolt\\'an Lor\\'ant Nagy","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-09-06T06:24:44Z","title":"On the ratio of maximum and minimum degree in maximal intersecting families"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1109.1079","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:73c35f1dfd9869ee0225f2847ebbcd012349d9ba069470092cb0940234c71f63","target":"record","created_at":"2026-05-18T02:50:50Z","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":"9382180344a862002bc0f4cfc9915931c94531cd9b3c90cc31566653c20afb57","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-09-06T06:24:44Z","title_canon_sha256":"a1df979bb99b67578cc884713283caf276b5845cea7b562fce8b9af115c61f3c"},"schema_version":"1.0","source":{"id":"1109.1079","kind":"arxiv","version":1}},"canonical_sha256":"7c1e030d48f47888ed633ebf42e29abe94dc4acfb5d145f835c1ca1120608eab","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7c1e030d48f47888ed633ebf42e29abe94dc4acfb5d145f835c1ca1120608eab","first_computed_at":"2026-05-18T02:50:50.701344Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:50:50.701344Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"cQI1S7rZYS5ZxiLiIibPWt2YE+z5puTzYohkhAeQYMlWuKx7lLmDHWRpjqlZWAfsBvaov8kMG3srzhWovAvxBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:50:50.701792Z","signed_message":"canonical_sha256_bytes"},"source_id":"1109.1079","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:73c35f1dfd9869ee0225f2847ebbcd012349d9ba069470092cb0940234c71f63","sha256:16ea8321d8370b886bdfa63840f06f07a8ec605d51fb34c72ab75f864aab8f66"],"state_sha256":"56f288a19b7440cde2f42be064f11906933da35c7af83e3ef6cf59006ea0a530"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GWIq/SLS32Wrnxx6TM/51+iPYm8fV1jdSEwomo8YUBMl/2CFbX9GlKPGqXDlGR3tmPTzH8rAo4GXFOmkS6EkCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T09:06:14.978071Z","bundle_sha256":"9700152b1d9553977e5558279a234cd83e8168cb7c3a9d80e922c0a04be06bf7"}}