{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:WRF7NAX63JGU5R7OD3OFOKQRBQ","short_pith_number":"pith:WRF7NAX6","schema_version":"1.0","canonical_sha256":"b44bf682feda4d4ec7ee1edc572a110c322b152737f365db7101ae347de09a6e","source":{"kind":"arxiv","id":"1801.07854","version":3},"attestation_state":"computed","paper":{"title":"Chorded pancyclicity in $k$-partite graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Daniela Ferrero, Linda Lesniak","submitted_at":"2018-01-24T04:13:22Z","abstract_excerpt":"We prove that for any integers $p\\geq k\\geq 3$ and any $k$-tuple of positive integers $(n_1,\\ldots ,n_k)$ such that $p=\\sum _{i=1}^k{n_i}$ and $n_1\\geq n_2\\geq \\ldots \\geq n_k$, the condition $n_1\\leq {p\\over 2}$ is necessary and sufficient for every subgraph of the complete $k$-partite graph $K(n_1,\\ldots ,n_k)$ with at least \\[{{4 -2p+2n_1+\\sum _{i=1}^{k} n_i(p-n_i)}\\over 2}\\] edges to be chorded pancyclic. Removing all but one edge incident with any vertex of minimum degree in $K(n_1,\\ldots ,n_k)$ shows that this result is best possible. Our result implies that for any integers, $k\\geq 3$ a"},"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":"1801.07854","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-01-24T04:13:22Z","cross_cats_sorted":[],"title_canon_sha256":"b5fdc685ade094041abc0e24e5aca4b1003a60b54a6f1bc256989a2c66595190","abstract_canon_sha256":"fd1d31e76fd856ae38169e631ecd3ed882bbb17f7625fe4d15515d5811e26730"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:07:40.900780Z","signature_b64":"wPlvmx3WATFi7M9OsPBWevdyxuj3h6pGWOMet0jacg0CySKr7g0Yic82arrXNq9wpv04mhbU++Qjea/l9wfBDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b44bf682feda4d4ec7ee1edc572a110c322b152737f365db7101ae347de09a6e","last_reissued_at":"2026-05-18T00:07:40.900174Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:07:40.900174Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Chorded pancyclicity in $k$-partite graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Daniela Ferrero, Linda Lesniak","submitted_at":"2018-01-24T04:13:22Z","abstract_excerpt":"We prove that for any integers $p\\geq k\\geq 3$ and any $k$-tuple of positive integers $(n_1,\\ldots ,n_k)$ such that $p=\\sum _{i=1}^k{n_i}$ and $n_1\\geq n_2\\geq \\ldots \\geq n_k$, the condition $n_1\\leq {p\\over 2}$ is necessary and sufficient for every subgraph of the complete $k$-partite graph $K(n_1,\\ldots ,n_k)$ with at least \\[{{4 -2p+2n_1+\\sum _{i=1}^{k} n_i(p-n_i)}\\over 2}\\] edges to be chorded pancyclic. Removing all but one edge incident with any vertex of minimum degree in $K(n_1,\\ldots ,n_k)$ shows that this result is best possible. Our result implies that for any integers, $k\\geq 3$ a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.07854","kind":"arxiv","version":3},"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":"1801.07854","created_at":"2026-05-18T00:07:40.900252+00:00"},{"alias_kind":"arxiv_version","alias_value":"1801.07854v3","created_at":"2026-05-18T00:07:40.900252+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.07854","created_at":"2026-05-18T00:07:40.900252+00:00"},{"alias_kind":"pith_short_12","alias_value":"WRF7NAX63JGU","created_at":"2026-05-18T12:33:01.666342+00:00"},{"alias_kind":"pith_short_16","alias_value":"WRF7NAX63JGU5R7O","created_at":"2026-05-18T12:33:01.666342+00:00"},{"alias_kind":"pith_short_8","alias_value":"WRF7NAX6","created_at":"2026-05-18T12:33:01.666342+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/WRF7NAX63JGU5R7OD3OFOKQRBQ","json":"https://pith.science/pith/WRF7NAX63JGU5R7OD3OFOKQRBQ.json","graph_json":"https://pith.science/api/pith-number/WRF7NAX63JGU5R7OD3OFOKQRBQ/graph.json","events_json":"https://pith.science/api/pith-number/WRF7NAX63JGU5R7OD3OFOKQRBQ/events.json","paper":"https://pith.science/paper/WRF7NAX6"},"agent_actions":{"view_html":"https://pith.science/pith/WRF7NAX63JGU5R7OD3OFOKQRBQ","download_json":"https://pith.science/pith/WRF7NAX63JGU5R7OD3OFOKQRBQ.json","view_paper":"https://pith.science/paper/WRF7NAX6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1801.07854&json=true","fetch_graph":"https://pith.science/api/pith-number/WRF7NAX63JGU5R7OD3OFOKQRBQ/graph.json","fetch_events":"https://pith.science/api/pith-number/WRF7NAX63JGU5R7OD3OFOKQRBQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WRF7NAX63JGU5R7OD3OFOKQRBQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WRF7NAX63JGU5R7OD3OFOKQRBQ/action/storage_attestation","attest_author":"https://pith.science/pith/WRF7NAX63JGU5R7OD3OFOKQRBQ/action/author_attestation","sign_citation":"https://pith.science/pith/WRF7NAX63JGU5R7OD3OFOKQRBQ/action/citation_signature","submit_replication":"https://pith.science/pith/WRF7NAX63JGU5R7OD3OFOKQRBQ/action/replication_record"}},"created_at":"2026-05-18T00:07:40.900252+00:00","updated_at":"2026-05-18T00:07:40.900252+00:00"}