{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:TINI57GGB43S5KE6ZATNFM3ZT5","short_pith_number":"pith:TINI57GG","schema_version":"1.0","canonical_sha256":"9a1a8efcc60f372ea89ec826d2b3799f4d921446d48bac54b20c4aec8ffaff6b","source":{"kind":"arxiv","id":"1609.04761","version":1},"attestation_state":"computed","paper":{"title":"On the Linear Cycle Cover Conjecture of Gy\\'arf\\'as and S\\'ark\\\"ozy","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Abhishek Methuku, Beka Ergemlidze, Ervin Gy\\H{o}ri","submitted_at":"2016-09-15T18:15:51Z","abstract_excerpt":"A linear cycle in a hypergraph $H$ is a cyclic sequence of hyperedges such that two consecutive hyperedges intersect in exactly one element and two nonconsecutive hyperedges are disjoint and $\\alpha(H)$ denotes the size of a largest independent set of $H$. In this note, we show that the vertex set of every $3$-uniform hypergraph $H$ can be covered by at most $\\alpha(H)$ pairwise edge-disjoint linear cycles (where we accept a vertex and a hyperedge as a linear cycle), proving a weaker version of a conjecture of Gy\\'arf\\'as and S\\'ark\\\"ozy."},"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":"1609.04761","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-09-15T18:15:51Z","cross_cats_sorted":[],"title_canon_sha256":"e0b93a4480a87a8daf5fee548872f30447e64ec7bac081bc3347741f9bb01c8b","abstract_canon_sha256":"83fed6d20b3b02d88c0bda980a21057975997826580ddc324ee517789ae8055d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:04:35.640517Z","signature_b64":"CihK5rzQYdVrQ5zXnWiZx1y8XtmjgeYqvMT6viDCg0r5ghcBnia5Zz1IxOa9/IoQlcnYlNFzkTpuhBMo868iBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9a1a8efcc60f372ea89ec826d2b3799f4d921446d48bac54b20c4aec8ffaff6b","last_reissued_at":"2026-05-18T01:04:35.639853Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:04:35.639853Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the Linear Cycle Cover Conjecture of Gy\\'arf\\'as and S\\'ark\\\"ozy","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Abhishek Methuku, Beka Ergemlidze, Ervin Gy\\H{o}ri","submitted_at":"2016-09-15T18:15:51Z","abstract_excerpt":"A linear cycle in a hypergraph $H$ is a cyclic sequence of hyperedges such that two consecutive hyperedges intersect in exactly one element and two nonconsecutive hyperedges are disjoint and $\\alpha(H)$ denotes the size of a largest independent set of $H$. In this note, we show that the vertex set of every $3$-uniform hypergraph $H$ can be covered by at most $\\alpha(H)$ pairwise edge-disjoint linear cycles (where we accept a vertex and a hyperedge as a linear cycle), proving a weaker version of a conjecture of Gy\\'arf\\'as and S\\'ark\\\"ozy."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.04761","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":"1609.04761","created_at":"2026-05-18T01:04:35.639948+00:00"},{"alias_kind":"arxiv_version","alias_value":"1609.04761v1","created_at":"2026-05-18T01:04:35.639948+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.04761","created_at":"2026-05-18T01:04:35.639948+00:00"},{"alias_kind":"pith_short_12","alias_value":"TINI57GGB43S","created_at":"2026-05-18T12:30:44.179134+00:00"},{"alias_kind":"pith_short_16","alias_value":"TINI57GGB43S5KE6","created_at":"2026-05-18T12:30:44.179134+00:00"},{"alias_kind":"pith_short_8","alias_value":"TINI57GG","created_at":"2026-05-18T12:30:44.179134+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/TINI57GGB43S5KE6ZATNFM3ZT5","json":"https://pith.science/pith/TINI57GGB43S5KE6ZATNFM3ZT5.json","graph_json":"https://pith.science/api/pith-number/TINI57GGB43S5KE6ZATNFM3ZT5/graph.json","events_json":"https://pith.science/api/pith-number/TINI57GGB43S5KE6ZATNFM3ZT5/events.json","paper":"https://pith.science/paper/TINI57GG"},"agent_actions":{"view_html":"https://pith.science/pith/TINI57GGB43S5KE6ZATNFM3ZT5","download_json":"https://pith.science/pith/TINI57GGB43S5KE6ZATNFM3ZT5.json","view_paper":"https://pith.science/paper/TINI57GG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1609.04761&json=true","fetch_graph":"https://pith.science/api/pith-number/TINI57GGB43S5KE6ZATNFM3ZT5/graph.json","fetch_events":"https://pith.science/api/pith-number/TINI57GGB43S5KE6ZATNFM3ZT5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TINI57GGB43S5KE6ZATNFM3ZT5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TINI57GGB43S5KE6ZATNFM3ZT5/action/storage_attestation","attest_author":"https://pith.science/pith/TINI57GGB43S5KE6ZATNFM3ZT5/action/author_attestation","sign_citation":"https://pith.science/pith/TINI57GGB43S5KE6ZATNFM3ZT5/action/citation_signature","submit_replication":"https://pith.science/pith/TINI57GGB43S5KE6ZATNFM3ZT5/action/replication_record"}},"created_at":"2026-05-18T01:04:35.639948+00:00","updated_at":"2026-05-18T01:04:35.639948+00:00"}