{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:Y2HSIRA7BIT65QKG5JAW47JIEZ","short_pith_number":"pith:Y2HSIRA7","schema_version":"1.0","canonical_sha256":"c68f24441f0a27eec146ea416e7d28264537090d8d26850db2fb02ab1263c974","source":{"kind":"arxiv","id":"2506.05194","version":2},"attestation_state":"computed","paper":{"title":"Star decompositions via orientations","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.PR"],"primary_cat":"math.CO","authors_text":"Viktor Harangi","submitted_at":"2025-06-05T16:07:20Z","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: given $k \\leq 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$)? Delcourt, Greenhill, Isaev, Lidick\\'y, and Postle proved the a.a.s. existence for every odd $k$ using earlier results regarding orientations satisfying certain degree conditions modulo $k$.\n  In this paper we give a direct, self-contained proof that works for every $d$"},"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":"2506.05194","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-06-05T16:07:20Z","cross_cats_sorted":["math.PR"],"title_canon_sha256":"0a3f2fa26eca83e117e24185b289a82b7c21e5ae617f5ddf278079a7598fc637","abstract_canon_sha256":"9243ca29b5ee3ba880666718cf52c0f12d4dbb977cffdd02a2f076a469bd546a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:20:13.077078Z","signature_b64":"fhMbfvdOSW7MOMr/W7FmKpNQudNJDmNaFNn6j3XTsdpnsUz1AuFVN/quEsYuXUaWwba+PqKE+b2+30DF4d4JDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c68f24441f0a27eec146ea416e7d28264537090d8d26850db2fb02ab1263c974","last_reissued_at":"2026-07-05T11:20:13.076671Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:20:13.076671Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Star decompositions via orientations","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.PR"],"primary_cat":"math.CO","authors_text":"Viktor Harangi","submitted_at":"2025-06-05T16:07:20Z","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: given $k \\leq 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$)? Delcourt, Greenhill, Isaev, Lidick\\'y, and Postle proved the a.a.s. existence for every odd $k$ using earlier results regarding orientations satisfying certain degree conditions modulo $k$.\n  In this paper we give a direct, self-contained proof that works for every $d$"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.05194","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/2506.05194/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":"2506.05194","created_at":"2026-07-05T11:20:13.076726+00:00"},{"alias_kind":"arxiv_version","alias_value":"2506.05194v2","created_at":"2026-07-05T11:20:13.076726+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.05194","created_at":"2026-07-05T11:20:13.076726+00:00"},{"alias_kind":"pith_short_12","alias_value":"Y2HSIRA7BIT6","created_at":"2026-07-05T11:20:13.076726+00:00"},{"alias_kind":"pith_short_16","alias_value":"Y2HSIRA7BIT65QKG","created_at":"2026-07-05T11:20:13.076726+00:00"},{"alias_kind":"pith_short_8","alias_value":"Y2HSIRA7","created_at":"2026-07-05T11:20:13.076726+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":14,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/Y2HSIRA7BIT65QKG5JAW47JIEZ","json":"https://pith.science/pith/Y2HSIRA7BIT65QKG5JAW47JIEZ.json","graph_json":"https://pith.science/api/pith-number/Y2HSIRA7BIT65QKG5JAW47JIEZ/graph.json","events_json":"https://pith.science/api/pith-number/Y2HSIRA7BIT65QKG5JAW47JIEZ/events.json","paper":"https://pith.science/paper/Y2HSIRA7"},"agent_actions":{"view_html":"https://pith.science/pith/Y2HSIRA7BIT65QKG5JAW47JIEZ","download_json":"https://pith.science/pith/Y2HSIRA7BIT65QKG5JAW47JIEZ.json","view_paper":"https://pith.science/paper/Y2HSIRA7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2506.05194&json=true","fetch_graph":"https://pith.science/api/pith-number/Y2HSIRA7BIT65QKG5JAW47JIEZ/graph.json","fetch_events":"https://pith.science/api/pith-number/Y2HSIRA7BIT65QKG5JAW47JIEZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Y2HSIRA7BIT65QKG5JAW47JIEZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Y2HSIRA7BIT65QKG5JAW47JIEZ/action/storage_attestation","attest_author":"https://pith.science/pith/Y2HSIRA7BIT65QKG5JAW47JIEZ/action/author_attestation","sign_citation":"https://pith.science/pith/Y2HSIRA7BIT65QKG5JAW47JIEZ/action/citation_signature","submit_replication":"https://pith.science/pith/Y2HSIRA7BIT65QKG5JAW47JIEZ/action/replication_record"}},"created_at":"2026-07-05T11:20:13.076726+00:00","updated_at":"2026-07-05T11:20:13.076726+00:00"}