{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:6DS6QKVOTZFZ6UMWOHE5G2CDIW","short_pith_number":"pith:6DS6QKVO","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"},"canonical_sha256":"f0e5e82aae9e4b9f519671c9d3684345b0e29c608a0cc983f57cafc43b9f241c","source":{"kind":"arxiv","id":"1602.02406","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.02406","created_at":"2026-05-18T01:21:10Z"},{"alias_kind":"arxiv_version","alias_value":"1602.02406v1","created_at":"2026-05-18T01:21:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.02406","created_at":"2026-05-18T01:21:10Z"},{"alias_kind":"pith_short_12","alias_value":"6DS6QKVOTZFZ","created_at":"2026-05-18T12:30:01Z"},{"alias_kind":"pith_short_16","alias_value":"6DS6QKVOTZFZ6UMW","created_at":"2026-05-18T12:30:01Z"},{"alias_kind":"pith_short_8","alias_value":"6DS6QKVO","created_at":"2026-05-18T12:30:01Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:6DS6QKVOTZFZ6UMWOHE5G2CDIW","target":"record","payload":{"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"},"canonical_sha256":"f0e5e82aae9e4b9f519671c9d3684345b0e29c608a0cc983f57cafc43b9f241c","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"},"source_kind":"arxiv","source_id":"1602.02406","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:21:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0KEet5aVt4isfoTnV50ttDBVl7wBZe19YFqilNIJK4j4iqEXxFGoq7rPSF+WEjICH8wmoSz6sJydImUDIrSiAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T19:24:58.690045Z"},"content_sha256":"b7f3047ed8d318be036dd5d8e7f064888ba6da3d342f0d1f6e80d32d7cfc3fa9","schema_version":"1.0","event_id":"sha256:b7f3047ed8d318be036dd5d8e7f064888ba6da3d342f0d1f6e80d32d7cfc3fa9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:6DS6QKVOTZFZ6UMWOHE5G2CDIW","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:21:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Wkb2ivv2cBPDlWk+iR/ligGPimihykWcQ1fWTzmdQP7QeNmV3omGYLx5cEZ9cJX6NNXm1KYZI0aPlu05ns8QDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T19:24:58.690827Z"},"content_sha256":"6a6a80838a84c94b601ebce2ea470b5f2739c0f6b4bea2c06343a30f2c1b1a4e","schema_version":"1.0","event_id":"sha256:6a6a80838a84c94b601ebce2ea470b5f2739c0f6b4bea2c06343a30f2c1b1a4e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6DS6QKVOTZFZ6UMWOHE5G2CDIW/bundle.json","state_url":"https://pith.science/pith/6DS6QKVOTZFZ6UMWOHE5G2CDIW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6DS6QKVOTZFZ6UMWOHE5G2CDIW/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-09T19:24:58Z","links":{"resolver":"https://pith.science/pith/6DS6QKVOTZFZ6UMWOHE5G2CDIW","bundle":"https://pith.science/pith/6DS6QKVOTZFZ6UMWOHE5G2CDIW/bundle.json","state":"https://pith.science/pith/6DS6QKVOTZFZ6UMWOHE5G2CDIW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6DS6QKVOTZFZ6UMWOHE5G2CDIW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:6DS6QKVOTZFZ6UMWOHE5G2CDIW","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"881bf5caa835de08a4d3d7f439a1d0eb9c9289c5c6d2182782dc15547e5fc36a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-02-07T18:46:29Z","title_canon_sha256":"1b0654143f3336368ae715251581eca03806651ea14492556f64b51e5504eb48"},"schema_version":"1.0","source":{"id":"1602.02406","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.02406","created_at":"2026-05-18T01:21:10Z"},{"alias_kind":"arxiv_version","alias_value":"1602.02406v1","created_at":"2026-05-18T01:21:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.02406","created_at":"2026-05-18T01:21:10Z"},{"alias_kind":"pith_short_12","alias_value":"6DS6QKVOTZFZ","created_at":"2026-05-18T12:30:01Z"},{"alias_kind":"pith_short_16","alias_value":"6DS6QKVOTZFZ6UMW","created_at":"2026-05-18T12:30:01Z"},{"alias_kind":"pith_short_8","alias_value":"6DS6QKVO","created_at":"2026-05-18T12:30:01Z"}],"graph_snapshots":[{"event_id":"sha256:6a6a80838a84c94b601ebce2ea470b5f2739c0f6b4bea2c06343a30f2c1b1a4e","target":"graph","created_at":"2026-05-18T01:21:10Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Irena Penev, Martin Milani\\v{c}, Nicolas Trotignon","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-02-07T18:46:29Z","title":"A decomposition theorem for {ISK4,wheel}-free trigraphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.02406","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:b7f3047ed8d318be036dd5d8e7f064888ba6da3d342f0d1f6e80d32d7cfc3fa9","target":"record","created_at":"2026-05-18T01:21:10Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"881bf5caa835de08a4d3d7f439a1d0eb9c9289c5c6d2182782dc15547e5fc36a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-02-07T18:46:29Z","title_canon_sha256":"1b0654143f3336368ae715251581eca03806651ea14492556f64b51e5504eb48"},"schema_version":"1.0","source":{"id":"1602.02406","kind":"arxiv","version":1}},"canonical_sha256":"f0e5e82aae9e4b9f519671c9d3684345b0e29c608a0cc983f57cafc43b9f241c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f0e5e82aae9e4b9f519671c9d3684345b0e29c608a0cc983f57cafc43b9f241c","first_computed_at":"2026-05-18T01:21:10.062057Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:21:10.062057Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"EwVyTxWQ/rTdP69LViV7Fofw5LzTR8LB5cL3gowDM1jQlyWpCfUIHx3XVn/7ZrLgf2GR46wAiUmFu+ht0Y9lAw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:21:10.062745Z","signed_message":"canonical_sha256_bytes"},"source_id":"1602.02406","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b7f3047ed8d318be036dd5d8e7f064888ba6da3d342f0d1f6e80d32d7cfc3fa9","sha256:6a6a80838a84c94b601ebce2ea470b5f2739c0f6b4bea2c06343a30f2c1b1a4e"],"state_sha256":"9694a3db7516c59305feb7aed61fb46470ba679bbdbfa5cea2958b9c2f8fe5fa"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"35VtfujqzO8gGoxWBDzZKOIhtSbQsO8iKYGD2AQfTr4Rk43O078+Pablub4G/9R+kYtmm6ujaZ3V07tGqkXkAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T19:24:58.694767Z","bundle_sha256":"daf93129a5bde812a9f4c06ee13bd7a8482a423fa03d5227139dfeae8ad29f60"}}