{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:JM62KPQEB22JQEULAHVRINKGET","short_pith_number":"pith:JM62KPQE","schema_version":"1.0","canonical_sha256":"4b3da53e040eb498128b01eb14354624f8303f9c9ed0f032fbb4d52b819815a5","source":{"kind":"arxiv","id":"2508.09841","version":1},"attestation_state":"computed","paper":{"title":"The Brown-Erd\\H{o}s-S\\'os conjecture in dense triple systems","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Giovanne Santos, Mykhaylo Tyomkyn","submitted_at":"2025-08-13T14:20:59Z","abstract_excerpt":"The famous Brown-Erd\\H{o}s-S\\'os conjecture from 1973 states, in an equivalent form, that for any fixed $\\delta>0$ and integer $k\\geq 3$ every sufficiently large linear $3$-uniform hypergraph of size $\\delta n^2$ contains some $k$ edges spanning at most $k+3$ vertices. We prove it to hold for $\\delta>4/5$, establishing the first bound of this kind."},"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":"2508.09841","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-08-13T14:20:59Z","cross_cats_sorted":[],"title_canon_sha256":"119d0e860241ec77aca694b57d10d006ec74bec5cd34ac24390453c1279fc716","abstract_canon_sha256":"a6748abac018ba4faece50a0793f33856c3c9ecb4fa54b4ff1ff2dfdf867a461"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:53:22.804824Z","signature_b64":"FwKMeheoxMtIRlVLDBtj5UON42phCQsfWE6lgI1vgFIQXuTa/e78AjjBRw07mgBnFu6i5OJAGUYXlY0NQ9aZCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4b3da53e040eb498128b01eb14354624f8303f9c9ed0f032fbb4d52b819815a5","last_reissued_at":"2026-07-05T11:53:22.804325Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:53:22.804325Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Brown-Erd\\H{o}s-S\\'os conjecture in dense triple systems","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Giovanne Santos, Mykhaylo Tyomkyn","submitted_at":"2025-08-13T14:20:59Z","abstract_excerpt":"The famous Brown-Erd\\H{o}s-S\\'os conjecture from 1973 states, in an equivalent form, that for any fixed $\\delta>0$ and integer $k\\geq 3$ every sufficiently large linear $3$-uniform hypergraph of size $\\delta n^2$ contains some $k$ edges spanning at most $k+3$ vertices. We prove it to hold for $\\delta>4/5$, establishing the first bound of this kind."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2508.09841","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2508.09841/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2508.09841","created_at":"2026-07-05T11:53:22.804383+00:00"},{"alias_kind":"arxiv_version","alias_value":"2508.09841v1","created_at":"2026-07-05T11:53:22.804383+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2508.09841","created_at":"2026-07-05T11:53:22.804383+00:00"},{"alias_kind":"pith_short_12","alias_value":"JM62KPQEB22J","created_at":"2026-07-05T11:53:22.804383+00:00"},{"alias_kind":"pith_short_16","alias_value":"JM62KPQEB22JQEUL","created_at":"2026-07-05T11:53:22.804383+00:00"},{"alias_kind":"pith_short_8","alias_value":"JM62KPQE","created_at":"2026-07-05T11:53:22.804383+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.25931","citing_title":"A Simple Counting Argument for Dense Linear Hypergraphs","ref_index":7,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/JM62KPQEB22JQEULAHVRINKGET","json":"https://pith.science/pith/JM62KPQEB22JQEULAHVRINKGET.json","graph_json":"https://pith.science/api/pith-number/JM62KPQEB22JQEULAHVRINKGET/graph.json","events_json":"https://pith.science/api/pith-number/JM62KPQEB22JQEULAHVRINKGET/events.json","paper":"https://pith.science/paper/JM62KPQE"},"agent_actions":{"view_html":"https://pith.science/pith/JM62KPQEB22JQEULAHVRINKGET","download_json":"https://pith.science/pith/JM62KPQEB22JQEULAHVRINKGET.json","view_paper":"https://pith.science/paper/JM62KPQE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2508.09841&json=true","fetch_graph":"https://pith.science/api/pith-number/JM62KPQEB22JQEULAHVRINKGET/graph.json","fetch_events":"https://pith.science/api/pith-number/JM62KPQEB22JQEULAHVRINKGET/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JM62KPQEB22JQEULAHVRINKGET/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JM62KPQEB22JQEULAHVRINKGET/action/storage_attestation","attest_author":"https://pith.science/pith/JM62KPQEB22JQEULAHVRINKGET/action/author_attestation","sign_citation":"https://pith.science/pith/JM62KPQEB22JQEULAHVRINKGET/action/citation_signature","submit_replication":"https://pith.science/pith/JM62KPQEB22JQEULAHVRINKGET/action/replication_record"}},"created_at":"2026-07-05T11:53:22.804383+00:00","updated_at":"2026-07-05T11:53:22.804383+00:00"}