{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:AEJYTJ5JMIKSFXBZB3JQ5GGTQ6","short_pith_number":"pith:AEJYTJ5J","schema_version":"1.0","canonical_sha256":"011389a7a9621522dc390ed30e98d387a9d966b2f43f2e38f228ee72f98fb10f","source":{"kind":"arxiv","id":"2411.17127","version":1},"attestation_state":"computed","paper":{"title":"C sequential optimization numbers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Zile Hui","submitted_at":"2024-11-26T05:46:11Z","abstract_excerpt":"This work establishes a definition that is more basic than the previous ones, for the Stirling numbers of first kind, which is a sufficient but not necessary condition for the previous definition. Based on this definition and a combinatorial problem, we discover C sequential optimization numbers, where C is a k+1-tuple vector. For C= (0,1), we prove that C sequential optimization numbers are the unsigned Stirling numbers of first kind. We can deduce the properties of C sequential optimization numbers by following the properties of the Stirling numbers of first kind and we give specific example"},"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.17127","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2024-11-26T05:46:11Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"f8ff69d1599394ebf538549fb472daaf2063bf83fbf5047abf8e98e9929ddfc3","abstract_canon_sha256":"911be10a275ab73dc87fb547c75b339aa39d602663c2903e29a60ad30e63e8a8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:40:27.875635Z","signature_b64":"D4egxIT8fbWzExfTA3cnl0k2vo3qasfZAbP4Lf0f3b1Qjf0E3RwImP44Y0+pVSAL/fnQ8VsmxZqFy80708DlDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"011389a7a9621522dc390ed30e98d387a9d966b2f43f2e38f228ee72f98fb10f","last_reissued_at":"2026-07-05T09:40:27.875108Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:40:27.875108Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"C sequential optimization numbers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Zile Hui","submitted_at":"2024-11-26T05:46:11Z","abstract_excerpt":"This work establishes a definition that is more basic than the previous ones, for the Stirling numbers of first kind, which is a sufficient but not necessary condition for the previous definition. Based on this definition and a combinatorial problem, we discover C sequential optimization numbers, where C is a k+1-tuple vector. For C= (0,1), we prove that C sequential optimization numbers are the unsigned Stirling numbers of first kind. We can deduce the properties of C sequential optimization numbers by following the properties of the Stirling numbers of first kind and we give specific example"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2411.17127","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2411.17127/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.17127","created_at":"2026-07-05T09:40:27.875165+00:00"},{"alias_kind":"arxiv_version","alias_value":"2411.17127v1","created_at":"2026-07-05T09:40:27.875165+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.17127","created_at":"2026-07-05T09:40:27.875165+00:00"},{"alias_kind":"pith_short_12","alias_value":"AEJYTJ5JMIKS","created_at":"2026-07-05T09:40:27.875165+00:00"},{"alias_kind":"pith_short_16","alias_value":"AEJYTJ5JMIKSFXBZ","created_at":"2026-07-05T09:40:27.875165+00:00"},{"alias_kind":"pith_short_8","alias_value":"AEJYTJ5J","created_at":"2026-07-05T09:40:27.875165+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/AEJYTJ5JMIKSFXBZB3JQ5GGTQ6","json":"https://pith.science/pith/AEJYTJ5JMIKSFXBZB3JQ5GGTQ6.json","graph_json":"https://pith.science/api/pith-number/AEJYTJ5JMIKSFXBZB3JQ5GGTQ6/graph.json","events_json":"https://pith.science/api/pith-number/AEJYTJ5JMIKSFXBZB3JQ5GGTQ6/events.json","paper":"https://pith.science/paper/AEJYTJ5J"},"agent_actions":{"view_html":"https://pith.science/pith/AEJYTJ5JMIKSFXBZB3JQ5GGTQ6","download_json":"https://pith.science/pith/AEJYTJ5JMIKSFXBZB3JQ5GGTQ6.json","view_paper":"https://pith.science/paper/AEJYTJ5J","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2411.17127&json=true","fetch_graph":"https://pith.science/api/pith-number/AEJYTJ5JMIKSFXBZB3JQ5GGTQ6/graph.json","fetch_events":"https://pith.science/api/pith-number/AEJYTJ5JMIKSFXBZB3JQ5GGTQ6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AEJYTJ5JMIKSFXBZB3JQ5GGTQ6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AEJYTJ5JMIKSFXBZB3JQ5GGTQ6/action/storage_attestation","attest_author":"https://pith.science/pith/AEJYTJ5JMIKSFXBZB3JQ5GGTQ6/action/author_attestation","sign_citation":"https://pith.science/pith/AEJYTJ5JMIKSFXBZB3JQ5GGTQ6/action/citation_signature","submit_replication":"https://pith.science/pith/AEJYTJ5JMIKSFXBZB3JQ5GGTQ6/action/replication_record"}},"created_at":"2026-07-05T09:40:27.875165+00:00","updated_at":"2026-07-05T09:40:27.875165+00:00"}