{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:32FTIGB6IUWAZ3V5Q27G7YJVKW","short_pith_number":"pith:32FTIGB6","canonical_record":{"source":{"id":"1408.3197","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-08-14T05:53:44Z","cross_cats_sorted":[],"title_canon_sha256":"d30c6a8010eecccc503d37479964258a59385d8d867e0991bdd44a154a04120a","abstract_canon_sha256":"1b519438e262cb9e9a6f792a637b871d90039f5ac59aa4646f615673367bbc64"},"schema_version":"1.0"},"canonical_sha256":"de8b34183e452c0ceebd86be6fe1355584ead60dc13ab0e0d10b146ce83fbe57","source":{"kind":"arxiv","id":"1408.3197","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1408.3197","created_at":"2026-05-18T02:45:13Z"},{"alias_kind":"arxiv_version","alias_value":"1408.3197v1","created_at":"2026-05-18T02:45:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1408.3197","created_at":"2026-05-18T02:45:13Z"},{"alias_kind":"pith_short_12","alias_value":"32FTIGB6IUWA","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_16","alias_value":"32FTIGB6IUWAZ3V5","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_8","alias_value":"32FTIGB6","created_at":"2026-05-18T12:28:11Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:32FTIGB6IUWAZ3V5Q27G7YJVKW","target":"record","payload":{"canonical_record":{"source":{"id":"1408.3197","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-08-14T05:53:44Z","cross_cats_sorted":[],"title_canon_sha256":"d30c6a8010eecccc503d37479964258a59385d8d867e0991bdd44a154a04120a","abstract_canon_sha256":"1b519438e262cb9e9a6f792a637b871d90039f5ac59aa4646f615673367bbc64"},"schema_version":"1.0"},"canonical_sha256":"de8b34183e452c0ceebd86be6fe1355584ead60dc13ab0e0d10b146ce83fbe57","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:45:13.574447Z","signature_b64":"nDzwjmVR7LwPoCsXn8GCd3DFp868wCgeV1MYCougNSingzIwEjbSYVW0b111Jg2tUtPlpofaWyhA5OVkkvffBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"de8b34183e452c0ceebd86be6fe1355584ead60dc13ab0e0d10b146ce83fbe57","last_reissued_at":"2026-05-18T02:45:13.573791Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:45:13.573791Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1408.3197","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:45:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aXfnuigHbiUtIPNUa8BNl9wpNxSzAP2h5ykJG/jc4+NvzT5y7ZfkQKcelYHDd8aHFqPslCk4IkYOp+VWqRjfCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T03:48:42.985954Z"},"content_sha256":"f29e8f780b904ac840d91f104e8cc0161946c3f71cdd5a323d29acc436052996","schema_version":"1.0","event_id":"sha256:f29e8f780b904ac840d91f104e8cc0161946c3f71cdd5a323d29acc436052996"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:32FTIGB6IUWAZ3V5Q27G7YJVKW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The (p,q)-extremal problem and the fractional chromatic number of Kneser hypergraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Deborah Oliveros, Gabriela Araujo-Pardo, Juan Carlos D\\'iaz-Pati\\~no, Luis Montejano","submitted_at":"2014-08-14T05:53:44Z","abstract_excerpt":"The problem of computing the chromatic number of Kneser hypergraphs has been extensively studied over the last 40 years and the fractional version of the chromatic number of Kneser hypergraphs is only solved for particular cases. The \\emph{$(p,q)$-extremal problem} consists in finding the maximum number of edges on a $k$-uniform hypergraph $\\mathcal{H}$ with $n$ vertices such that among any $p$ edges some $q$ of them have no empty intersection. In this paper we have found a link between the fractional chromatic number of Kneser hypergraphs and the $(p,q)$-extremal problem and also solve the $("},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1408.3197","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:45:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wFzIYwlhYOuWp2JHkBm2aRzuB054yX94Z7A7N6ndr5DkbEKFSVOkWLiNMsifovhXAq9nqDvOp47Oc+M9CcS1CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T03:48:42.986620Z"},"content_sha256":"fa8cb8f661270e41db7dca66683367d8c9728bf524dc507a4890b1d699bd7ee8","schema_version":"1.0","event_id":"sha256:fa8cb8f661270e41db7dca66683367d8c9728bf524dc507a4890b1d699bd7ee8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/32FTIGB6IUWAZ3V5Q27G7YJVKW/bundle.json","state_url":"https://pith.science/pith/32FTIGB6IUWAZ3V5Q27G7YJVKW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/32FTIGB6IUWAZ3V5Q27G7YJVKW/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-25T03:48:42Z","links":{"resolver":"https://pith.science/pith/32FTIGB6IUWAZ3V5Q27G7YJVKW","bundle":"https://pith.science/pith/32FTIGB6IUWAZ3V5Q27G7YJVKW/bundle.json","state":"https://pith.science/pith/32FTIGB6IUWAZ3V5Q27G7YJVKW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/32FTIGB6IUWAZ3V5Q27G7YJVKW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:32FTIGB6IUWAZ3V5Q27G7YJVKW","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":"1b519438e262cb9e9a6f792a637b871d90039f5ac59aa4646f615673367bbc64","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-08-14T05:53:44Z","title_canon_sha256":"d30c6a8010eecccc503d37479964258a59385d8d867e0991bdd44a154a04120a"},"schema_version":"1.0","source":{"id":"1408.3197","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1408.3197","created_at":"2026-05-18T02:45:13Z"},{"alias_kind":"arxiv_version","alias_value":"1408.3197v1","created_at":"2026-05-18T02:45:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1408.3197","created_at":"2026-05-18T02:45:13Z"},{"alias_kind":"pith_short_12","alias_value":"32FTIGB6IUWA","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_16","alias_value":"32FTIGB6IUWAZ3V5","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_8","alias_value":"32FTIGB6","created_at":"2026-05-18T12:28:11Z"}],"graph_snapshots":[{"event_id":"sha256:fa8cb8f661270e41db7dca66683367d8c9728bf524dc507a4890b1d699bd7ee8","target":"graph","created_at":"2026-05-18T02:45:13Z","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 problem of computing the chromatic number of Kneser hypergraphs has been extensively studied over the last 40 years and the fractional version of the chromatic number of Kneser hypergraphs is only solved for particular cases. The \\emph{$(p,q)$-extremal problem} consists in finding the maximum number of edges on a $k$-uniform hypergraph $\\mathcal{H}$ with $n$ vertices such that among any $p$ edges some $q$ of them have no empty intersection. In this paper we have found a link between the fractional chromatic number of Kneser hypergraphs and the $(p,q)$-extremal problem and also solve the $(","authors_text":"Deborah Oliveros, Gabriela Araujo-Pardo, Juan Carlos D\\'iaz-Pati\\~no, Luis Montejano","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-08-14T05:53:44Z","title":"The (p,q)-extremal problem and the fractional chromatic number of Kneser hypergraphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1408.3197","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:f29e8f780b904ac840d91f104e8cc0161946c3f71cdd5a323d29acc436052996","target":"record","created_at":"2026-05-18T02:45:13Z","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":"1b519438e262cb9e9a6f792a637b871d90039f5ac59aa4646f615673367bbc64","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-08-14T05:53:44Z","title_canon_sha256":"d30c6a8010eecccc503d37479964258a59385d8d867e0991bdd44a154a04120a"},"schema_version":"1.0","source":{"id":"1408.3197","kind":"arxiv","version":1}},"canonical_sha256":"de8b34183e452c0ceebd86be6fe1355584ead60dc13ab0e0d10b146ce83fbe57","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"de8b34183e452c0ceebd86be6fe1355584ead60dc13ab0e0d10b146ce83fbe57","first_computed_at":"2026-05-18T02:45:13.573791Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:45:13.573791Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"nDzwjmVR7LwPoCsXn8GCd3DFp868wCgeV1MYCougNSingzIwEjbSYVW0b111Jg2tUtPlpofaWyhA5OVkkvffBg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:45:13.574447Z","signed_message":"canonical_sha256_bytes"},"source_id":"1408.3197","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f29e8f780b904ac840d91f104e8cc0161946c3f71cdd5a323d29acc436052996","sha256:fa8cb8f661270e41db7dca66683367d8c9728bf524dc507a4890b1d699bd7ee8"],"state_sha256":"100f01aede2a5a7c4b4cf8c7d36704023072d44e8e62385b46e4e1f1999945ac"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"weQ190+detlTNef6tK3lae9nLWPQGtNPkX8hWOPjD1BjZaOzdSphPS+iVf9iINdbmLTPux9bVXkxu9e3YNpZCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T03:48:42.989579Z","bundle_sha256":"3bc94151a00e4a00b12d6018f0603f9e2de7613bf4e73261e22bda50f2574082"}}