{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:XR6BWATVHT6XNEMMQLYGTDADI2","short_pith_number":"pith:XR6BWATV","schema_version":"1.0","canonical_sha256":"bc7c1b02753cfd76918c82f0698c0346ad4b622b6e8541d12434c36a06fed116","source":{"kind":"arxiv","id":"1306.5637","version":2},"attestation_state":"computed","paper":{"title":"Triply Existentially Complete Triangle-Free Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Chaim Even-Zohar, Nati Linial","submitted_at":"2013-06-24T14:15:06Z","abstract_excerpt":"A triangle-free graph G is called k-existentially complete if for every induced k-vertex subgraph H of G, every extension of H to a (k+1)-vertex triangle-free graph can be realized by adding another vertex of G to H. Cherlin asked whether k-existentially complete triangle-free graphs exist for every k. Here we present known and new constructions of 3-existentially complete triangle-free graphs."},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1306.5637","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-06-24T14:15:06Z","cross_cats_sorted":[],"title_canon_sha256":"beab4cdb638040893eec0fa72fd3aedbbe2bfa33d25ca8525b8f77afd4b8987d","abstract_canon_sha256":"789ef003c67bd65541007a28e942d300cb2bc9ecd0431e50272829ed6ec88d52"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:35:28.333098Z","signature_b64":"IqDxL+xX30wUybJ4v6ksJLzMWRGJta3gf1dphbdYAcDjoM2NE68UY2eFU94HI3hrgccP22qPwAXTHUrMkbyqDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bc7c1b02753cfd76918c82f0698c0346ad4b622b6e8541d12434c36a06fed116","last_reissued_at":"2026-05-18T01:35:28.332501Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:35:28.332501Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Triply Existentially Complete Triangle-Free Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Chaim Even-Zohar, Nati Linial","submitted_at":"2013-06-24T14:15:06Z","abstract_excerpt":"A triangle-free graph G is called k-existentially complete if for every induced k-vertex subgraph H of G, every extension of H to a (k+1)-vertex triangle-free graph can be realized by adding another vertex of G to H. Cherlin asked whether k-existentially complete triangle-free graphs exist for every k. Here we present known and new constructions of 3-existentially complete triangle-free graphs."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1306.5637","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1306.5637","created_at":"2026-05-18T01:35:28.332585+00:00"},{"alias_kind":"arxiv_version","alias_value":"1306.5637v2","created_at":"2026-05-18T01:35:28.332585+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1306.5637","created_at":"2026-05-18T01:35:28.332585+00:00"},{"alias_kind":"pith_short_12","alias_value":"XR6BWATVHT6X","created_at":"2026-05-18T12:28:06.772260+00:00"},{"alias_kind":"pith_short_16","alias_value":"XR6BWATVHT6XNEMM","created_at":"2026-05-18T12:28:06.772260+00:00"},{"alias_kind":"pith_short_8","alias_value":"XR6BWATV","created_at":"2026-05-18T12:28:06.772260+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/XR6BWATVHT6XNEMMQLYGTDADI2","json":"https://pith.science/pith/XR6BWATVHT6XNEMMQLYGTDADI2.json","graph_json":"https://pith.science/api/pith-number/XR6BWATVHT6XNEMMQLYGTDADI2/graph.json","events_json":"https://pith.science/api/pith-number/XR6BWATVHT6XNEMMQLYGTDADI2/events.json","paper":"https://pith.science/paper/XR6BWATV"},"agent_actions":{"view_html":"https://pith.science/pith/XR6BWATVHT6XNEMMQLYGTDADI2","download_json":"https://pith.science/pith/XR6BWATVHT6XNEMMQLYGTDADI2.json","view_paper":"https://pith.science/paper/XR6BWATV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1306.5637&json=true","fetch_graph":"https://pith.science/api/pith-number/XR6BWATVHT6XNEMMQLYGTDADI2/graph.json","fetch_events":"https://pith.science/api/pith-number/XR6BWATVHT6XNEMMQLYGTDADI2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XR6BWATVHT6XNEMMQLYGTDADI2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XR6BWATVHT6XNEMMQLYGTDADI2/action/storage_attestation","attest_author":"https://pith.science/pith/XR6BWATVHT6XNEMMQLYGTDADI2/action/author_attestation","sign_citation":"https://pith.science/pith/XR6BWATVHT6XNEMMQLYGTDADI2/action/citation_signature","submit_replication":"https://pith.science/pith/XR6BWATVHT6XNEMMQLYGTDADI2/action/replication_record"}},"created_at":"2026-05-18T01:35:28.332585+00:00","updated_at":"2026-05-18T01:35:28.332585+00:00"}