{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:6DS6QKVOTZFZ6UMWOHE5G2CDIW","short_pith_number":"pith:6DS6QKVO","schema_version":"1.0","canonical_sha256":"f0e5e82aae9e4b9f519671c9d3684345b0e29c608a0cc983f57cafc43b9f241c","source":{"kind":"arxiv","id":"1602.02406","version":1},"attestation_state":"computed","paper":{"title":"A decomposition theorem for {ISK4,wheel}-free trigraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Irena Penev, Martin Milani\\v{c}, Nicolas Trotignon","submitted_at":"2016-02-07T18:46:29Z","abstract_excerpt":"An ISK4 in a graph G is an induced subgraph of G that is isomorphic to a subdivision of K4 (the complete graph on four vertices). A wheel is a graph that consists of a chordless cycle, together with a vertex that has at least three neighbors in the cycle. A graph is {ISK4,wheel}-free if it has no ISK4 and does not contain a wheel as an induced subgraph. A \"trigraph\" is a generalization of a graph in which some pairs of vertices have \"undetermined\" adjacency. We prove a decomposition theorem for {ISK4,wheel}-free trigraphs. Our proof closely follows the proof of a decomposition theorem for ISK4"},"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":"1602.02406","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-02-07T18:46:29Z","cross_cats_sorted":[],"title_canon_sha256":"1b0654143f3336368ae715251581eca03806651ea14492556f64b51e5504eb48","abstract_canon_sha256":"881bf5caa835de08a4d3d7f439a1d0eb9c9289c5c6d2182782dc15547e5fc36a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:21:10.062745Z","signature_b64":"EwVyTxWQ/rTdP69LViV7Fofw5LzTR8LB5cL3gowDM1jQlyWpCfUIHx3XVn/7ZrLgf2GR46wAiUmFu+ht0Y9lAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f0e5e82aae9e4b9f519671c9d3684345b0e29c608a0cc983f57cafc43b9f241c","last_reissued_at":"2026-05-18T01:21:10.062057Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:21:10.062057Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A decomposition theorem for {ISK4,wheel}-free trigraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Irena Penev, Martin Milani\\v{c}, Nicolas Trotignon","submitted_at":"2016-02-07T18:46:29Z","abstract_excerpt":"An ISK4 in a graph G is an induced subgraph of G that is isomorphic to a subdivision of K4 (the complete graph on four vertices). A wheel is a graph that consists of a chordless cycle, together with a vertex that has at least three neighbors in the cycle. A graph is {ISK4,wheel}-free if it has no ISK4 and does not contain a wheel as an induced subgraph. A \"trigraph\" is a generalization of a graph in which some pairs of vertices have \"undetermined\" adjacency. We prove a decomposition theorem for {ISK4,wheel}-free trigraphs. Our proof closely follows the proof of a decomposition theorem for ISK4"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.02406","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":"1602.02406","created_at":"2026-05-18T01:21:10.062150+00:00"},{"alias_kind":"arxiv_version","alias_value":"1602.02406v1","created_at":"2026-05-18T01:21:10.062150+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.02406","created_at":"2026-05-18T01:21:10.062150+00:00"},{"alias_kind":"pith_short_12","alias_value":"6DS6QKVOTZFZ","created_at":"2026-05-18T12:30:01.593930+00:00"},{"alias_kind":"pith_short_16","alias_value":"6DS6QKVOTZFZ6UMW","created_at":"2026-05-18T12:30:01.593930+00:00"},{"alias_kind":"pith_short_8","alias_value":"6DS6QKVO","created_at":"2026-05-18T12:30:01.593930+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/6DS6QKVOTZFZ6UMWOHE5G2CDIW","json":"https://pith.science/pith/6DS6QKVOTZFZ6UMWOHE5G2CDIW.json","graph_json":"https://pith.science/api/pith-number/6DS6QKVOTZFZ6UMWOHE5G2CDIW/graph.json","events_json":"https://pith.science/api/pith-number/6DS6QKVOTZFZ6UMWOHE5G2CDIW/events.json","paper":"https://pith.science/paper/6DS6QKVO"},"agent_actions":{"view_html":"https://pith.science/pith/6DS6QKVOTZFZ6UMWOHE5G2CDIW","download_json":"https://pith.science/pith/6DS6QKVOTZFZ6UMWOHE5G2CDIW.json","view_paper":"https://pith.science/paper/6DS6QKVO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1602.02406&json=true","fetch_graph":"https://pith.science/api/pith-number/6DS6QKVOTZFZ6UMWOHE5G2CDIW/graph.json","fetch_events":"https://pith.science/api/pith-number/6DS6QKVOTZFZ6UMWOHE5G2CDIW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6DS6QKVOTZFZ6UMWOHE5G2CDIW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6DS6QKVOTZFZ6UMWOHE5G2CDIW/action/storage_attestation","attest_author":"https://pith.science/pith/6DS6QKVOTZFZ6UMWOHE5G2CDIW/action/author_attestation","sign_citation":"https://pith.science/pith/6DS6QKVOTZFZ6UMWOHE5G2CDIW/action/citation_signature","submit_replication":"https://pith.science/pith/6DS6QKVOTZFZ6UMWOHE5G2CDIW/action/replication_record"}},"created_at":"2026-05-18T01:21:10.062150+00:00","updated_at":"2026-05-18T01:21:10.062150+00:00"}