{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:QPNRRDRW7B7MTFQF5RAUAV7JU3","short_pith_number":"pith:QPNRRDRW","canonical_record":{"source":{"id":"1611.08066","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2016-11-24T04:57:05Z","cross_cats_sorted":[],"title_canon_sha256":"1e2e6e7d6c00d42f14e1b8827457cd2982838fbd2c45c94122394896ce07edd2","abstract_canon_sha256":"7d82182c61626251bf865f25625e8a5221f99bf6fddc31cccda0adba90ad83a8"},"schema_version":"1.0"},"canonical_sha256":"83db188e36f87ec99605ec414057e9a6e5cb6a3e06e658dfe96e340074fc872a","source":{"kind":"arxiv","id":"1611.08066","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.08066","created_at":"2026-05-18T00:56:44Z"},{"alias_kind":"arxiv_version","alias_value":"1611.08066v1","created_at":"2026-05-18T00:56:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.08066","created_at":"2026-05-18T00:56:44Z"},{"alias_kind":"pith_short_12","alias_value":"QPNRRDRW7B7M","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_16","alias_value":"QPNRRDRW7B7MTFQF","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_8","alias_value":"QPNRRDRW","created_at":"2026-05-18T12:30:41Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:QPNRRDRW7B7MTFQF5RAUAV7JU3","target":"record","payload":{"canonical_record":{"source":{"id":"1611.08066","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2016-11-24T04:57:05Z","cross_cats_sorted":[],"title_canon_sha256":"1e2e6e7d6c00d42f14e1b8827457cd2982838fbd2c45c94122394896ce07edd2","abstract_canon_sha256":"7d82182c61626251bf865f25625e8a5221f99bf6fddc31cccda0adba90ad83a8"},"schema_version":"1.0"},"canonical_sha256":"83db188e36f87ec99605ec414057e9a6e5cb6a3e06e658dfe96e340074fc872a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:56:44.535273Z","signature_b64":"62rJhTviY9AfIncWRuXrT85UpE04IYZLwO3qUD/5XpyakRguBCSxXKXNo6dqR5cYl/q284tUxt3ucbjK2+8OBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"83db188e36f87ec99605ec414057e9a6e5cb6a3e06e658dfe96e340074fc872a","last_reissued_at":"2026-05-18T00:56:44.534656Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:56:44.534656Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1611.08066","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-18T00:56:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"P1JG2j0qCmfe7qOf7+haBfeN1APe13qGn/4dH7HglNCBgaBEQHapHY5RFvXUCsH36hdNPWQToMbknizmtGJMCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T22:29:48.967005Z"},"content_sha256":"97db3f1028d762e57ba3c5a79a83d9910666f473f609c92c4c0ddd38ac9d5950","schema_version":"1.0","event_id":"sha256:97db3f1028d762e57ba3c5a79a83d9910666f473f609c92c4c0ddd38ac9d5950"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:QPNRRDRW7B7MTFQF5RAUAV7JU3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Structure and algorithms for (cap, even hole)-free graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Kathie Cameron, Kristina Vu\\v{s}kovi\\'c, Murilo V. G. da Silva, Shenwei Huang","submitted_at":"2016-11-24T04:57:05Z","abstract_excerpt":"A graph is even-hole-free if it has no induced even cycles of length 4 or more. A cap is a cycle of length at least 5 with exactly one chord and that chord creates a triangle with the cycle. In this paper, we consider (cap, even hole)-free graphs, and more generally, (cap, 4-hole)-free odd-signable graphs. We give an explicit construction of these graphs. We prove that every such graph $G$ has a vertex of degree at most $\\frac{3}{2}\\omega (G) -1$, and hence $\\chi(G)\\leq \\frac{3}{2}\\omega (G)$, where $\\omega(G)$ denotes the size of a largest clique in $G$ and $\\chi(G)$ denotes the chromatic num"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.08066","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-18T00:56:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rReNJ0BgHkFQblqbYJsp5cpHaJM7jFCRkotAQ9o7FM1Vb0xEUffla6y7MrHcp30Nf7kXM4ad2Hc8QSzPk/JzDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T22:29:48.967634Z"},"content_sha256":"b67be43745a431dca2c29db3bbec88a783f4ff23904d2de7c3086697d80996b0","schema_version":"1.0","event_id":"sha256:b67be43745a431dca2c29db3bbec88a783f4ff23904d2de7c3086697d80996b0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QPNRRDRW7B7MTFQF5RAUAV7JU3/bundle.json","state_url":"https://pith.science/pith/QPNRRDRW7B7MTFQF5RAUAV7JU3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QPNRRDRW7B7MTFQF5RAUAV7JU3/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-05-25T22:29:48Z","links":{"resolver":"https://pith.science/pith/QPNRRDRW7B7MTFQF5RAUAV7JU3","bundle":"https://pith.science/pith/QPNRRDRW7B7MTFQF5RAUAV7JU3/bundle.json","state":"https://pith.science/pith/QPNRRDRW7B7MTFQF5RAUAV7JU3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QPNRRDRW7B7MTFQF5RAUAV7JU3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:QPNRRDRW7B7MTFQF5RAUAV7JU3","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":"7d82182c61626251bf865f25625e8a5221f99bf6fddc31cccda0adba90ad83a8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2016-11-24T04:57:05Z","title_canon_sha256":"1e2e6e7d6c00d42f14e1b8827457cd2982838fbd2c45c94122394896ce07edd2"},"schema_version":"1.0","source":{"id":"1611.08066","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.08066","created_at":"2026-05-18T00:56:44Z"},{"alias_kind":"arxiv_version","alias_value":"1611.08066v1","created_at":"2026-05-18T00:56:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.08066","created_at":"2026-05-18T00:56:44Z"},{"alias_kind":"pith_short_12","alias_value":"QPNRRDRW7B7M","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_16","alias_value":"QPNRRDRW7B7MTFQF","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_8","alias_value":"QPNRRDRW","created_at":"2026-05-18T12:30:41Z"}],"graph_snapshots":[{"event_id":"sha256:b67be43745a431dca2c29db3bbec88a783f4ff23904d2de7c3086697d80996b0","target":"graph","created_at":"2026-05-18T00:56:44Z","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":"A graph is even-hole-free if it has no induced even cycles of length 4 or more. A cap is a cycle of length at least 5 with exactly one chord and that chord creates a triangle with the cycle. In this paper, we consider (cap, even hole)-free graphs, and more generally, (cap, 4-hole)-free odd-signable graphs. We give an explicit construction of these graphs. We prove that every such graph $G$ has a vertex of degree at most $\\frac{3}{2}\\omega (G) -1$, and hence $\\chi(G)\\leq \\frac{3}{2}\\omega (G)$, where $\\omega(G)$ denotes the size of a largest clique in $G$ and $\\chi(G)$ denotes the chromatic num","authors_text":"Kathie Cameron, Kristina Vu\\v{s}kovi\\'c, Murilo V. G. da Silva, Shenwei Huang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2016-11-24T04:57:05Z","title":"Structure and algorithms for (cap, even hole)-free graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.08066","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:97db3f1028d762e57ba3c5a79a83d9910666f473f609c92c4c0ddd38ac9d5950","target":"record","created_at":"2026-05-18T00:56:44Z","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":"7d82182c61626251bf865f25625e8a5221f99bf6fddc31cccda0adba90ad83a8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2016-11-24T04:57:05Z","title_canon_sha256":"1e2e6e7d6c00d42f14e1b8827457cd2982838fbd2c45c94122394896ce07edd2"},"schema_version":"1.0","source":{"id":"1611.08066","kind":"arxiv","version":1}},"canonical_sha256":"83db188e36f87ec99605ec414057e9a6e5cb6a3e06e658dfe96e340074fc872a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"83db188e36f87ec99605ec414057e9a6e5cb6a3e06e658dfe96e340074fc872a","first_computed_at":"2026-05-18T00:56:44.534656Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:56:44.534656Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"62rJhTviY9AfIncWRuXrT85UpE04IYZLwO3qUD/5XpyakRguBCSxXKXNo6dqR5cYl/q284tUxt3ucbjK2+8OBw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:56:44.535273Z","signed_message":"canonical_sha256_bytes"},"source_id":"1611.08066","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:97db3f1028d762e57ba3c5a79a83d9910666f473f609c92c4c0ddd38ac9d5950","sha256:b67be43745a431dca2c29db3bbec88a783f4ff23904d2de7c3086697d80996b0"],"state_sha256":"4d72d009f1791dc965bed316ced2c2bf6f824cdc147cf123315eb126394f6e8e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6JVc9fneGE9iOtbK8e2BLIIp9Wq+jsJhHirrFg/4gvOCqCCGqeDMkWU7jFQ7DoTHliNM6LeHe5mmdM93UUmYAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T22:29:48.971199Z","bundle_sha256":"a73d3f8c4efe6f2c52a7c0a1b911eab9521a4c9bd1184d619922c4c37db05fc6"}}