{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:5LXW3T4YLGWCBAYVRL6562MEM2","short_pith_number":"pith:5LXW3T4Y","schema_version":"1.0","canonical_sha256":"eaef6dcf9859ac2083158afddf698466a3948acc3ea97b2ee456263bee17f10e","source":{"kind":"arxiv","id":"2411.13348","version":2},"attestation_state":"computed","paper":{"title":"Parameterized Complexity of the Star Decomposition Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Ramin Javadi, Sahab Hajebi","submitted_at":"2024-11-20T14:19:30Z","abstract_excerpt":"A star of length $ \\ell $ is defined as the complete bipartite graph $ K_{1,\\ell } $. In this paper we deal with the problem of edge decomposition of graphs into stars of varying lengths.\n  Given a graph $ G $ and a list of integers $S=(s_1,\\ldots, s_t) $, an $S$-star decomposition of $ G $ is an edge decomposition of $ G $ into graphs $G_1 ,G_2 ,\\ldots,G_t $ such that $G_i$ is isomorphic to an star of length $s_i$, for each $i \\in\\{1,2,\\ldots,t\\}$. Given a graph $G$ and a list of integers $S$, the \\sdp problem asks if $G$ admits an $ S $-star decomposition. The problem is known to be NP-compl"},"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":"2411.13348","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2024-11-20T14:19:30Z","cross_cats_sorted":[],"title_canon_sha256":"1290d7de5cffbc3c50d1ae08555555fd22859770ade44d2f8dea5d10d59522a4","abstract_canon_sha256":"0315a8ca3dc506aeb5c1edd75f83f5341634a316e28c7468a2a50617dcd78445"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:17:37.737947Z","signature_b64":"yTkBnafZ+IsJTeEVC0BH5TwcFbr5+aJ/0f6ySmacl5Q5YLMPS1em07CqD/xb2PVth/pleYdc1xQRD4UV806LCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"eaef6dcf9859ac2083158afddf698466a3948acc3ea97b2ee456263bee17f10e","last_reissued_at":"2026-07-05T11:17:37.737449Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:17:37.737449Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Parameterized Complexity of the Star Decomposition Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Ramin Javadi, Sahab Hajebi","submitted_at":"2024-11-20T14:19:30Z","abstract_excerpt":"A star of length $ \\ell $ is defined as the complete bipartite graph $ K_{1,\\ell } $. In this paper we deal with the problem of edge decomposition of graphs into stars of varying lengths.\n  Given a graph $ G $ and a list of integers $S=(s_1,\\ldots, s_t) $, an $S$-star decomposition of $ G $ is an edge decomposition of $ G $ into graphs $G_1 ,G_2 ,\\ldots,G_t $ such that $G_i$ is isomorphic to an star of length $s_i$, for each $i \\in\\{1,2,\\ldots,t\\}$. Given a graph $G$ and a list of integers $S$, the \\sdp problem asks if $G$ admits an $ S $-star decomposition. The problem is known to be NP-compl"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2411.13348","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/2411.13348/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2411.13348","created_at":"2026-07-05T11:17:37.737509+00:00"},{"alias_kind":"arxiv_version","alias_value":"2411.13348v2","created_at":"2026-07-05T11:17:37.737509+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.13348","created_at":"2026-07-05T11:17:37.737509+00:00"},{"alias_kind":"pith_short_12","alias_value":"5LXW3T4YLGWC","created_at":"2026-07-05T11:17:37.737509+00:00"},{"alias_kind":"pith_short_16","alias_value":"5LXW3T4YLGWCBAYV","created_at":"2026-07-05T11:17:37.737509+00:00"},{"alias_kind":"pith_short_8","alias_value":"5LXW3T4Y","created_at":"2026-07-05T11:17:37.737509+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/5LXW3T4YLGWCBAYVRL6562MEM2","json":"https://pith.science/pith/5LXW3T4YLGWCBAYVRL6562MEM2.json","graph_json":"https://pith.science/api/pith-number/5LXW3T4YLGWCBAYVRL6562MEM2/graph.json","events_json":"https://pith.science/api/pith-number/5LXW3T4YLGWCBAYVRL6562MEM2/events.json","paper":"https://pith.science/paper/5LXW3T4Y"},"agent_actions":{"view_html":"https://pith.science/pith/5LXW3T4YLGWCBAYVRL6562MEM2","download_json":"https://pith.science/pith/5LXW3T4YLGWCBAYVRL6562MEM2.json","view_paper":"https://pith.science/paper/5LXW3T4Y","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2411.13348&json=true","fetch_graph":"https://pith.science/api/pith-number/5LXW3T4YLGWCBAYVRL6562MEM2/graph.json","fetch_events":"https://pith.science/api/pith-number/5LXW3T4YLGWCBAYVRL6562MEM2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5LXW3T4YLGWCBAYVRL6562MEM2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5LXW3T4YLGWCBAYVRL6562MEM2/action/storage_attestation","attest_author":"https://pith.science/pith/5LXW3T4YLGWCBAYVRL6562MEM2/action/author_attestation","sign_citation":"https://pith.science/pith/5LXW3T4YLGWCBAYVRL6562MEM2/action/citation_signature","submit_replication":"https://pith.science/pith/5LXW3T4YLGWCBAYVRL6562MEM2/action/replication_record"}},"created_at":"2026-07-05T11:17:37.737509+00:00","updated_at":"2026-07-05T11:17:37.737509+00:00"}