{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:4TCUG6ZRKSLKF5HA2XBZWGYKQM","short_pith_number":"pith:4TCUG6ZR","schema_version":"1.0","canonical_sha256":"e4c5437b315496a2f4e0d5c39b1b0a83099c139c649b34fd27f46a9262db9180","source":{"kind":"arxiv","id":"1301.6475","version":1},"attestation_state":"computed","paper":{"title":"Generalized Connectivity of Star Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jun-Ming Xu, Xiang-jun Li","submitted_at":"2013-01-28T08:36:36Z","abstract_excerpt":"This paper shows that, for any integers $n$ and $k$ with $0\\leqslant k \\leqslant n-2$, at least $(k+1)!(n-k-1)$ vertices or edges have to be removed from an $n$-dimensional star graph to make it disconnected and no vertices of degree less than $k$. The result gives an affirmative answer to the conjecture proposed by Wan and Zhang [Applied Mathematics Letters, 22 (2009), 264-267]."},"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":"1301.6475","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-01-28T08:36:36Z","cross_cats_sorted":[],"title_canon_sha256":"53ec581c0628b10198c38bb058d32c8ab341d2574e7f83648c7094391d94fc81","abstract_canon_sha256":"f272725e0ab956d35d442e249065f5a754d6d9a6a9d4dc42f78279879c7298bf"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:35:15.233759Z","signature_b64":"iTF349jGjBLFatoeMqy1ethPgr+n3F2VG16kAhkBZJyCUs6xahqjIhwsYnLUmOWj412eVsQnRIarhi+RGOOjDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e4c5437b315496a2f4e0d5c39b1b0a83099c139c649b34fd27f46a9262db9180","last_reissued_at":"2026-05-18T03:35:15.232946Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:35:15.232946Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Generalized Connectivity of Star Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jun-Ming Xu, Xiang-jun Li","submitted_at":"2013-01-28T08:36:36Z","abstract_excerpt":"This paper shows that, for any integers $n$ and $k$ with $0\\leqslant k \\leqslant n-2$, at least $(k+1)!(n-k-1)$ vertices or edges have to be removed from an $n$-dimensional star graph to make it disconnected and no vertices of degree less than $k$. The result gives an affirmative answer to the conjecture proposed by Wan and Zhang [Applied Mathematics Letters, 22 (2009), 264-267]."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.6475","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":"1301.6475","created_at":"2026-05-18T03:35:15.233080+00:00"},{"alias_kind":"arxiv_version","alias_value":"1301.6475v1","created_at":"2026-05-18T03:35:15.233080+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.6475","created_at":"2026-05-18T03:35:15.233080+00:00"},{"alias_kind":"pith_short_12","alias_value":"4TCUG6ZRKSLK","created_at":"2026-05-18T12:27:34.582898+00:00"},{"alias_kind":"pith_short_16","alias_value":"4TCUG6ZRKSLKF5HA","created_at":"2026-05-18T12:27:34.582898+00:00"},{"alias_kind":"pith_short_8","alias_value":"4TCUG6ZR","created_at":"2026-05-18T12:27:34.582898+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/4TCUG6ZRKSLKF5HA2XBZWGYKQM","json":"https://pith.science/pith/4TCUG6ZRKSLKF5HA2XBZWGYKQM.json","graph_json":"https://pith.science/api/pith-number/4TCUG6ZRKSLKF5HA2XBZWGYKQM/graph.json","events_json":"https://pith.science/api/pith-number/4TCUG6ZRKSLKF5HA2XBZWGYKQM/events.json","paper":"https://pith.science/paper/4TCUG6ZR"},"agent_actions":{"view_html":"https://pith.science/pith/4TCUG6ZRKSLKF5HA2XBZWGYKQM","download_json":"https://pith.science/pith/4TCUG6ZRKSLKF5HA2XBZWGYKQM.json","view_paper":"https://pith.science/paper/4TCUG6ZR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1301.6475&json=true","fetch_graph":"https://pith.science/api/pith-number/4TCUG6ZRKSLKF5HA2XBZWGYKQM/graph.json","fetch_events":"https://pith.science/api/pith-number/4TCUG6ZRKSLKF5HA2XBZWGYKQM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4TCUG6ZRKSLKF5HA2XBZWGYKQM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4TCUG6ZRKSLKF5HA2XBZWGYKQM/action/storage_attestation","attest_author":"https://pith.science/pith/4TCUG6ZRKSLKF5HA2XBZWGYKQM/action/author_attestation","sign_citation":"https://pith.science/pith/4TCUG6ZRKSLKF5HA2XBZWGYKQM/action/citation_signature","submit_replication":"https://pith.science/pith/4TCUG6ZRKSLKF5HA2XBZWGYKQM/action/replication_record"}},"created_at":"2026-05-18T03:35:15.233080+00:00","updated_at":"2026-05-18T03:35:15.233080+00:00"}