{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:PEMB5BOJ665UYWKSTVWAEP5RQ2","short_pith_number":"pith:PEMB5BOJ","schema_version":"1.0","canonical_sha256":"79181e85c9f7bb4c59529d6c023fb186a48a3291c1cf1819af7514cb839539bf","source":{"kind":"arxiv","id":"1412.7205","version":1},"attestation_state":"computed","paper":{"title":"On $3$-uniform hypergraphs without linear cycles","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Andr\\'as Gy\\'arf\\'as, Ervin Gy\\H{o}ri, Mikl\\'os Simonovits","submitted_at":"2014-12-22T23:13:10Z","abstract_excerpt":"We explore properties of $3$-uniform hypergraphs $H$ without linear cycles. Our main results are that these hypergraphs must contain a vertex of strong degree at most two and must have independent sets of size at least ${2|V(H)|\\over 5}$."},"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":"1412.7205","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-12-22T23:13:10Z","cross_cats_sorted":[],"title_canon_sha256":"77b7b308c1110a5add554496d2eaa5a0366b23d60f596519647b68525a03fbe0","abstract_canon_sha256":"ab01a61629c82f0a2171a69b8faad5e78f4b3422bc92e60f31085baf35a6ef54"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:30:40.793940Z","signature_b64":"0Vklf2v+1epy9/HAq0DCkbqJGdpqFWgl7ErveAvzh3i1kKm7Igwd8/1msTN1rywQMbYL9LMSMKi14DHIe3z3Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"79181e85c9f7bb4c59529d6c023fb186a48a3291c1cf1819af7514cb839539bf","last_reissued_at":"2026-05-18T02:30:40.793528Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:30:40.793528Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On $3$-uniform hypergraphs without linear cycles","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Andr\\'as Gy\\'arf\\'as, Ervin Gy\\H{o}ri, Mikl\\'os Simonovits","submitted_at":"2014-12-22T23:13:10Z","abstract_excerpt":"We explore properties of $3$-uniform hypergraphs $H$ without linear cycles. Our main results are that these hypergraphs must contain a vertex of strong degree at most two and must have independent sets of size at least ${2|V(H)|\\over 5}$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.7205","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":""},"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":"1412.7205","created_at":"2026-05-18T02:30:40.793587+00:00"},{"alias_kind":"arxiv_version","alias_value":"1412.7205v1","created_at":"2026-05-18T02:30:40.793587+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.7205","created_at":"2026-05-18T02:30:40.793587+00:00"},{"alias_kind":"pith_short_12","alias_value":"PEMB5BOJ665U","created_at":"2026-05-18T12:28:43.426989+00:00"},{"alias_kind":"pith_short_16","alias_value":"PEMB5BOJ665UYWKS","created_at":"2026-05-18T12:28:43.426989+00:00"},{"alias_kind":"pith_short_8","alias_value":"PEMB5BOJ","created_at":"2026-05-18T12:28:43.426989+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/PEMB5BOJ665UYWKSTVWAEP5RQ2","json":"https://pith.science/pith/PEMB5BOJ665UYWKSTVWAEP5RQ2.json","graph_json":"https://pith.science/api/pith-number/PEMB5BOJ665UYWKSTVWAEP5RQ2/graph.json","events_json":"https://pith.science/api/pith-number/PEMB5BOJ665UYWKSTVWAEP5RQ2/events.json","paper":"https://pith.science/paper/PEMB5BOJ"},"agent_actions":{"view_html":"https://pith.science/pith/PEMB5BOJ665UYWKSTVWAEP5RQ2","download_json":"https://pith.science/pith/PEMB5BOJ665UYWKSTVWAEP5RQ2.json","view_paper":"https://pith.science/paper/PEMB5BOJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1412.7205&json=true","fetch_graph":"https://pith.science/api/pith-number/PEMB5BOJ665UYWKSTVWAEP5RQ2/graph.json","fetch_events":"https://pith.science/api/pith-number/PEMB5BOJ665UYWKSTVWAEP5RQ2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PEMB5BOJ665UYWKSTVWAEP5RQ2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PEMB5BOJ665UYWKSTVWAEP5RQ2/action/storage_attestation","attest_author":"https://pith.science/pith/PEMB5BOJ665UYWKSTVWAEP5RQ2/action/author_attestation","sign_citation":"https://pith.science/pith/PEMB5BOJ665UYWKSTVWAEP5RQ2/action/citation_signature","submit_replication":"https://pith.science/pith/PEMB5BOJ665UYWKSTVWAEP5RQ2/action/replication_record"}},"created_at":"2026-05-18T02:30:40.793587+00:00","updated_at":"2026-05-18T02:30:40.793587+00:00"}