{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:NYEUNPMST4JVZ6RVIMYXBVZWWW","short_pith_number":"pith:NYEUNPMS","schema_version":"1.0","canonical_sha256":"6e0946bd929f135cfa35433170d736b5a824bbc40403492efa6d84980eaf7cb0","source":{"kind":"arxiv","id":"1502.07484","version":1},"attestation_state":"computed","paper":{"title":"Graphs with no induced wheel or antiwheel","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Fr\\'ed\\'eric Maffray","submitted_at":"2015-02-26T09:55:09Z","abstract_excerpt":"A wheel is a graph that consists of a chordless cycle of length at least 4 plus a vertex with at least three neighbors on the cycle. It was shown recently that detecting induced wheels is an NP-complete problem. In contrast, it is shown here that graphs that contain no wheel and no antiwheel have a very simple structure and consequently can be recognized in polynomial time."},"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":"1502.07484","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-02-26T09:55:09Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"3c9dc8dafba53c94ee54b40bd65542c1588813b2a37545f202e8903e7650d00b","abstract_canon_sha256":"3bc608efd8cdb1fd2aa98a23e47a46a78d4124a59bae3eb9582de2828f260e06"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:26:03.578430Z","signature_b64":"fdL0anvvoP1ElwPuFqi4hqPrcfcchS8kBX748r3KbChy+W4oWWliTgOPVz//qUxFQ0h5akcZnYK4rauQSVmrDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6e0946bd929f135cfa35433170d736b5a824bbc40403492efa6d84980eaf7cb0","last_reissued_at":"2026-05-18T02:26:03.577900Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:26:03.577900Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Graphs with no induced wheel or antiwheel","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Fr\\'ed\\'eric Maffray","submitted_at":"2015-02-26T09:55:09Z","abstract_excerpt":"A wheel is a graph that consists of a chordless cycle of length at least 4 plus a vertex with at least three neighbors on the cycle. It was shown recently that detecting induced wheels is an NP-complete problem. In contrast, it is shown here that graphs that contain no wheel and no antiwheel have a very simple structure and consequently can be recognized in polynomial time."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.07484","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":"1502.07484","created_at":"2026-05-18T02:26:03.577987+00:00"},{"alias_kind":"arxiv_version","alias_value":"1502.07484v1","created_at":"2026-05-18T02:26:03.577987+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.07484","created_at":"2026-05-18T02:26:03.577987+00:00"},{"alias_kind":"pith_short_12","alias_value":"NYEUNPMST4JV","created_at":"2026-05-18T12:29:34.919912+00:00"},{"alias_kind":"pith_short_16","alias_value":"NYEUNPMST4JVZ6RV","created_at":"2026-05-18T12:29:34.919912+00:00"},{"alias_kind":"pith_short_8","alias_value":"NYEUNPMS","created_at":"2026-05-18T12:29:34.919912+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/NYEUNPMST4JVZ6RVIMYXBVZWWW","json":"https://pith.science/pith/NYEUNPMST4JVZ6RVIMYXBVZWWW.json","graph_json":"https://pith.science/api/pith-number/NYEUNPMST4JVZ6RVIMYXBVZWWW/graph.json","events_json":"https://pith.science/api/pith-number/NYEUNPMST4JVZ6RVIMYXBVZWWW/events.json","paper":"https://pith.science/paper/NYEUNPMS"},"agent_actions":{"view_html":"https://pith.science/pith/NYEUNPMST4JVZ6RVIMYXBVZWWW","download_json":"https://pith.science/pith/NYEUNPMST4JVZ6RVIMYXBVZWWW.json","view_paper":"https://pith.science/paper/NYEUNPMS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1502.07484&json=true","fetch_graph":"https://pith.science/api/pith-number/NYEUNPMST4JVZ6RVIMYXBVZWWW/graph.json","fetch_events":"https://pith.science/api/pith-number/NYEUNPMST4JVZ6RVIMYXBVZWWW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NYEUNPMST4JVZ6RVIMYXBVZWWW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NYEUNPMST4JVZ6RVIMYXBVZWWW/action/storage_attestation","attest_author":"https://pith.science/pith/NYEUNPMST4JVZ6RVIMYXBVZWWW/action/author_attestation","sign_citation":"https://pith.science/pith/NYEUNPMST4JVZ6RVIMYXBVZWWW/action/citation_signature","submit_replication":"https://pith.science/pith/NYEUNPMST4JVZ6RVIMYXBVZWWW/action/replication_record"}},"created_at":"2026-05-18T02:26:03.577987+00:00","updated_at":"2026-05-18T02:26:03.577987+00:00"}