{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:JGQYVJC3Y2GG3IZA76GQEPDSWI","short_pith_number":"pith:JGQYVJC3","canonical_record":{"source":{"id":"1307.0075","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-06-29T08:30:05Z","cross_cats_sorted":[],"title_canon_sha256":"08cebec65bb57324626a87000e9cf33dd376268ddf49c982728dbbb5089548ac","abstract_canon_sha256":"df58788263b011d9f5871f4c5ffba2ae6882c6efa483b0408f3d76733d9ce83c"},"schema_version":"1.0"},"canonical_sha256":"49a18aa45bc68c6da320ff8d023c72b22c2ddb06ef93258ba71b4077019db902","source":{"kind":"arxiv","id":"1307.0075","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1307.0075","created_at":"2026-05-18T01:55:43Z"},{"alias_kind":"arxiv_version","alias_value":"1307.0075v3","created_at":"2026-05-18T01:55:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.0075","created_at":"2026-05-18T01:55:43Z"},{"alias_kind":"pith_short_12","alias_value":"JGQYVJC3Y2GG","created_at":"2026-05-18T12:27:49Z"},{"alias_kind":"pith_short_16","alias_value":"JGQYVJC3Y2GG3IZA","created_at":"2026-05-18T12:27:49Z"},{"alias_kind":"pith_short_8","alias_value":"JGQYVJC3","created_at":"2026-05-18T12:27:49Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:JGQYVJC3Y2GG3IZA76GQEPDSWI","target":"record","payload":{"canonical_record":{"source":{"id":"1307.0075","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-06-29T08:30:05Z","cross_cats_sorted":[],"title_canon_sha256":"08cebec65bb57324626a87000e9cf33dd376268ddf49c982728dbbb5089548ac","abstract_canon_sha256":"df58788263b011d9f5871f4c5ffba2ae6882c6efa483b0408f3d76733d9ce83c"},"schema_version":"1.0"},"canonical_sha256":"49a18aa45bc68c6da320ff8d023c72b22c2ddb06ef93258ba71b4077019db902","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:55:43.419642Z","signature_b64":"kj6ABa2BDFpYBXrSQHHb5DfaE0g4bpsebA0SwPWpyAi+SIPHS5Dd0XSh+rQfLaw+OueGja0ijW+Xhu7PV3LHBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"49a18aa45bc68c6da320ff8d023c72b22c2ddb06ef93258ba71b4077019db902","last_reissued_at":"2026-05-18T01:55:43.418824Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:55:43.418824Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1307.0075","source_version":3,"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:55:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"um9ZKGdgPZWEIcD9dSYx7HRt+4DkqJAKO1GIWPysU8+H4UGhd1hLMcmeqmcjJXlLRhRXAbqTEzKN0aC/aYlOCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-19T19:00:02.967685Z"},"content_sha256":"83c80b7c4abca1e0954ef65284765b48372b024f206cd3bd8c7a22e9a261ed17","schema_version":"1.0","event_id":"sha256:83c80b7c4abca1e0954ef65284765b48372b024f206cd3bd8c7a22e9a261ed17"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:JGQYVJC3Y2GG3IZA76GQEPDSWI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The codegree threshold for 3-graphs with independent neighbourhoods","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Edward Marchant, Emil Vaughan, Oleg Pikhurko, Victor Falgas-Ravry","submitted_at":"2013-06-29T08:30:05Z","abstract_excerpt":"Given a family of 3-graphs $F$, we define its codegree threshold $\\mathrm{coex}(n, F)$ to be the largest number $d=d(n)$ such that there exists an $n$-vertex 3-graph in which every pair of vertices is contained in at least $d$ 3-edges but which contains no member of $F$ as a subgraph. Let $F_{3,2}$ be the 3-graph on $\\{a,b,c,d,e\\}$ with 3-edges $\\{abc,abd,abe,cde\\}$.\n  In this paper, we give two proofs that $\\mathrm{coex}(n, F_{3,2})= n/3 +o(n)$, the first by a direct combinatorial argument and the second via a flag algebra computation. Information extracted from the latter proof is then used "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1307.0075","kind":"arxiv","version":3},"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:55:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SdhgB58IX1npRkvfkCby4uUq22XkAZ6UnP5tWRKvTBttwr79xg4JMPFMkDLtEc5E9cpAWKy9aufmfUp4GxnCCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-19T19:00:02.968038Z"},"content_sha256":"5cf78c26b531220e7507431ce94be2fb9098afe13df6df0caf99d78657018d4d","schema_version":"1.0","event_id":"sha256:5cf78c26b531220e7507431ce94be2fb9098afe13df6df0caf99d78657018d4d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JGQYVJC3Y2GG3IZA76GQEPDSWI/bundle.json","state_url":"https://pith.science/pith/JGQYVJC3Y2GG3IZA76GQEPDSWI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JGQYVJC3Y2GG3IZA76GQEPDSWI/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-19T19:00:02Z","links":{"resolver":"https://pith.science/pith/JGQYVJC3Y2GG3IZA76GQEPDSWI","bundle":"https://pith.science/pith/JGQYVJC3Y2GG3IZA76GQEPDSWI/bundle.json","state":"https://pith.science/pith/JGQYVJC3Y2GG3IZA76GQEPDSWI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JGQYVJC3Y2GG3IZA76GQEPDSWI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:JGQYVJC3Y2GG3IZA76GQEPDSWI","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":"df58788263b011d9f5871f4c5ffba2ae6882c6efa483b0408f3d76733d9ce83c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-06-29T08:30:05Z","title_canon_sha256":"08cebec65bb57324626a87000e9cf33dd376268ddf49c982728dbbb5089548ac"},"schema_version":"1.0","source":{"id":"1307.0075","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1307.0075","created_at":"2026-05-18T01:55:43Z"},{"alias_kind":"arxiv_version","alias_value":"1307.0075v3","created_at":"2026-05-18T01:55:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.0075","created_at":"2026-05-18T01:55:43Z"},{"alias_kind":"pith_short_12","alias_value":"JGQYVJC3Y2GG","created_at":"2026-05-18T12:27:49Z"},{"alias_kind":"pith_short_16","alias_value":"JGQYVJC3Y2GG3IZA","created_at":"2026-05-18T12:27:49Z"},{"alias_kind":"pith_short_8","alias_value":"JGQYVJC3","created_at":"2026-05-18T12:27:49Z"}],"graph_snapshots":[{"event_id":"sha256:5cf78c26b531220e7507431ce94be2fb9098afe13df6df0caf99d78657018d4d","target":"graph","created_at":"2026-05-18T01:55:43Z","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":"Given a family of 3-graphs $F$, we define its codegree threshold $\\mathrm{coex}(n, F)$ to be the largest number $d=d(n)$ such that there exists an $n$-vertex 3-graph in which every pair of vertices is contained in at least $d$ 3-edges but which contains no member of $F$ as a subgraph. Let $F_{3,2}$ be the 3-graph on $\\{a,b,c,d,e\\}$ with 3-edges $\\{abc,abd,abe,cde\\}$.\n  In this paper, we give two proofs that $\\mathrm{coex}(n, F_{3,2})= n/3 +o(n)$, the first by a direct combinatorial argument and the second via a flag algebra computation. Information extracted from the latter proof is then used ","authors_text":"Edward Marchant, Emil Vaughan, Oleg Pikhurko, Victor Falgas-Ravry","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-06-29T08:30:05Z","title":"The codegree threshold for 3-graphs with independent neighbourhoods"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1307.0075","kind":"arxiv","version":3},"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:83c80b7c4abca1e0954ef65284765b48372b024f206cd3bd8c7a22e9a261ed17","target":"record","created_at":"2026-05-18T01:55:43Z","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":"df58788263b011d9f5871f4c5ffba2ae6882c6efa483b0408f3d76733d9ce83c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-06-29T08:30:05Z","title_canon_sha256":"08cebec65bb57324626a87000e9cf33dd376268ddf49c982728dbbb5089548ac"},"schema_version":"1.0","source":{"id":"1307.0075","kind":"arxiv","version":3}},"canonical_sha256":"49a18aa45bc68c6da320ff8d023c72b22c2ddb06ef93258ba71b4077019db902","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"49a18aa45bc68c6da320ff8d023c72b22c2ddb06ef93258ba71b4077019db902","first_computed_at":"2026-05-18T01:55:43.418824Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:55:43.418824Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"kj6ABa2BDFpYBXrSQHHb5DfaE0g4bpsebA0SwPWpyAi+SIPHS5Dd0XSh+rQfLaw+OueGja0ijW+Xhu7PV3LHBw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:55:43.419642Z","signed_message":"canonical_sha256_bytes"},"source_id":"1307.0075","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:83c80b7c4abca1e0954ef65284765b48372b024f206cd3bd8c7a22e9a261ed17","sha256:5cf78c26b531220e7507431ce94be2fb9098afe13df6df0caf99d78657018d4d"],"state_sha256":"64bf02f76ac473e434ddb1b23da1aaf3af3b45c3311e9ae01f38adb1ad43ab47"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"f3NUlsEC5aexP7coTMZvB99HYbfe3eyJPteVnBL1OPNUnfEnt/MjQwJHVa/YSWxrigqFYUn3fD4HAfqbABP/Aw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-19T19:00:02.970068Z","bundle_sha256":"d7d4a4ddfd157a9538d07cd4284a98a087d37a1453cf4ebb60ccf02f99c6055a"}}