{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:BCYB4FSMU43EVY5G2BNQNQSSI4","short_pith_number":"pith:BCYB4FSM","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"},"canonical_sha256":"08b01e164ca7364ae3a6d05b06c252473ebeb7e00fd97db034565e04e3827d29","source":{"kind":"arxiv","id":"1505.05432","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1505.05432","created_at":"2026-05-18T02:03:56Z"},{"alias_kind":"arxiv_version","alias_value":"1505.05432v1","created_at":"2026-05-18T02:03:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.05432","created_at":"2026-05-18T02:03:56Z"},{"alias_kind":"pith_short_12","alias_value":"BCYB4FSMU43E","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_16","alias_value":"BCYB4FSMU43EVY5G","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_8","alias_value":"BCYB4FSM","created_at":"2026-05-18T12:29:14Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:BCYB4FSMU43EVY5G2BNQNQSSI4","target":"record","payload":{"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"},"canonical_sha256":"08b01e164ca7364ae3a6d05b06c252473ebeb7e00fd97db034565e04e3827d29","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"},"source_kind":"arxiv","source_id":"1505.05432","source_version":1,"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-05-18T02:03:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uIzWa8HlKggF2akXxFUlHNzmOIRvpwPCOONZJwNETIv3YLsAw54oibHCdo3Pm2ROGchpsG09FssbaCfOBB/bBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T07:27:06.371585Z"},"content_sha256":"e11245f301338da653600c031cea0a391ae9f79b6858667cdea0e83b02ee4af8","schema_version":"1.0","event_id":"sha256:e11245f301338da653600c031cea0a391ae9f79b6858667cdea0e83b02ee4af8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:BCYB4FSMU43EVY5G2BNQNQSSI4","target":"graph","payload":{"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"},"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-05-18T02:03:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0KeswL9fwfUnZCAL20VIDTY7v1v7UA6GC179o2XjPIh8nM92aFCOdMzyXp87KWFdJxZMF408VkHXGo8ZrAxWBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T07:27:06.372309Z"},"content_sha256":"5f1458e00fe915a3dfb66840e5be773e75df1d52b5a5e818b5a2044630c5ef69","schema_version":"1.0","event_id":"sha256:5f1458e00fe915a3dfb66840e5be773e75df1d52b5a5e818b5a2044630c5ef69"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BCYB4FSMU43EVY5G2BNQNQSSI4/bundle.json","state_url":"https://pith.science/pith/BCYB4FSMU43EVY5G2BNQNQSSI4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BCYB4FSMU43EVY5G2BNQNQSSI4/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-06-05T07:27:06Z","links":{"resolver":"https://pith.science/pith/BCYB4FSMU43EVY5G2BNQNQSSI4","bundle":"https://pith.science/pith/BCYB4FSMU43EVY5G2BNQNQSSI4/bundle.json","state":"https://pith.science/pith/BCYB4FSMU43EVY5G2BNQNQSSI4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BCYB4FSMU43EVY5G2BNQNQSSI4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:BCYB4FSMU43EVY5G2BNQNQSSI4","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":"b39b9fa88323b0d07cbe6633bf0377b6330c7d587a58320996e4dbc2e7799b94","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-05-20T15:54:56Z","title_canon_sha256":"1e15cc73ffc084fac64503f4ef7972011c793e8f2956c2ae9ad5e59c4712a9a0"},"schema_version":"1.0","source":{"id":"1505.05432","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1505.05432","created_at":"2026-05-18T02:03:56Z"},{"alias_kind":"arxiv_version","alias_value":"1505.05432v1","created_at":"2026-05-18T02:03:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.05432","created_at":"2026-05-18T02:03:56Z"},{"alias_kind":"pith_short_12","alias_value":"BCYB4FSMU43E","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_16","alias_value":"BCYB4FSMU43EVY5G","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_8","alias_value":"BCYB4FSM","created_at":"2026-05-18T12:29:14Z"}],"graph_snapshots":[{"event_id":"sha256:5f1458e00fe915a3dfb66840e5be773e75df1d52b5a5e818b5a2044630c5ef69","target":"graph","created_at":"2026-05-18T02:03:56Z","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"},"paper":{"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 + ","authors_text":"Abbas Seify, Hamidreza Maimani, Saieed Akbari, Shahab Haghi","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-05-20T15:54:56Z","title":"Double-Star Decomposition of Regular Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.05432","kind":"arxiv","version":1},"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:e11245f301338da653600c031cea0a391ae9f79b6858667cdea0e83b02ee4af8","target":"record","created_at":"2026-05-18T02:03:56Z","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":"b39b9fa88323b0d07cbe6633bf0377b6330c7d587a58320996e4dbc2e7799b94","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-05-20T15:54:56Z","title_canon_sha256":"1e15cc73ffc084fac64503f4ef7972011c793e8f2956c2ae9ad5e59c4712a9a0"},"schema_version":"1.0","source":{"id":"1505.05432","kind":"arxiv","version":1}},"canonical_sha256":"08b01e164ca7364ae3a6d05b06c252473ebeb7e00fd97db034565e04e3827d29","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"08b01e164ca7364ae3a6d05b06c252473ebeb7e00fd97db034565e04e3827d29","first_computed_at":"2026-05-18T02:03:56.388655Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:03:56.388655Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"jViH6Q9TSt/nRJva05AUlmviE1yHaM+q8hXSkGnU+COp3oLGjqEBW43pyML7M4hgWh0io5UjWJBs4Ex7DHT0Ag==","signature_status":"signed_v1","signed_at":"2026-05-18T02:03:56.389432Z","signed_message":"canonical_sha256_bytes"},"source_id":"1505.05432","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e11245f301338da653600c031cea0a391ae9f79b6858667cdea0e83b02ee4af8","sha256:5f1458e00fe915a3dfb66840e5be773e75df1d52b5a5e818b5a2044630c5ef69"],"state_sha256":"65a6c71a681d676da8b687896a06aa91d0d50b53b01a012872474a2c6b628777"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wBIepG5C1xOU3HdgXzqcIjgaJ7MXP5+27Tw2O6kREjty50PgM0zmGJTfA2leF2tSihlTM2I+T1Y1R8eIDSVdAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T07:27:06.375595Z","bundle_sha256":"d9b7211aed1a7ea5ff119e0050f3d4e828c4158b16f76e4e03f64dac1370eada"}}