{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:PBDHHCYAHLZMRCLNRU3RTE7IXI","short_pith_number":"pith:PBDHHCYA","schema_version":"1.0","canonical_sha256":"7846738b003af2c8896d8d371993e8ba3c76dcd8b83e7c0c05e67ac22a26bb57","source":{"kind":"arxiv","id":"2503.09458","version":2},"attestation_state":"computed","paper":{"title":"Star decompositions and independent sets in random regular graphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.PR"],"primary_cat":"math.CO","authors_text":"Viktor Harangi","submitted_at":"2025-03-12T15:03:41Z","abstract_excerpt":"A $k$-star decomposition of a graph is a partition of its edges into $k$-stars (i.e., $k$ edges with a common vertex). The paper studies the following problem: for what values of $k>d/2$ does the random $d$-regular graph have a $k$-star decomposition (asymptotically almost surely, provided that the number of edges is divisible by $k$)?\n  Delcourt, Greenhill, Isaev, Lidick\\'y, and Postle proposed the following conjecture. It is easy to see that a $k$-star decomposition necessitates the existence of an independent set of density $1-d/(2k)$. So let $k^{\\mathrm{ind}}_d$ be the largest $k$ for whic"},"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":"2503.09458","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-03-12T15:03:41Z","cross_cats_sorted":["math.PR"],"title_canon_sha256":"4994231915373ed4299485378d836bdafc32c8d80ecf28a52f94386857b39ed0","abstract_canon_sha256":"cc21c8395f7330b0b9c1bd2845a1041fccc29136bc78c6006922ce7b1d6d1370"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:36:38.032390Z","signature_b64":"mqd7aeIFyn9BkOg5J4mKDtj0CGEbUV7qQ6MtccOjLbDFWmErKAe8MeJ4ykDBHkeDzO06CLj3zH/ULB77ZARiDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7846738b003af2c8896d8d371993e8ba3c76dcd8b83e7c0c05e67ac22a26bb57","last_reissued_at":"2026-07-05T10:36:38.031478Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:36:38.031478Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Star decompositions and independent sets in random regular graphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.PR"],"primary_cat":"math.CO","authors_text":"Viktor Harangi","submitted_at":"2025-03-12T15:03:41Z","abstract_excerpt":"A $k$-star decomposition of a graph is a partition of its edges into $k$-stars (i.e., $k$ edges with a common vertex). The paper studies the following problem: for what values of $k>d/2$ does the random $d$-regular graph have a $k$-star decomposition (asymptotically almost surely, provided that the number of edges is divisible by $k$)?\n  Delcourt, Greenhill, Isaev, Lidick\\'y, and Postle proposed the following conjecture. It is easy to see that a $k$-star decomposition necessitates the existence of an independent set of density $1-d/(2k)$. So let $k^{\\mathrm{ind}}_d$ be the largest $k$ for whic"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2503.09458","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2503.09458/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":"2503.09458","created_at":"2026-07-05T10:36:38.031559+00:00"},{"alias_kind":"arxiv_version","alias_value":"2503.09458v2","created_at":"2026-07-05T10:36:38.031559+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2503.09458","created_at":"2026-07-05T10:36:38.031559+00:00"},{"alias_kind":"pith_short_12","alias_value":"PBDHHCYAHLZM","created_at":"2026-07-05T10:36:38.031559+00:00"},{"alias_kind":"pith_short_16","alias_value":"PBDHHCYAHLZMRCLN","created_at":"2026-07-05T10:36:38.031559+00:00"},{"alias_kind":"pith_short_8","alias_value":"PBDHHCYA","created_at":"2026-07-05T10:36:38.031559+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2604.22219","citing_title":"Jaeger-type orientations of random regular graphs","ref_index":13,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/PBDHHCYAHLZMRCLNRU3RTE7IXI","json":"https://pith.science/pith/PBDHHCYAHLZMRCLNRU3RTE7IXI.json","graph_json":"https://pith.science/api/pith-number/PBDHHCYAHLZMRCLNRU3RTE7IXI/graph.json","events_json":"https://pith.science/api/pith-number/PBDHHCYAHLZMRCLNRU3RTE7IXI/events.json","paper":"https://pith.science/paper/PBDHHCYA"},"agent_actions":{"view_html":"https://pith.science/pith/PBDHHCYAHLZMRCLNRU3RTE7IXI","download_json":"https://pith.science/pith/PBDHHCYAHLZMRCLNRU3RTE7IXI.json","view_paper":"https://pith.science/paper/PBDHHCYA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2503.09458&json=true","fetch_graph":"https://pith.science/api/pith-number/PBDHHCYAHLZMRCLNRU3RTE7IXI/graph.json","fetch_events":"https://pith.science/api/pith-number/PBDHHCYAHLZMRCLNRU3RTE7IXI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PBDHHCYAHLZMRCLNRU3RTE7IXI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PBDHHCYAHLZMRCLNRU3RTE7IXI/action/storage_attestation","attest_author":"https://pith.science/pith/PBDHHCYAHLZMRCLNRU3RTE7IXI/action/author_attestation","sign_citation":"https://pith.science/pith/PBDHHCYAHLZMRCLNRU3RTE7IXI/action/citation_signature","submit_replication":"https://pith.science/pith/PBDHHCYAHLZMRCLNRU3RTE7IXI/action/replication_record"}},"created_at":"2026-07-05T10:36:38.031559+00:00","updated_at":"2026-07-05T10:36:38.031559+00:00"}