{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:PBDHHCYAHLZMRCLNRU3RTE7IXI","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"cc21c8395f7330b0b9c1bd2845a1041fccc29136bc78c6006922ce7b1d6d1370","cross_cats_sorted":["math.PR"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-03-12T15:03:41Z","title_canon_sha256":"4994231915373ed4299485378d836bdafc32c8d80ecf28a52f94386857b39ed0"},"schema_version":"1.0","source":{"id":"2503.09458","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2503.09458","created_at":"2026-07-05T10:36:38Z"},{"alias_kind":"arxiv_version","alias_value":"2503.09458v2","created_at":"2026-07-05T10:36:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2503.09458","created_at":"2026-07-05T10:36:38Z"},{"alias_kind":"pith_short_12","alias_value":"PBDHHCYAHLZM","created_at":"2026-07-05T10:36:38Z"},{"alias_kind":"pith_short_16","alias_value":"PBDHHCYAHLZMRCLN","created_at":"2026-07-05T10:36:38Z"},{"alias_kind":"pith_short_8","alias_value":"PBDHHCYA","created_at":"2026-07-05T10:36:38Z"}],"graph_snapshots":[{"event_id":"sha256:c0154fd404f0b8a18a6b84eea0236889c9be85c476cef146088016ba1bc9fd2e","target":"graph","created_at":"2026-07-05T10:36:38Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2503.09458/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Viktor Harangi","cross_cats":["math.PR"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-03-12T15:03:41Z","title":"Star decompositions and independent sets in random regular graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2503.09458","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:73ee274135d76133c0ff8323784848ca9ae7a01a497870919b8d9d2cf1310f32","target":"record","created_at":"2026-07-05T10:36:38Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"cc21c8395f7330b0b9c1bd2845a1041fccc29136bc78c6006922ce7b1d6d1370","cross_cats_sorted":["math.PR"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-03-12T15:03:41Z","title_canon_sha256":"4994231915373ed4299485378d836bdafc32c8d80ecf28a52f94386857b39ed0"},"schema_version":"1.0","source":{"id":"2503.09458","kind":"arxiv","version":2}},"canonical_sha256":"7846738b003af2c8896d8d371993e8ba3c76dcd8b83e7c0c05e67ac22a26bb57","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7846738b003af2c8896d8d371993e8ba3c76dcd8b83e7c0c05e67ac22a26bb57","first_computed_at":"2026-07-05T10:36:38.031478Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T10:36:38.031478Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"mqd7aeIFyn9BkOg5J4mKDtj0CGEbUV7qQ6MtccOjLbDFWmErKAe8MeJ4ykDBHkeDzO06CLj3zH/ULB77ZARiDw==","signature_status":"signed_v1","signed_at":"2026-07-05T10:36:38.032390Z","signed_message":"canonical_sha256_bytes"},"source_id":"2503.09458","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:73ee274135d76133c0ff8323784848ca9ae7a01a497870919b8d9d2cf1310f32","sha256:c0154fd404f0b8a18a6b84eea0236889c9be85c476cef146088016ba1bc9fd2e"],"state_sha256":"6ce53c3d2941a6d5269c6b2a3dd856177a3d10751f088f5b47454cf1c6d40a2d"}