{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:MQAKN2CQ6JC3TEJAK6BPY2JLJ6","short_pith_number":"pith:MQAKN2CQ","canonical_record":{"source":{"id":"1308.4120","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-08-19T19:57:30Z","cross_cats_sorted":[],"title_canon_sha256":"d1cb14285e5fbe64f1a71f574d876b69132440446fad77fc707ad0cb845efa86","abstract_canon_sha256":"081a6a24ac92d768218f1c22f18561e135ae6f4ed6ab5f80b2285883a19df299"},"schema_version":"1.0"},"canonical_sha256":"6400a6e850f245b991205782fc692b4fb5238bbc2652d6a5a7bab2db0fff57e0","source":{"kind":"arxiv","id":"1308.4120","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1308.4120","created_at":"2026-05-18T03:15:34Z"},{"alias_kind":"arxiv_version","alias_value":"1308.4120v1","created_at":"2026-05-18T03:15:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1308.4120","created_at":"2026-05-18T03:15:34Z"},{"alias_kind":"pith_short_12","alias_value":"MQAKN2CQ6JC3","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_16","alias_value":"MQAKN2CQ6JC3TEJA","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_8","alias_value":"MQAKN2CQ","created_at":"2026-05-18T12:27:52Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:MQAKN2CQ6JC3TEJAK6BPY2JLJ6","target":"record","payload":{"canonical_record":{"source":{"id":"1308.4120","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-08-19T19:57:30Z","cross_cats_sorted":[],"title_canon_sha256":"d1cb14285e5fbe64f1a71f574d876b69132440446fad77fc707ad0cb845efa86","abstract_canon_sha256":"081a6a24ac92d768218f1c22f18561e135ae6f4ed6ab5f80b2285883a19df299"},"schema_version":"1.0"},"canonical_sha256":"6400a6e850f245b991205782fc692b4fb5238bbc2652d6a5a7bab2db0fff57e0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:15:34.773659Z","signature_b64":"n6qqnRgPNlAl9km6mbmt1gw9B8IkrUekgGiDuVf6yU7llFNETagzT63M1NxVnOkyGY5gTwVjuDCOh6Jv9a5CDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6400a6e850f245b991205782fc692b4fb5238bbc2652d6a5a7bab2db0fff57e0","last_reissued_at":"2026-05-18T03:15:34.772978Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:15:34.772978Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1308.4120","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-18T03:15:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qZ5+Wsf4U1WrnAqL0/+fJhY3Whbdh+3pCCCZkFjIhG0yFrPFtzExnOqs4p4AMZIfPka93+pI5s8hr3En4BaKCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T22:49:48.103921Z"},"content_sha256":"2cbe6e386612f68ba6bfbfe4c9de5ff19b3faeaad76bb2ee7be4d959aa24a37e","schema_version":"1.0","event_id":"sha256:2cbe6e386612f68ba6bfbfe4c9de5ff19b3faeaad76bb2ee7be4d959aa24a37e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:MQAKN2CQ6JC3TEJAK6BPY2JLJ6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Turan Problems and Shadows I: Paths and Cycles","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Alexandr Kostochka, Dhruv Mubayi, Jacques Verstra\\\"ete","submitted_at":"2013-08-19T19:57:30Z","abstract_excerpt":"A $k$-path is a hypergraph P_k = e_1,e_2,...,e_k such that |e_i \\cap e_j| = 1 if |j - i| = 1 and e_i \\cap e_j is empty otherwise. A k-cycle is a hypergraph C_k = e_1,e_2,.. ,e_k obtained from a (k-1)-path e_1,e_2,...,e_{k-1} by adding an edge e_k that shares one vertex with e_1, another vertex with e_{k-1} and is disjoint from the other edges.\n  Let ex_r(n,G) be the maximum number of edges in an r-graph with n vertices not containing a given r-graph G. We determine ex_r(n, P_k) and ex_r(n, C_k) exactly for all k \\ge 4 and r \\ge 3 and $n$ sufficiently large and also characterize the extremal ex"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1308.4120","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-18T03:15:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Z8oEDhjk5D/36GexDhCICe65XJDLPGoDDpQIRy7LrJcklUBJWw0kzcc90IcfPoTnWQGKVTvH0khg+JRl9t0QCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T22:49:48.104507Z"},"content_sha256":"20e8741fc429138b7383255fffca45f40fc910fd86b53ec412310c69a9e8fab8","schema_version":"1.0","event_id":"sha256:20e8741fc429138b7383255fffca45f40fc910fd86b53ec412310c69a9e8fab8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MQAKN2CQ6JC3TEJAK6BPY2JLJ6/bundle.json","state_url":"https://pith.science/pith/MQAKN2CQ6JC3TEJAK6BPY2JLJ6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MQAKN2CQ6JC3TEJAK6BPY2JLJ6/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-06-11T22:49:48Z","links":{"resolver":"https://pith.science/pith/MQAKN2CQ6JC3TEJAK6BPY2JLJ6","bundle":"https://pith.science/pith/MQAKN2CQ6JC3TEJAK6BPY2JLJ6/bundle.json","state":"https://pith.science/pith/MQAKN2CQ6JC3TEJAK6BPY2JLJ6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MQAKN2CQ6JC3TEJAK6BPY2JLJ6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:MQAKN2CQ6JC3TEJAK6BPY2JLJ6","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":"081a6a24ac92d768218f1c22f18561e135ae6f4ed6ab5f80b2285883a19df299","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-08-19T19:57:30Z","title_canon_sha256":"d1cb14285e5fbe64f1a71f574d876b69132440446fad77fc707ad0cb845efa86"},"schema_version":"1.0","source":{"id":"1308.4120","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1308.4120","created_at":"2026-05-18T03:15:34Z"},{"alias_kind":"arxiv_version","alias_value":"1308.4120v1","created_at":"2026-05-18T03:15:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1308.4120","created_at":"2026-05-18T03:15:34Z"},{"alias_kind":"pith_short_12","alias_value":"MQAKN2CQ6JC3","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_16","alias_value":"MQAKN2CQ6JC3TEJA","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_8","alias_value":"MQAKN2CQ","created_at":"2026-05-18T12:27:52Z"}],"graph_snapshots":[{"event_id":"sha256:20e8741fc429138b7383255fffca45f40fc910fd86b53ec412310c69a9e8fab8","target":"graph","created_at":"2026-05-18T03:15:34Z","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":"A $k$-path is a hypergraph P_k = e_1,e_2,...,e_k such that |e_i \\cap e_j| = 1 if |j - i| = 1 and e_i \\cap e_j is empty otherwise. A k-cycle is a hypergraph C_k = e_1,e_2,.. ,e_k obtained from a (k-1)-path e_1,e_2,...,e_{k-1} by adding an edge e_k that shares one vertex with e_1, another vertex with e_{k-1} and is disjoint from the other edges.\n  Let ex_r(n,G) be the maximum number of edges in an r-graph with n vertices not containing a given r-graph G. We determine ex_r(n, P_k) and ex_r(n, C_k) exactly for all k \\ge 4 and r \\ge 3 and $n$ sufficiently large and also characterize the extremal ex","authors_text":"Alexandr Kostochka, Dhruv Mubayi, Jacques Verstra\\\"ete","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-08-19T19:57:30Z","title":"Turan Problems and Shadows I: Paths and Cycles"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1308.4120","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:2cbe6e386612f68ba6bfbfe4c9de5ff19b3faeaad76bb2ee7be4d959aa24a37e","target":"record","created_at":"2026-05-18T03:15:34Z","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":"081a6a24ac92d768218f1c22f18561e135ae6f4ed6ab5f80b2285883a19df299","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-08-19T19:57:30Z","title_canon_sha256":"d1cb14285e5fbe64f1a71f574d876b69132440446fad77fc707ad0cb845efa86"},"schema_version":"1.0","source":{"id":"1308.4120","kind":"arxiv","version":1}},"canonical_sha256":"6400a6e850f245b991205782fc692b4fb5238bbc2652d6a5a7bab2db0fff57e0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6400a6e850f245b991205782fc692b4fb5238bbc2652d6a5a7bab2db0fff57e0","first_computed_at":"2026-05-18T03:15:34.772978Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:15:34.772978Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"n6qqnRgPNlAl9km6mbmt1gw9B8IkrUekgGiDuVf6yU7llFNETagzT63M1NxVnOkyGY5gTwVjuDCOh6Jv9a5CDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:15:34.773659Z","signed_message":"canonical_sha256_bytes"},"source_id":"1308.4120","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2cbe6e386612f68ba6bfbfe4c9de5ff19b3faeaad76bb2ee7be4d959aa24a37e","sha256:20e8741fc429138b7383255fffca45f40fc910fd86b53ec412310c69a9e8fab8"],"state_sha256":"98ee499c7a775ec2b78821fb0fbe9c676762028320be496064294aca3d0b83cf"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PbB/KU6/7eImTtvgvlzronOcGMARCt2RGd7I/RILT8CHbsBMxRlIRnR4RaUTnmZsnUuGBbVBeI5nreK0MN1yCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T22:49:48.108222Z","bundle_sha256":"5142cb057517ccd5b99bd0abbb0c009cc9dbbfcd93a9653896a8c43a3fafa1d4"}}