{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:6RXC4Q44ZM2ZXAFMBUSHKMYICW","short_pith_number":"pith:6RXC4Q44","canonical_record":{"source":{"id":"1404.5015","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-04-20T05:41:23Z","cross_cats_sorted":[],"title_canon_sha256":"ff9409ebdb63d0d81ccf659b2bd6c0010ceb0be31cea9ac3abc2c83d71ed2911","abstract_canon_sha256":"b0cbbb5c99e9b2424c0b892f41dd1102f3e25e038133e1a9f2e27e068aa041b6"},"schema_version":"1.0"},"canonical_sha256":"f46e2e439ccb359b80ac0d2475330815926693076d842ed82dadc53ebc745a59","source":{"kind":"arxiv","id":"1404.5015","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1404.5015","created_at":"2026-05-18T02:53:28Z"},{"alias_kind":"arxiv_version","alias_value":"1404.5015v2","created_at":"2026-05-18T02:53:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.5015","created_at":"2026-05-18T02:53:28Z"},{"alias_kind":"pith_short_12","alias_value":"6RXC4Q44ZM2Z","created_at":"2026-05-18T12:28:16Z"},{"alias_kind":"pith_short_16","alias_value":"6RXC4Q44ZM2ZXAFM","created_at":"2026-05-18T12:28:16Z"},{"alias_kind":"pith_short_8","alias_value":"6RXC4Q44","created_at":"2026-05-18T12:28:16Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:6RXC4Q44ZM2ZXAFMBUSHKMYICW","target":"record","payload":{"canonical_record":{"source":{"id":"1404.5015","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-04-20T05:41:23Z","cross_cats_sorted":[],"title_canon_sha256":"ff9409ebdb63d0d81ccf659b2bd6c0010ceb0be31cea9ac3abc2c83d71ed2911","abstract_canon_sha256":"b0cbbb5c99e9b2424c0b892f41dd1102f3e25e038133e1a9f2e27e068aa041b6"},"schema_version":"1.0"},"canonical_sha256":"f46e2e439ccb359b80ac0d2475330815926693076d842ed82dadc53ebc745a59","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:53:28.410294Z","signature_b64":"8vOsLcLHDeXk4pmsXkrBBTuZmw9PlL7DWJRw+mYVuWVTy//QTbc//Y+vkdAJMYoEkaZO4NqJOXTWr2OjQj1fDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f46e2e439ccb359b80ac0d2475330815926693076d842ed82dadc53ebc745a59","last_reissued_at":"2026-05-18T02:53:28.409519Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:53:28.409519Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1404.5015","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-18T02:53:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lYXC3zGbFg0/X7xJwFEqRL+iiY1BYSFdL39hEowukBDRp/BtxAp+XtafJa2zMA5tnuPxja0g86Ji5DH9oJ+fBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T23:19:59.732609Z"},"content_sha256":"2b7b975cabe8e31c345e0c07effe9e89b70d9280502107713a6a6860c2d032e7","schema_version":"1.0","event_id":"sha256:2b7b975cabe8e31c345e0c07effe9e89b70d9280502107713a6a6860c2d032e7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:6RXC4Q44ZM2ZXAFMBUSHKMYICW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Linear Turan numbers of r-uniform linear cycles and related Ramsey numbers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Clayton Collier-Cartaino, Nathan Graber, Tao Jiang","submitted_at":"2014-04-20T05:41:23Z","abstract_excerpt":"An $r$-uniform hypergraph is called an $r$-graph. A hypergraph is linear if every two edges intersect in at most one vertex. Given a linear $r$-graph $H$ and a positive integer $n$, the linear Tur\\'an number $ex_L(n,H)$ is the maximum number of edges in a linear $r$-graph $G$ that does not contain $H$ as a subgraph. For each $\\ell\\geq 3$, let $C^r_\\ell$ denote the $r$-uniform linear cycle of length $\\ell$, which is an $r$-graph with edges $e_1,\\ldots, e_\\ell$ such that $\\forall i\\in [\\ell-1]$, $|e_i\\cap e_{i+1}|=1$, $|e_\\ell\\cap e_1|=1$ and $e_i\\cap e_j=\\emptyset$ for all other pairs $\\{i,j\\},"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.5015","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-18T02:53:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YdFwFDbvSs94OZvsLD5a9cXJH92BIb46BAwCI4QYWBnd/oy2+L7Jn4k/p6muTB+fbtA8OQpI1gCTxXF34BLeDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T23:19:59.733401Z"},"content_sha256":"2d192f3825ba214bb29d5e2a49348873625b666871faf2b7b7ec36fb5720389d","schema_version":"1.0","event_id":"sha256:2d192f3825ba214bb29d5e2a49348873625b666871faf2b7b7ec36fb5720389d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6RXC4Q44ZM2ZXAFMBUSHKMYICW/bundle.json","state_url":"https://pith.science/pith/6RXC4Q44ZM2ZXAFMBUSHKMYICW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6RXC4Q44ZM2ZXAFMBUSHKMYICW/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-31T23:19:59Z","links":{"resolver":"https://pith.science/pith/6RXC4Q44ZM2ZXAFMBUSHKMYICW","bundle":"https://pith.science/pith/6RXC4Q44ZM2ZXAFMBUSHKMYICW/bundle.json","state":"https://pith.science/pith/6RXC4Q44ZM2ZXAFMBUSHKMYICW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6RXC4Q44ZM2ZXAFMBUSHKMYICW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:6RXC4Q44ZM2ZXAFMBUSHKMYICW","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":"b0cbbb5c99e9b2424c0b892f41dd1102f3e25e038133e1a9f2e27e068aa041b6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-04-20T05:41:23Z","title_canon_sha256":"ff9409ebdb63d0d81ccf659b2bd6c0010ceb0be31cea9ac3abc2c83d71ed2911"},"schema_version":"1.0","source":{"id":"1404.5015","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1404.5015","created_at":"2026-05-18T02:53:28Z"},{"alias_kind":"arxiv_version","alias_value":"1404.5015v2","created_at":"2026-05-18T02:53:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.5015","created_at":"2026-05-18T02:53:28Z"},{"alias_kind":"pith_short_12","alias_value":"6RXC4Q44ZM2Z","created_at":"2026-05-18T12:28:16Z"},{"alias_kind":"pith_short_16","alias_value":"6RXC4Q44ZM2ZXAFM","created_at":"2026-05-18T12:28:16Z"},{"alias_kind":"pith_short_8","alias_value":"6RXC4Q44","created_at":"2026-05-18T12:28:16Z"}],"graph_snapshots":[{"event_id":"sha256:2d192f3825ba214bb29d5e2a49348873625b666871faf2b7b7ec36fb5720389d","target":"graph","created_at":"2026-05-18T02:53:28Z","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":"An $r$-uniform hypergraph is called an $r$-graph. A hypergraph is linear if every two edges intersect in at most one vertex. Given a linear $r$-graph $H$ and a positive integer $n$, the linear Tur\\'an number $ex_L(n,H)$ is the maximum number of edges in a linear $r$-graph $G$ that does not contain $H$ as a subgraph. For each $\\ell\\geq 3$, let $C^r_\\ell$ denote the $r$-uniform linear cycle of length $\\ell$, which is an $r$-graph with edges $e_1,\\ldots, e_\\ell$ such that $\\forall i\\in [\\ell-1]$, $|e_i\\cap e_{i+1}|=1$, $|e_\\ell\\cap e_1|=1$ and $e_i\\cap e_j=\\emptyset$ for all other pairs $\\{i,j\\},","authors_text":"Clayton Collier-Cartaino, Nathan Graber, Tao Jiang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-04-20T05:41:23Z","title":"Linear Turan numbers of r-uniform linear cycles and related Ramsey numbers"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.5015","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:2b7b975cabe8e31c345e0c07effe9e89b70d9280502107713a6a6860c2d032e7","target":"record","created_at":"2026-05-18T02:53:28Z","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":"b0cbbb5c99e9b2424c0b892f41dd1102f3e25e038133e1a9f2e27e068aa041b6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-04-20T05:41:23Z","title_canon_sha256":"ff9409ebdb63d0d81ccf659b2bd6c0010ceb0be31cea9ac3abc2c83d71ed2911"},"schema_version":"1.0","source":{"id":"1404.5015","kind":"arxiv","version":2}},"canonical_sha256":"f46e2e439ccb359b80ac0d2475330815926693076d842ed82dadc53ebc745a59","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f46e2e439ccb359b80ac0d2475330815926693076d842ed82dadc53ebc745a59","first_computed_at":"2026-05-18T02:53:28.409519Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:53:28.409519Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"8vOsLcLHDeXk4pmsXkrBBTuZmw9PlL7DWJRw+mYVuWVTy//QTbc//Y+vkdAJMYoEkaZO4NqJOXTWr2OjQj1fDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:53:28.410294Z","signed_message":"canonical_sha256_bytes"},"source_id":"1404.5015","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2b7b975cabe8e31c345e0c07effe9e89b70d9280502107713a6a6860c2d032e7","sha256:2d192f3825ba214bb29d5e2a49348873625b666871faf2b7b7ec36fb5720389d"],"state_sha256":"d8f6e5ab74019d97271315d488d14ca7d15ff7cbb872a8c4945cf146dc869255"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vhYQxKFOqpt1VndirOEf1mKTAwxYn19B5mxvdiod5Ys0tw9lUk5v3S+cr9m3KsjS2RvC5dlZHvUbr+zurbsuAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T23:19:59.738152Z","bundle_sha256":"44b2ada21757a3f55338b3749434af053262c2816a60f941f356b637aba43088"}}