{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:C6PG6P2SH5OMFE7V2LUVFZ2YC6","short_pith_number":"pith:C6PG6P2S","canonical_record":{"source":{"id":"1710.07664","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-10-20T18:46:16Z","cross_cats_sorted":[],"title_canon_sha256":"c83fc4c79a8a0e5e89e284c16895c7fa3a4af9df86b6520b766f46669a1b45e5","abstract_canon_sha256":"600173b8d66d13b8f686a5ae7bfd215b76375198c997a52149fd47bd5c6a8e24"},"schema_version":"1.0"},"canonical_sha256":"179e6f3f523f5cc293f5d2e952e75817a447c6cf9793a0a099912572649bb315","source":{"kind":"arxiv","id":"1710.07664","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.07664","created_at":"2026-05-18T00:10:39Z"},{"alias_kind":"arxiv_version","alias_value":"1710.07664v2","created_at":"2026-05-18T00:10:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.07664","created_at":"2026-05-18T00:10:39Z"},{"alias_kind":"pith_short_12","alias_value":"C6PG6P2SH5OM","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_16","alias_value":"C6PG6P2SH5OMFE7V","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_8","alias_value":"C6PG6P2S","created_at":"2026-05-18T12:31:08Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:C6PG6P2SH5OMFE7V2LUVFZ2YC6","target":"record","payload":{"canonical_record":{"source":{"id":"1710.07664","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-10-20T18:46:16Z","cross_cats_sorted":[],"title_canon_sha256":"c83fc4c79a8a0e5e89e284c16895c7fa3a4af9df86b6520b766f46669a1b45e5","abstract_canon_sha256":"600173b8d66d13b8f686a5ae7bfd215b76375198c997a52149fd47bd5c6a8e24"},"schema_version":"1.0"},"canonical_sha256":"179e6f3f523f5cc293f5d2e952e75817a447c6cf9793a0a099912572649bb315","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:10:39.010635Z","signature_b64":"YGaOwQCHeMAOpwoYi/qqYEx+NxC7cRPrrA0jWAvK8DSeyWS/Yh5pj/MQLRE2ngdEcyU8SdIe10RRxCH2el4IAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"179e6f3f523f5cc293f5d2e952e75817a447c6cf9793a0a099912572649bb315","last_reissued_at":"2026-05-18T00:10:39.008799Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:10:39.008799Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1710.07664","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-18T00:10:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8W6GXsFNe/kCAYY1Q00Nn6bcUhw/RVTJQ/DckOHaPEKbO/CSpOhCzFU1scIecCDAP5LWLO4E3RQqyIA7zmowBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T03:36:06.097917Z"},"content_sha256":"be6ff62a4c42958865c6668141a1b22cbde942eca9a69d4d09ede0ebdc16f1d8","schema_version":"1.0","event_id":"sha256:be6ff62a4c42958865c6668141a1b22cbde942eca9a69d4d09ede0ebdc16f1d8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:C6PG6P2SH5OMFE7V2LUVFZ2YC6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the Tur\\'an number of some ordered even cycles","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Abhishek Methuku, Casey Tompkins, D\\'aniel Kor\\'andi, Ervin Gy\\H{o}ri, Istv\\'an Tomon, M\\'at\\'e Vizer","submitted_at":"2017-10-20T18:46:16Z","abstract_excerpt":"A classical result of Bondy and Simonovits in extremal graph theory states that if a graph on $n$ vertices contains no cycle of length $2k$ then it has at most $O(n^{1+1/k})$ edges. However, matching lower bounds are only known for $k=2,3,5$.\n  In this paper we study ordered variants of this problem and prove some tight estimates for a certain class of ordered cycles that we call bordered cycles. In particular, we show that the maximum number of edges in an ordered graph avoiding bordered cycles of length at most $2k$ is $\\Theta(n^{1+1/k})$.\n  Strengthening the result of Bondy and Simonovits i"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.07664","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-18T00:10:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Sxyk+q7jV6zL0uDOL+wPZvveWqh8JNla2BGosOXcpQMTXU0ge72YXjTCtlsX/nR4DGxFfQpW1ACAojcR90lpBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T03:36:06.098637Z"},"content_sha256":"98f7b84a2fdff048beec19238fd3d580d5dac1a7c80db8fbb36c2d3292f3b9ea","schema_version":"1.0","event_id":"sha256:98f7b84a2fdff048beec19238fd3d580d5dac1a7c80db8fbb36c2d3292f3b9ea"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/C6PG6P2SH5OMFE7V2LUVFZ2YC6/bundle.json","state_url":"https://pith.science/pith/C6PG6P2SH5OMFE7V2LUVFZ2YC6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/C6PG6P2SH5OMFE7V2LUVFZ2YC6/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-27T03:36:06Z","links":{"resolver":"https://pith.science/pith/C6PG6P2SH5OMFE7V2LUVFZ2YC6","bundle":"https://pith.science/pith/C6PG6P2SH5OMFE7V2LUVFZ2YC6/bundle.json","state":"https://pith.science/pith/C6PG6P2SH5OMFE7V2LUVFZ2YC6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/C6PG6P2SH5OMFE7V2LUVFZ2YC6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:C6PG6P2SH5OMFE7V2LUVFZ2YC6","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":"600173b8d66d13b8f686a5ae7bfd215b76375198c997a52149fd47bd5c6a8e24","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-10-20T18:46:16Z","title_canon_sha256":"c83fc4c79a8a0e5e89e284c16895c7fa3a4af9df86b6520b766f46669a1b45e5"},"schema_version":"1.0","source":{"id":"1710.07664","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.07664","created_at":"2026-05-18T00:10:39Z"},{"alias_kind":"arxiv_version","alias_value":"1710.07664v2","created_at":"2026-05-18T00:10:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.07664","created_at":"2026-05-18T00:10:39Z"},{"alias_kind":"pith_short_12","alias_value":"C6PG6P2SH5OM","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_16","alias_value":"C6PG6P2SH5OMFE7V","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_8","alias_value":"C6PG6P2S","created_at":"2026-05-18T12:31:08Z"}],"graph_snapshots":[{"event_id":"sha256:98f7b84a2fdff048beec19238fd3d580d5dac1a7c80db8fbb36c2d3292f3b9ea","target":"graph","created_at":"2026-05-18T00:10:39Z","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 classical result of Bondy and Simonovits in extremal graph theory states that if a graph on $n$ vertices contains no cycle of length $2k$ then it has at most $O(n^{1+1/k})$ edges. However, matching lower bounds are only known for $k=2,3,5$.\n  In this paper we study ordered variants of this problem and prove some tight estimates for a certain class of ordered cycles that we call bordered cycles. In particular, we show that the maximum number of edges in an ordered graph avoiding bordered cycles of length at most $2k$ is $\\Theta(n^{1+1/k})$.\n  Strengthening the result of Bondy and Simonovits i","authors_text":"Abhishek Methuku, Casey Tompkins, D\\'aniel Kor\\'andi, Ervin Gy\\H{o}ri, Istv\\'an Tomon, M\\'at\\'e Vizer","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-10-20T18:46:16Z","title":"On the Tur\\'an number of some ordered even cycles"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.07664","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:be6ff62a4c42958865c6668141a1b22cbde942eca9a69d4d09ede0ebdc16f1d8","target":"record","created_at":"2026-05-18T00:10:39Z","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":"600173b8d66d13b8f686a5ae7bfd215b76375198c997a52149fd47bd5c6a8e24","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-10-20T18:46:16Z","title_canon_sha256":"c83fc4c79a8a0e5e89e284c16895c7fa3a4af9df86b6520b766f46669a1b45e5"},"schema_version":"1.0","source":{"id":"1710.07664","kind":"arxiv","version":2}},"canonical_sha256":"179e6f3f523f5cc293f5d2e952e75817a447c6cf9793a0a099912572649bb315","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"179e6f3f523f5cc293f5d2e952e75817a447c6cf9793a0a099912572649bb315","first_computed_at":"2026-05-18T00:10:39.008799Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:10:39.008799Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"YGaOwQCHeMAOpwoYi/qqYEx+NxC7cRPrrA0jWAvK8DSeyWS/Yh5pj/MQLRE2ngdEcyU8SdIe10RRxCH2el4IAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:10:39.010635Z","signed_message":"canonical_sha256_bytes"},"source_id":"1710.07664","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:be6ff62a4c42958865c6668141a1b22cbde942eca9a69d4d09ede0ebdc16f1d8","sha256:98f7b84a2fdff048beec19238fd3d580d5dac1a7c80db8fbb36c2d3292f3b9ea"],"state_sha256":"3761ba523a8f7cc547965ce4f16cb473b3664159d05cab494a569c6e33d6e28c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"heJwc8smGEJvMVBrLfVzFp0tn+vkKw82db0EbUZxnNPgzMniAUpaqnhPrstzuj56yOEvPxNxGRPa1XmM+Q62AQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T03:36:06.102399Z","bundle_sha256":"7e36c932e166fc10b110fddb391ee8f4fcebc885cbf08c51620f95ef3f049d8c"}}