{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:6IGAZWRUIDCJBSJFA5LOSX5MVC","short_pith_number":"pith:6IGAZWRU","schema_version":"1.0","canonical_sha256":"f20c0cda3440c490c9250756e95faca8b2eceb6d478bbe65191b7b707ff8bf55","source":{"kind":"arxiv","id":"1709.06898","version":1},"attestation_state":"computed","paper":{"title":"Forbidden Subgraphs for Chorded Pancyclicity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Megan Cream, Ronald J. Gould, Victor Larsen","submitted_at":"2017-09-20T14:24:12Z","abstract_excerpt":"We call a graph $G$ pancyclic if it contains at least one cycle of every possible length $m$, for $3\\le m\\le |V(G)|$. In this paper, we define a new property called chorded pancyclicity. We explore forbidden subgraphs in claw-free graphs sufficient to imply that the graph contains at least one chorded cycle of every possible length $4, 5, \\ldots, |V(G)|$. In particular, certain paths and triangles with pendant paths are forbidden."},"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":"1709.06898","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-09-20T14:24:12Z","cross_cats_sorted":[],"title_canon_sha256":"f5858e38891677a7175027d254198f5117f3b1d0e0021b3b73d61a9d8ccb7ff0","abstract_canon_sha256":"899a728b7e6f1dd713b3eb5328d55bf393a2c8d8e2e98519cf22f04b61fd189c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:34:40.139549Z","signature_b64":"x98yw5TI2QkmwIYOFkOpOoQt63VFAyKU5wDYYmv3IXYuMevgLcU824SHUsaTRLiIxCiHg72pizB0nb7xbDRmCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f20c0cda3440c490c9250756e95faca8b2eceb6d478bbe65191b7b707ff8bf55","last_reissued_at":"2026-05-18T00:34:40.139041Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:34:40.139041Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Forbidden Subgraphs for Chorded Pancyclicity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Megan Cream, Ronald J. Gould, Victor Larsen","submitted_at":"2017-09-20T14:24:12Z","abstract_excerpt":"We call a graph $G$ pancyclic if it contains at least one cycle of every possible length $m$, for $3\\le m\\le |V(G)|$. In this paper, we define a new property called chorded pancyclicity. We explore forbidden subgraphs in claw-free graphs sufficient to imply that the graph contains at least one chorded cycle of every possible length $4, 5, \\ldots, |V(G)|$. In particular, certain paths and triangles with pendant paths are forbidden."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.06898","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":"1709.06898","created_at":"2026-05-18T00:34:40.139120+00:00"},{"alias_kind":"arxiv_version","alias_value":"1709.06898v1","created_at":"2026-05-18T00:34:40.139120+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.06898","created_at":"2026-05-18T00:34:40.139120+00:00"},{"alias_kind":"pith_short_12","alias_value":"6IGAZWRUIDCJ","created_at":"2026-05-18T12:31:03.183658+00:00"},{"alias_kind":"pith_short_16","alias_value":"6IGAZWRUIDCJBSJF","created_at":"2026-05-18T12:31:03.183658+00:00"},{"alias_kind":"pith_short_8","alias_value":"6IGAZWRU","created_at":"2026-05-18T12:31:03.183658+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/6IGAZWRUIDCJBSJFA5LOSX5MVC","json":"https://pith.science/pith/6IGAZWRUIDCJBSJFA5LOSX5MVC.json","graph_json":"https://pith.science/api/pith-number/6IGAZWRUIDCJBSJFA5LOSX5MVC/graph.json","events_json":"https://pith.science/api/pith-number/6IGAZWRUIDCJBSJFA5LOSX5MVC/events.json","paper":"https://pith.science/paper/6IGAZWRU"},"agent_actions":{"view_html":"https://pith.science/pith/6IGAZWRUIDCJBSJFA5LOSX5MVC","download_json":"https://pith.science/pith/6IGAZWRUIDCJBSJFA5LOSX5MVC.json","view_paper":"https://pith.science/paper/6IGAZWRU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1709.06898&json=true","fetch_graph":"https://pith.science/api/pith-number/6IGAZWRUIDCJBSJFA5LOSX5MVC/graph.json","fetch_events":"https://pith.science/api/pith-number/6IGAZWRUIDCJBSJFA5LOSX5MVC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6IGAZWRUIDCJBSJFA5LOSX5MVC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6IGAZWRUIDCJBSJFA5LOSX5MVC/action/storage_attestation","attest_author":"https://pith.science/pith/6IGAZWRUIDCJBSJFA5LOSX5MVC/action/author_attestation","sign_citation":"https://pith.science/pith/6IGAZWRUIDCJBSJFA5LOSX5MVC/action/citation_signature","submit_replication":"https://pith.science/pith/6IGAZWRUIDCJBSJFA5LOSX5MVC/action/replication_record"}},"created_at":"2026-05-18T00:34:40.139120+00:00","updated_at":"2026-05-18T00:34:40.139120+00:00"}