{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:PGK3PS3IFQEML6TJ2JFTU4UAPN","short_pith_number":"pith:PGK3PS3I","schema_version":"1.0","canonical_sha256":"7995b7cb682c08c5fa69d24b3a72807b6020f65e427d91984819220e6cfdb74c","source":{"kind":"arxiv","id":"1303.7372","version":2},"attestation_state":"computed","paper":{"title":"A problem of Erdos and Sos on 3-graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Daniel Kral, Jan Volec, Roman Glebov","submitted_at":"2013-03-29T12:17:01Z","abstract_excerpt":"We show that for every positive epsilon there exist positive delta and n_0 such that every 3-uniform hypergraph on n>=n_0 vertices with the property that every k-vertex subset, where k>=delta*n, induces at least (1/4 + epsilon)*{k \\choose 3} edges, contains K4- as a subgraph, where K4- is the 3-uniform hypergraph on 4 vertices with 3 edges. This question was originally raised by Erdos and Sos. The constant 1/4 is the best possible."},"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":"1303.7372","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-03-29T12:17:01Z","cross_cats_sorted":[],"title_canon_sha256":"82bc2ab99f70d617bf59ad2e2021bff91096cbe5e894b61103340180dc113140","abstract_canon_sha256":"29ea950050b33559ec62f101cbfdbe8994213f8ac8894dcb079fa7a0709f1861"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:42:29.061193Z","signature_b64":"Z8rwGmMh53tihZnI2EQPqgYRZMl5qdtKjhGm5txuH69pxTjQbsO401YBE37zapAQWEJhGPe8Y4z/bYvDm6TjBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7995b7cb682c08c5fa69d24b3a72807b6020f65e427d91984819220e6cfdb74c","last_reissued_at":"2026-05-18T02:42:29.060193Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:42:29.060193Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A problem of Erdos and Sos on 3-graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Daniel Kral, Jan Volec, Roman Glebov","submitted_at":"2013-03-29T12:17:01Z","abstract_excerpt":"We show that for every positive epsilon there exist positive delta and n_0 such that every 3-uniform hypergraph on n>=n_0 vertices with the property that every k-vertex subset, where k>=delta*n, induces at least (1/4 + epsilon)*{k \\choose 3} edges, contains K4- as a subgraph, where K4- is the 3-uniform hypergraph on 4 vertices with 3 edges. This question was originally raised by Erdos and Sos. The constant 1/4 is the best possible."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1303.7372","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":"1303.7372","created_at":"2026-05-18T02:42:29.060372+00:00"},{"alias_kind":"arxiv_version","alias_value":"1303.7372v2","created_at":"2026-05-18T02:42:29.060372+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1303.7372","created_at":"2026-05-18T02:42:29.060372+00:00"},{"alias_kind":"pith_short_12","alias_value":"PGK3PS3IFQEM","created_at":"2026-05-18T12:27:54.935989+00:00"},{"alias_kind":"pith_short_16","alias_value":"PGK3PS3IFQEML6TJ","created_at":"2026-05-18T12:27:54.935989+00:00"},{"alias_kind":"pith_short_8","alias_value":"PGK3PS3I","created_at":"2026-05-18T12:27:54.935989+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/PGK3PS3IFQEML6TJ2JFTU4UAPN","json":"https://pith.science/pith/PGK3PS3IFQEML6TJ2JFTU4UAPN.json","graph_json":"https://pith.science/api/pith-number/PGK3PS3IFQEML6TJ2JFTU4UAPN/graph.json","events_json":"https://pith.science/api/pith-number/PGK3PS3IFQEML6TJ2JFTU4UAPN/events.json","paper":"https://pith.science/paper/PGK3PS3I"},"agent_actions":{"view_html":"https://pith.science/pith/PGK3PS3IFQEML6TJ2JFTU4UAPN","download_json":"https://pith.science/pith/PGK3PS3IFQEML6TJ2JFTU4UAPN.json","view_paper":"https://pith.science/paper/PGK3PS3I","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1303.7372&json=true","fetch_graph":"https://pith.science/api/pith-number/PGK3PS3IFQEML6TJ2JFTU4UAPN/graph.json","fetch_events":"https://pith.science/api/pith-number/PGK3PS3IFQEML6TJ2JFTU4UAPN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PGK3PS3IFQEML6TJ2JFTU4UAPN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PGK3PS3IFQEML6TJ2JFTU4UAPN/action/storage_attestation","attest_author":"https://pith.science/pith/PGK3PS3IFQEML6TJ2JFTU4UAPN/action/author_attestation","sign_citation":"https://pith.science/pith/PGK3PS3IFQEML6TJ2JFTU4UAPN/action/citation_signature","submit_replication":"https://pith.science/pith/PGK3PS3IFQEML6TJ2JFTU4UAPN/action/replication_record"}},"created_at":"2026-05-18T02:42:29.060372+00:00","updated_at":"2026-05-18T02:42:29.060372+00:00"}