{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:EQ4FCKGZ25XUSOFNVRE636232S","short_pith_number":"pith:EQ4FCKGZ","schema_version":"1.0","canonical_sha256":"24385128d9d76f4938adac49edfb5bd4a7b786c7b3ee4b0bc758be153e6de106","source":{"kind":"arxiv","id":"1509.03092","version":1},"attestation_state":"computed","paper":{"title":"On edge-decomposition of cubic graphs into copies of the double-star with four edges","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Abbas Seify, Hamidreza Maimani, Saieed Akbari","submitted_at":"2015-09-10T10:55:52Z","abstract_excerpt":"A tree containing exactly two non-pendant vertices is called a double-star. Let $k_1$ and $k_2$ be two positive integers. The double-star with degree sequence $(k_1+1, k_2+1, 1, \\ldots, 1)$ is denoted by $S_{k_1, k_2}$. If $G$ is a cubic graph and has an $S$-decomposition, for a double-star $S$, then $S$ is isomorphic to $S_{1,1}$, $S_{1,2}$ or $S_{2,2}$. It is known that a cubic graph has an $S_{1,1}$-decomposition if and only if it contains a perfect matching. In this paper we study the $S_{1,2}$-decomposition of cubic graphs. First, we present some necessary conditions for the existence of "},"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":"1509.03092","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-09-10T10:55:52Z","cross_cats_sorted":[],"title_canon_sha256":"d0400a9c42bfc79f7992f79f1d6d04e44ed0cdb60b05c0405f35738157fe4326","abstract_canon_sha256":"2c4b935ad166ab0e5972a0ad018615fd09448b97ee2d801021f62432b72ce409"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:33:25.466693Z","signature_b64":"2l9X7r44mV4+K9xrq4hug46Lwb2nMwYppb9aRnSYmLzevzcn5JSq2tWYFqm9PSLFjeU5JjZHi9YUnEsTMfM3AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"24385128d9d76f4938adac49edfb5bd4a7b786c7b3ee4b0bc758be153e6de106","last_reissued_at":"2026-05-18T01:33:25.466051Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:33:25.466051Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On edge-decomposition of cubic graphs into copies of the double-star with four edges","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Abbas Seify, Hamidreza Maimani, Saieed Akbari","submitted_at":"2015-09-10T10:55:52Z","abstract_excerpt":"A tree containing exactly two non-pendant vertices is called a double-star. Let $k_1$ and $k_2$ be two positive integers. The double-star with degree sequence $(k_1+1, k_2+1, 1, \\ldots, 1)$ is denoted by $S_{k_1, k_2}$. If $G$ is a cubic graph and has an $S$-decomposition, for a double-star $S$, then $S$ is isomorphic to $S_{1,1}$, $S_{1,2}$ or $S_{2,2}$. It is known that a cubic graph has an $S_{1,1}$-decomposition if and only if it contains a perfect matching. In this paper we study the $S_{1,2}$-decomposition of cubic graphs. First, we present some necessary conditions for the existence of "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.03092","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":"1509.03092","created_at":"2026-05-18T01:33:25.466168+00:00"},{"alias_kind":"arxiv_version","alias_value":"1509.03092v1","created_at":"2026-05-18T01:33:25.466168+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.03092","created_at":"2026-05-18T01:33:25.466168+00:00"},{"alias_kind":"pith_short_12","alias_value":"EQ4FCKGZ25XU","created_at":"2026-05-18T12:29:19.899920+00:00"},{"alias_kind":"pith_short_16","alias_value":"EQ4FCKGZ25XUSOFN","created_at":"2026-05-18T12:29:19.899920+00:00"},{"alias_kind":"pith_short_8","alias_value":"EQ4FCKGZ","created_at":"2026-05-18T12:29:19.899920+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/EQ4FCKGZ25XUSOFNVRE636232S","json":"https://pith.science/pith/EQ4FCKGZ25XUSOFNVRE636232S.json","graph_json":"https://pith.science/api/pith-number/EQ4FCKGZ25XUSOFNVRE636232S/graph.json","events_json":"https://pith.science/api/pith-number/EQ4FCKGZ25XUSOFNVRE636232S/events.json","paper":"https://pith.science/paper/EQ4FCKGZ"},"agent_actions":{"view_html":"https://pith.science/pith/EQ4FCKGZ25XUSOFNVRE636232S","download_json":"https://pith.science/pith/EQ4FCKGZ25XUSOFNVRE636232S.json","view_paper":"https://pith.science/paper/EQ4FCKGZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1509.03092&json=true","fetch_graph":"https://pith.science/api/pith-number/EQ4FCKGZ25XUSOFNVRE636232S/graph.json","fetch_events":"https://pith.science/api/pith-number/EQ4FCKGZ25XUSOFNVRE636232S/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EQ4FCKGZ25XUSOFNVRE636232S/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EQ4FCKGZ25XUSOFNVRE636232S/action/storage_attestation","attest_author":"https://pith.science/pith/EQ4FCKGZ25XUSOFNVRE636232S/action/author_attestation","sign_citation":"https://pith.science/pith/EQ4FCKGZ25XUSOFNVRE636232S/action/citation_signature","submit_replication":"https://pith.science/pith/EQ4FCKGZ25XUSOFNVRE636232S/action/replication_record"}},"created_at":"2026-05-18T01:33:25.466168+00:00","updated_at":"2026-05-18T01:33:25.466168+00:00"}