{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:Y2HSIRA7BIT65QKG5JAW47JIEZ","short_pith_number":"pith:Y2HSIRA7","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"},"canonical_sha256":"c68f24441f0a27eec146ea416e7d28264537090d8d26850db2fb02ab1263c974","source":{"kind":"arxiv","id":"2506.05194","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2506.05194","created_at":"2026-07-05T11:20:13Z"},{"alias_kind":"arxiv_version","alias_value":"2506.05194v2","created_at":"2026-07-05T11:20:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.05194","created_at":"2026-07-05T11:20:13Z"},{"alias_kind":"pith_short_12","alias_value":"Y2HSIRA7BIT6","created_at":"2026-07-05T11:20:13Z"},{"alias_kind":"pith_short_16","alias_value":"Y2HSIRA7BIT65QKG","created_at":"2026-07-05T11:20:13Z"},{"alias_kind":"pith_short_8","alias_value":"Y2HSIRA7","created_at":"2026-07-05T11:20:13Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:Y2HSIRA7BIT65QKG5JAW47JIEZ","target":"record","payload":{"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"},"canonical_sha256":"c68f24441f0a27eec146ea416e7d28264537090d8d26850db2fb02ab1263c974","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"},"source_kind":"arxiv","source_id":"2506.05194","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T11:20:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RY8wjJZh6MOrWMUDQ/FIJpP1gF9nSPgtMYls9X3GjeNjhOFhXYUPZDWPUIA7tHxrOZsNQ0OAF7wnw6kUfi1FAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T14:39:25.259786Z"},"content_sha256":"a154a14f60e9d0850b9541de47f6186ad734a958661995e0c324e9b0da289fd1","schema_version":"1.0","event_id":"sha256:a154a14f60e9d0850b9541de47f6186ad734a958661995e0c324e9b0da289fd1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:Y2HSIRA7BIT65QKG5JAW47JIEZ","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T11:20:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"655SXNWzkhZcoEFpF0qqAptTkuCxGkoQ4gV/T8yZBfMrX4iJV0LbJbGTjG6fuMRLnvGCAbAdhQqENvCLiSSMBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T14:39:25.260345Z"},"content_sha256":"838f1f8403b4de36888bc18000799dd1f17ee793caf9081af2f17b353b3dccb5","schema_version":"1.0","event_id":"sha256:838f1f8403b4de36888bc18000799dd1f17ee793caf9081af2f17b353b3dccb5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/Y2HSIRA7BIT65QKG5JAW47JIEZ/bundle.json","state_url":"https://pith.science/pith/Y2HSIRA7BIT65QKG5JAW47JIEZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/Y2HSIRA7BIT65QKG5JAW47JIEZ/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-08T14:39:25Z","links":{"resolver":"https://pith.science/pith/Y2HSIRA7BIT65QKG5JAW47JIEZ","bundle":"https://pith.science/pith/Y2HSIRA7BIT65QKG5JAW47JIEZ/bundle.json","state":"https://pith.science/pith/Y2HSIRA7BIT65QKG5JAW47JIEZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/Y2HSIRA7BIT65QKG5JAW47JIEZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:Y2HSIRA7BIT65QKG5JAW47JIEZ","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":"9243ca29b5ee3ba880666718cf52c0f12d4dbb977cffdd02a2f076a469bd546a","cross_cats_sorted":["math.PR"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-06-05T16:07:20Z","title_canon_sha256":"0a3f2fa26eca83e117e24185b289a82b7c21e5ae617f5ddf278079a7598fc637"},"schema_version":"1.0","source":{"id":"2506.05194","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2506.05194","created_at":"2026-07-05T11:20:13Z"},{"alias_kind":"arxiv_version","alias_value":"2506.05194v2","created_at":"2026-07-05T11:20:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.05194","created_at":"2026-07-05T11:20:13Z"},{"alias_kind":"pith_short_12","alias_value":"Y2HSIRA7BIT6","created_at":"2026-07-05T11:20:13Z"},{"alias_kind":"pith_short_16","alias_value":"Y2HSIRA7BIT65QKG","created_at":"2026-07-05T11:20:13Z"},{"alias_kind":"pith_short_8","alias_value":"Y2HSIRA7","created_at":"2026-07-05T11:20:13Z"}],"graph_snapshots":[{"event_id":"sha256:838f1f8403b4de36888bc18000799dd1f17ee793caf9081af2f17b353b3dccb5","target":"graph","created_at":"2026-07-05T11:20:13Z","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/2506.05194/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: 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$","authors_text":"Viktor Harangi","cross_cats":["math.PR"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-06-05T16:07:20Z","title":"Star decompositions via orientations"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.05194","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:a154a14f60e9d0850b9541de47f6186ad734a958661995e0c324e9b0da289fd1","target":"record","created_at":"2026-07-05T11:20:13Z","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":"9243ca29b5ee3ba880666718cf52c0f12d4dbb977cffdd02a2f076a469bd546a","cross_cats_sorted":["math.PR"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-06-05T16:07:20Z","title_canon_sha256":"0a3f2fa26eca83e117e24185b289a82b7c21e5ae617f5ddf278079a7598fc637"},"schema_version":"1.0","source":{"id":"2506.05194","kind":"arxiv","version":2}},"canonical_sha256":"c68f24441f0a27eec146ea416e7d28264537090d8d26850db2fb02ab1263c974","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c68f24441f0a27eec146ea416e7d28264537090d8d26850db2fb02ab1263c974","first_computed_at":"2026-07-05T11:20:13.076671Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:20:13.076671Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"fhMbfvdOSW7MOMr/W7FmKpNQudNJDmNaFNn6j3XTsdpnsUz1AuFVN/quEsYuXUaWwba+PqKE+b2+30DF4d4JDg==","signature_status":"signed_v1","signed_at":"2026-07-05T11:20:13.077078Z","signed_message":"canonical_sha256_bytes"},"source_id":"2506.05194","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a154a14f60e9d0850b9541de47f6186ad734a958661995e0c324e9b0da289fd1","sha256:838f1f8403b4de36888bc18000799dd1f17ee793caf9081af2f17b353b3dccb5"],"state_sha256":"2b65fae3cd4822462c72ab694e84aa6d0c2aa2f7d5d1a16dd893df37d852feba"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/FrwhOM+mLHZVHMGVtqAx5rV7xwsqTi4X83qLV7+I5brN1fTOoCv/ZuSdAyIn5tj9JJervIYQyqwV7Ti6cFWDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-08T14:39:25.264406Z","bundle_sha256":"d957cee7cb52416c32e2abfa25c05b679a7c580d8f21c50509ae9c09496b456b"}}