{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:VXT7EFA42VPVZIQQQZB6SQSSSP","short_pith_number":"pith:VXT7EFA4","schema_version":"1.0","canonical_sha256":"ade7f2141cd55f5ca2108643e9425293c815919da6c3cd2209469f847225bf4a","source":{"kind":"arxiv","id":"1702.04060","version":1},"attestation_state":"computed","paper":{"title":"Maximum Independent Sets Partition of (n,k)-Star Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Fu-Tao Hu","submitted_at":"2017-02-14T03:29:05Z","abstract_excerpt":"The (n,k)-star graph is a very important computer modelling. The independent number and chromatic number of a graph are two important parameters in graph theory. However, we did not know the values of this two parameters of the (n,k)-star graph since it was proposed. In [18], Wei et. al. declared that they determined the independent number of the (n,k)-star graph, unfortunately their proof is wrong. This paper generalize their result and present a maximum independent sets partition of (n,k)-star graph. From that we can immediately deduce the exact value of the independent number and chromatic "},"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":"1702.04060","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-02-14T03:29:05Z","cross_cats_sorted":[],"title_canon_sha256":"59db5dfd67fe52745eff9de3bb8712427d8ace9d98cbaad64ab3801f98361688","abstract_canon_sha256":"5d90f0de77a23284be906e0d48a76babfb85c8842e13776f76e82666c213bd13"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:50:49.107639Z","signature_b64":"k+rO6CDBNPHxivlpuc02RM+zd9twuiUvurIKM2Zrb42HmApjklnR1cPR+JLNvfu1lKi1RYTw34W7BOSioYoSBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ade7f2141cd55f5ca2108643e9425293c815919da6c3cd2209469f847225bf4a","last_reissued_at":"2026-05-18T00:50:49.107075Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:50:49.107075Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Maximum Independent Sets Partition of (n,k)-Star Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Fu-Tao Hu","submitted_at":"2017-02-14T03:29:05Z","abstract_excerpt":"The (n,k)-star graph is a very important computer modelling. The independent number and chromatic number of a graph are two important parameters in graph theory. However, we did not know the values of this two parameters of the (n,k)-star graph since it was proposed. In [18], Wei et. al. declared that they determined the independent number of the (n,k)-star graph, unfortunately their proof is wrong. This paper generalize their result and present a maximum independent sets partition of (n,k)-star graph. From that we can immediately deduce the exact value of the independent number and chromatic "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.04060","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":"1702.04060","created_at":"2026-05-18T00:50:49.107162+00:00"},{"alias_kind":"arxiv_version","alias_value":"1702.04060v1","created_at":"2026-05-18T00:50:49.107162+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.04060","created_at":"2026-05-18T00:50:49.107162+00:00"},{"alias_kind":"pith_short_12","alias_value":"VXT7EFA42VPV","created_at":"2026-05-18T12:31:49.984773+00:00"},{"alias_kind":"pith_short_16","alias_value":"VXT7EFA42VPVZIQQ","created_at":"2026-05-18T12:31:49.984773+00:00"},{"alias_kind":"pith_short_8","alias_value":"VXT7EFA4","created_at":"2026-05-18T12:31:49.984773+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/VXT7EFA42VPVZIQQQZB6SQSSSP","json":"https://pith.science/pith/VXT7EFA42VPVZIQQQZB6SQSSSP.json","graph_json":"https://pith.science/api/pith-number/VXT7EFA42VPVZIQQQZB6SQSSSP/graph.json","events_json":"https://pith.science/api/pith-number/VXT7EFA42VPVZIQQQZB6SQSSSP/events.json","paper":"https://pith.science/paper/VXT7EFA4"},"agent_actions":{"view_html":"https://pith.science/pith/VXT7EFA42VPVZIQQQZB6SQSSSP","download_json":"https://pith.science/pith/VXT7EFA42VPVZIQQQZB6SQSSSP.json","view_paper":"https://pith.science/paper/VXT7EFA4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1702.04060&json=true","fetch_graph":"https://pith.science/api/pith-number/VXT7EFA42VPVZIQQQZB6SQSSSP/graph.json","fetch_events":"https://pith.science/api/pith-number/VXT7EFA42VPVZIQQQZB6SQSSSP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VXT7EFA42VPVZIQQQZB6SQSSSP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VXT7EFA42VPVZIQQQZB6SQSSSP/action/storage_attestation","attest_author":"https://pith.science/pith/VXT7EFA42VPVZIQQQZB6SQSSSP/action/author_attestation","sign_citation":"https://pith.science/pith/VXT7EFA42VPVZIQQQZB6SQSSSP/action/citation_signature","submit_replication":"https://pith.science/pith/VXT7EFA42VPVZIQQQZB6SQSSSP/action/replication_record"}},"created_at":"2026-05-18T00:50:49.107162+00:00","updated_at":"2026-05-18T00:50:49.107162+00:00"}