{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:BCYB4FSMU43EVY5G2BNQNQSSI4","short_pith_number":"pith:BCYB4FSM","schema_version":"1.0","canonical_sha256":"08b01e164ca7364ae3a6d05b06c252473ebeb7e00fd97db034565e04e3827d29","source":{"kind":"arxiv","id":"1505.05432","version":1},"attestation_state":"computed","paper":{"title":"Double-Star Decomposition of Regular Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Abbas Seify, Hamidreza Maimani, Saieed Akbari, Shahab Haghi","submitted_at":"2015-05-20T15:54:56Z","abstract_excerpt":"A tree containing exactly two non-pendant vertices is called a double-star. A double-star with degree sequence $(k_1+ 1, k_2+ 1, 1, \\ldots, 1)$ is denoted by $S_{k_1, k_2}$. We study the edge-decomposition of regular graphs into double-stars. It was proved that every double-star of size $k$ decomposes every $2k$-regular graph. In this paper, we extend this result to $(2k+ 1)$-regular graphs, by showing that every $(2k+ 1)$-regular graph containing two disjoint perfect matchings is decomposed into $S_{k_1, k_2}$ and $S_{k_{1}-1, k_2}$, for all positive integers $k_1$ and $k_2$ such that $k_1 + "},"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":"1505.05432","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-05-20T15:54:56Z","cross_cats_sorted":[],"title_canon_sha256":"1e15cc73ffc084fac64503f4ef7972011c793e8f2956c2ae9ad5e59c4712a9a0","abstract_canon_sha256":"b39b9fa88323b0d07cbe6633bf0377b6330c7d587a58320996e4dbc2e7799b94"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:03:56.389432Z","signature_b64":"jViH6Q9TSt/nRJva05AUlmviE1yHaM+q8hXSkGnU+COp3oLGjqEBW43pyML7M4hgWh0io5UjWJBs4Ex7DHT0Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"08b01e164ca7364ae3a6d05b06c252473ebeb7e00fd97db034565e04e3827d29","last_reissued_at":"2026-05-18T02:03:56.388655Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:03:56.388655Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Double-Star Decomposition of Regular Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Abbas Seify, Hamidreza Maimani, Saieed Akbari, Shahab Haghi","submitted_at":"2015-05-20T15:54:56Z","abstract_excerpt":"A tree containing exactly two non-pendant vertices is called a double-star. A double-star with degree sequence $(k_1+ 1, k_2+ 1, 1, \\ldots, 1)$ is denoted by $S_{k_1, k_2}$. We study the edge-decomposition of regular graphs into double-stars. It was proved that every double-star of size $k$ decomposes every $2k$-regular graph. In this paper, we extend this result to $(2k+ 1)$-regular graphs, by showing that every $(2k+ 1)$-regular graph containing two disjoint perfect matchings is decomposed into $S_{k_1, k_2}$ and $S_{k_{1}-1, k_2}$, for all positive integers $k_1$ and $k_2$ such that $k_1 + "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.05432","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":"1505.05432","created_at":"2026-05-18T02:03:56.388777+00:00"},{"alias_kind":"arxiv_version","alias_value":"1505.05432v1","created_at":"2026-05-18T02:03:56.388777+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.05432","created_at":"2026-05-18T02:03:56.388777+00:00"},{"alias_kind":"pith_short_12","alias_value":"BCYB4FSMU43E","created_at":"2026-05-18T12:29:14.074870+00:00"},{"alias_kind":"pith_short_16","alias_value":"BCYB4FSMU43EVY5G","created_at":"2026-05-18T12:29:14.074870+00:00"},{"alias_kind":"pith_short_8","alias_value":"BCYB4FSM","created_at":"2026-05-18T12:29:14.074870+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/BCYB4FSMU43EVY5G2BNQNQSSI4","json":"https://pith.science/pith/BCYB4FSMU43EVY5G2BNQNQSSI4.json","graph_json":"https://pith.science/api/pith-number/BCYB4FSMU43EVY5G2BNQNQSSI4/graph.json","events_json":"https://pith.science/api/pith-number/BCYB4FSMU43EVY5G2BNQNQSSI4/events.json","paper":"https://pith.science/paper/BCYB4FSM"},"agent_actions":{"view_html":"https://pith.science/pith/BCYB4FSMU43EVY5G2BNQNQSSI4","download_json":"https://pith.science/pith/BCYB4FSMU43EVY5G2BNQNQSSI4.json","view_paper":"https://pith.science/paper/BCYB4FSM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1505.05432&json=true","fetch_graph":"https://pith.science/api/pith-number/BCYB4FSMU43EVY5G2BNQNQSSI4/graph.json","fetch_events":"https://pith.science/api/pith-number/BCYB4FSMU43EVY5G2BNQNQSSI4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BCYB4FSMU43EVY5G2BNQNQSSI4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BCYB4FSMU43EVY5G2BNQNQSSI4/action/storage_attestation","attest_author":"https://pith.science/pith/BCYB4FSMU43EVY5G2BNQNQSSI4/action/author_attestation","sign_citation":"https://pith.science/pith/BCYB4FSMU43EVY5G2BNQNQSSI4/action/citation_signature","submit_replication":"https://pith.science/pith/BCYB4FSMU43EVY5G2BNQNQSSI4/action/replication_record"}},"created_at":"2026-05-18T02:03:56.388777+00:00","updated_at":"2026-05-18T02:03:56.388777+00:00"}