{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:5H3HRWRQCDGYQCM5I5JWFZPKXG","short_pith_number":"pith:5H3HRWRQ","canonical_record":{"source":{"id":"1610.03873","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-10-12T20:55:50Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"f6a3af25a57f78baaaba72b959b4097f48aec076e32af41b203193d828d46511","abstract_canon_sha256":"f2a3dfafba46846387c04e7ce4504508860fdc0373f44c3a727f0a8122739ff4"},"schema_version":"1.0"},"canonical_sha256":"e9f678da3010cd88099d475362e5eab998c629d13df25df57230bb0a883d6d72","source":{"kind":"arxiv","id":"1610.03873","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1610.03873","created_at":"2026-05-18T01:02:23Z"},{"alias_kind":"arxiv_version","alias_value":"1610.03873v1","created_at":"2026-05-18T01:02:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.03873","created_at":"2026-05-18T01:02:23Z"},{"alias_kind":"pith_short_12","alias_value":"5H3HRWRQCDGY","created_at":"2026-05-18T12:30:01Z"},{"alias_kind":"pith_short_16","alias_value":"5H3HRWRQCDGYQCM5","created_at":"2026-05-18T12:30:01Z"},{"alias_kind":"pith_short_8","alias_value":"5H3HRWRQ","created_at":"2026-05-18T12:30:01Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:5H3HRWRQCDGYQCM5I5JWFZPKXG","target":"record","payload":{"canonical_record":{"source":{"id":"1610.03873","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-10-12T20:55:50Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"f6a3af25a57f78baaaba72b959b4097f48aec076e32af41b203193d828d46511","abstract_canon_sha256":"f2a3dfafba46846387c04e7ce4504508860fdc0373f44c3a727f0a8122739ff4"},"schema_version":"1.0"},"canonical_sha256":"e9f678da3010cd88099d475362e5eab998c629d13df25df57230bb0a883d6d72","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:02:23.160826Z","signature_b64":"NYpVI4bTSGhEkmMdrCS+9U8g0PA0Wc94n3A/auNmy1yb0j0sjar9ms6sVig+h45MXxo7A7zmDXB3FYUuO4RhCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e9f678da3010cd88099d475362e5eab998c629d13df25df57230bb0a883d6d72","last_reissued_at":"2026-05-18T01:02:23.160137Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:02:23.160137Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1610.03873","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-18T01:02:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ddRyR+hypUigeGLpCNdHfto5ynPch53CXYDF2Lqsu23LGzVHWf0wkyb+ZewsevUZnDywkvdAnKpK+Gop4B+PBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T21:28:04.625173Z"},"content_sha256":"69f2764a112f2374b0376260a709cb4872f03fcb57aa4d3040c7a7b74e077378","schema_version":"1.0","event_id":"sha256:69f2764a112f2374b0376260a709cb4872f03fcb57aa4d3040c7a7b74e077378"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:5H3HRWRQCDGYQCM5I5JWFZPKXG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The Tur\\'an Polytope","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"math.CO","authors_text":"Annie Raymond","submitted_at":"2016-10-12T20:55:50Z","abstract_excerpt":"The Tur\\'an hypergraph problem asks to find the maximum number of $r$-edges in a $r$-uniform hypergraph on $n$ vertices that does not contain a clique of size $a$. When $r=2$, i.e., for graphs, the answer is well-known and can be found in Tur\\'an's theorem. However, when $r\\geq 3$, the problem remains open. We model the problem as an integer program and call the underlying polytope the Tur\\'an polytope. We draw parallels between the latter and the stable set polytope: we show that generalized and transformed versions of the web and wheel inequalities are also facet-defining for the Tur\\'an pol"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.03873","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-18T01:02:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"G3nUA8WW53dC1V+cJ3f4bF2U0CDsbqUSAlIRfuj1dW3h+eU7SlNf3flZ0+odCHeYgeBRNs6vUW3DLi8X8U6ECQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T21:28:04.625770Z"},"content_sha256":"dfdb24191b5718d17360ee9df29d8da7e414d65f073eae2c162c4ee6d7ffebf0","schema_version":"1.0","event_id":"sha256:dfdb24191b5718d17360ee9df29d8da7e414d65f073eae2c162c4ee6d7ffebf0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5H3HRWRQCDGYQCM5I5JWFZPKXG/bundle.json","state_url":"https://pith.science/pith/5H3HRWRQCDGYQCM5I5JWFZPKXG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5H3HRWRQCDGYQCM5I5JWFZPKXG/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-31T21:28:04Z","links":{"resolver":"https://pith.science/pith/5H3HRWRQCDGYQCM5I5JWFZPKXG","bundle":"https://pith.science/pith/5H3HRWRQCDGYQCM5I5JWFZPKXG/bundle.json","state":"https://pith.science/pith/5H3HRWRQCDGYQCM5I5JWFZPKXG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5H3HRWRQCDGYQCM5I5JWFZPKXG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:5H3HRWRQCDGYQCM5I5JWFZPKXG","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":"f2a3dfafba46846387c04e7ce4504508860fdc0373f44c3a727f0a8122739ff4","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-10-12T20:55:50Z","title_canon_sha256":"f6a3af25a57f78baaaba72b959b4097f48aec076e32af41b203193d828d46511"},"schema_version":"1.0","source":{"id":"1610.03873","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1610.03873","created_at":"2026-05-18T01:02:23Z"},{"alias_kind":"arxiv_version","alias_value":"1610.03873v1","created_at":"2026-05-18T01:02:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.03873","created_at":"2026-05-18T01:02:23Z"},{"alias_kind":"pith_short_12","alias_value":"5H3HRWRQCDGY","created_at":"2026-05-18T12:30:01Z"},{"alias_kind":"pith_short_16","alias_value":"5H3HRWRQCDGYQCM5","created_at":"2026-05-18T12:30:01Z"},{"alias_kind":"pith_short_8","alias_value":"5H3HRWRQ","created_at":"2026-05-18T12:30:01Z"}],"graph_snapshots":[{"event_id":"sha256:dfdb24191b5718d17360ee9df29d8da7e414d65f073eae2c162c4ee6d7ffebf0","target":"graph","created_at":"2026-05-18T01:02:23Z","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 Tur\\'an hypergraph problem asks to find the maximum number of $r$-edges in a $r$-uniform hypergraph on $n$ vertices that does not contain a clique of size $a$. When $r=2$, i.e., for graphs, the answer is well-known and can be found in Tur\\'an's theorem. However, when $r\\geq 3$, the problem remains open. We model the problem as an integer program and call the underlying polytope the Tur\\'an polytope. We draw parallels between the latter and the stable set polytope: we show that generalized and transformed versions of the web and wheel inequalities are also facet-defining for the Tur\\'an pol","authors_text":"Annie Raymond","cross_cats":["math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-10-12T20:55:50Z","title":"The Tur\\'an Polytope"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.03873","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:69f2764a112f2374b0376260a709cb4872f03fcb57aa4d3040c7a7b74e077378","target":"record","created_at":"2026-05-18T01:02:23Z","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":"f2a3dfafba46846387c04e7ce4504508860fdc0373f44c3a727f0a8122739ff4","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-10-12T20:55:50Z","title_canon_sha256":"f6a3af25a57f78baaaba72b959b4097f48aec076e32af41b203193d828d46511"},"schema_version":"1.0","source":{"id":"1610.03873","kind":"arxiv","version":1}},"canonical_sha256":"e9f678da3010cd88099d475362e5eab998c629d13df25df57230bb0a883d6d72","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e9f678da3010cd88099d475362e5eab998c629d13df25df57230bb0a883d6d72","first_computed_at":"2026-05-18T01:02:23.160137Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:02:23.160137Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"NYpVI4bTSGhEkmMdrCS+9U8g0PA0Wc94n3A/auNmy1yb0j0sjar9ms6sVig+h45MXxo7A7zmDXB3FYUuO4RhCw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:02:23.160826Z","signed_message":"canonical_sha256_bytes"},"source_id":"1610.03873","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:69f2764a112f2374b0376260a709cb4872f03fcb57aa4d3040c7a7b74e077378","sha256:dfdb24191b5718d17360ee9df29d8da7e414d65f073eae2c162c4ee6d7ffebf0"],"state_sha256":"d896b6652788eff025c4af28f34fc9bdfcf782bc9ca91e90bc4b38dc86b765af"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vo6+2W7tIenIdGOr644WPUvKZZs0+wHbt4PO2fK9pliqX/htifwBCAZJNzUv8rOUSbFkhz/+x9cRk2n6Z8T6BQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T21:28:04.629671Z","bundle_sha256":"d53d8f1d60cbc310152f687769da41429fdad113a41860ccd0a75f361cc84661"}}