{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:HTC7VE6YLSOQNE6CWHZ6QTCH2L","short_pith_number":"pith:HTC7VE6Y","canonical_record":{"source":{"id":"1108.0277","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-08-01T10:45:09Z","cross_cats_sorted":[],"title_canon_sha256":"0643ff68f5e93ba8f4a20c895d55933b8245a2a7885712d81f792513852856e9","abstract_canon_sha256":"90f36748815c0a69c824fe8632a857141019ed146b7a782e3ed57fde0e1998de"},"schema_version":"1.0"},"canonical_sha256":"3cc5fa93d85c9d0693c2b1f3e84c47d2d58415394f08459ccccd843bb2dbc933","source":{"kind":"arxiv","id":"1108.0277","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1108.0277","created_at":"2026-05-18T04:03:43Z"},{"alias_kind":"arxiv_version","alias_value":"1108.0277v2","created_at":"2026-05-18T04:03:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1108.0277","created_at":"2026-05-18T04:03:43Z"},{"alias_kind":"pith_short_12","alias_value":"HTC7VE6YLSOQ","created_at":"2026-05-18T12:26:30Z"},{"alias_kind":"pith_short_16","alias_value":"HTC7VE6YLSOQNE6C","created_at":"2026-05-18T12:26:30Z"},{"alias_kind":"pith_short_8","alias_value":"HTC7VE6Y","created_at":"2026-05-18T12:26:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:HTC7VE6YLSOQNE6CWHZ6QTCH2L","target":"record","payload":{"canonical_record":{"source":{"id":"1108.0277","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-08-01T10:45:09Z","cross_cats_sorted":[],"title_canon_sha256":"0643ff68f5e93ba8f4a20c895d55933b8245a2a7885712d81f792513852856e9","abstract_canon_sha256":"90f36748815c0a69c824fe8632a857141019ed146b7a782e3ed57fde0e1998de"},"schema_version":"1.0"},"canonical_sha256":"3cc5fa93d85c9d0693c2b1f3e84c47d2d58415394f08459ccccd843bb2dbc933","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:03:43.044087Z","signature_b64":"82yLfenmpYcJiTU7d9IIIhu8SpQokzS/oJhQVfYCjxNuKxzi9sbx6RbrbXHp34SNf+P7B7S58vlhFeurJQE8CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3cc5fa93d85c9d0693c2b1f3e84c47d2d58415394f08459ccccd843bb2dbc933","last_reissued_at":"2026-05-18T04:03:43.043341Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:03:43.043341Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1108.0277","source_version":2,"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-18T04:03:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wCS0FVIKN7iCV9JIo6/RYskUKOqLBb561eXtfn6R6VZI20T0vjrtMKkb/fF4f297i7oQqk79xSHBB6xpRZrvAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T05:22:53.425877Z"},"content_sha256":"4c586b65d6e64aa6818f5928a995907005556e8c5f7a87e76343352f3b2df478","schema_version":"1.0","event_id":"sha256:4c586b65d6e64aa6818f5928a995907005556e8c5f7a87e76343352f3b2df478"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:HTC7VE6YLSOQNE6CWHZ6QTCH2L","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Bipartite powers of k-chordal graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"L. Sunil Chandran, Rogers Mathew","submitted_at":"2011-08-01T10:45:09Z","abstract_excerpt":"Let k be an integer and k \\geq 3. A graph G is k-chordal if G does not have an induced cycle of length greater than k. From the definition it is clear that 3-chordal graphs are precisely the class of chordal graphs. Duchet proved that, for every positive integer m, if G^m is chordal then so is G^{m+2}. Brandst\\\"adt et al. in [Andreas Brandst\\\"adt, Van Bang Le, and Thomas Szymczak. Duchet-type theorems for powers of HHD-free graphs. Discrete Mathematics, 177(1-3):9-16, 1997.] showed that if G^m is k-chordal, then so is G^{m+2}.\n  Powering a bipartite graph does not preserve its bipartitedness. "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1108.0277","kind":"arxiv","version":2},"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-18T04:03:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6KM157HFw+u86YbmHBABlGvYF78cYj+GFK1uUznBXcmkmkjjapfMsYhzkvGud0xK9PiTo4Lz2eyuSwe1gjMEBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T05:22:53.426225Z"},"content_sha256":"1bbb8afacb4c6fd16c9f7e8dbeac269c1c85736d9e4a81ee580e20884d38d5b9","schema_version":"1.0","event_id":"sha256:1bbb8afacb4c6fd16c9f7e8dbeac269c1c85736d9e4a81ee580e20884d38d5b9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HTC7VE6YLSOQNE6CWHZ6QTCH2L/bundle.json","state_url":"https://pith.science/pith/HTC7VE6YLSOQNE6CWHZ6QTCH2L/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HTC7VE6YLSOQNE6CWHZ6QTCH2L/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-01T05:22:53Z","links":{"resolver":"https://pith.science/pith/HTC7VE6YLSOQNE6CWHZ6QTCH2L","bundle":"https://pith.science/pith/HTC7VE6YLSOQNE6CWHZ6QTCH2L/bundle.json","state":"https://pith.science/pith/HTC7VE6YLSOQNE6CWHZ6QTCH2L/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HTC7VE6YLSOQNE6CWHZ6QTCH2L/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:HTC7VE6YLSOQNE6CWHZ6QTCH2L","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":"90f36748815c0a69c824fe8632a857141019ed146b7a782e3ed57fde0e1998de","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-08-01T10:45:09Z","title_canon_sha256":"0643ff68f5e93ba8f4a20c895d55933b8245a2a7885712d81f792513852856e9"},"schema_version":"1.0","source":{"id":"1108.0277","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1108.0277","created_at":"2026-05-18T04:03:43Z"},{"alias_kind":"arxiv_version","alias_value":"1108.0277v2","created_at":"2026-05-18T04:03:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1108.0277","created_at":"2026-05-18T04:03:43Z"},{"alias_kind":"pith_short_12","alias_value":"HTC7VE6YLSOQ","created_at":"2026-05-18T12:26:30Z"},{"alias_kind":"pith_short_16","alias_value":"HTC7VE6YLSOQNE6C","created_at":"2026-05-18T12:26:30Z"},{"alias_kind":"pith_short_8","alias_value":"HTC7VE6Y","created_at":"2026-05-18T12:26:30Z"}],"graph_snapshots":[{"event_id":"sha256:1bbb8afacb4c6fd16c9f7e8dbeac269c1c85736d9e4a81ee580e20884d38d5b9","target":"graph","created_at":"2026-05-18T04:03:43Z","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":"Let k be an integer and k \\geq 3. A graph G is k-chordal if G does not have an induced cycle of length greater than k. From the definition it is clear that 3-chordal graphs are precisely the class of chordal graphs. Duchet proved that, for every positive integer m, if G^m is chordal then so is G^{m+2}. Brandst\\\"adt et al. in [Andreas Brandst\\\"adt, Van Bang Le, and Thomas Szymczak. Duchet-type theorems for powers of HHD-free graphs. Discrete Mathematics, 177(1-3):9-16, 1997.] showed that if G^m is k-chordal, then so is G^{m+2}.\n  Powering a bipartite graph does not preserve its bipartitedness. ","authors_text":"L. Sunil Chandran, Rogers Mathew","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-08-01T10:45:09Z","title":"Bipartite powers of k-chordal graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1108.0277","kind":"arxiv","version":2},"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:4c586b65d6e64aa6818f5928a995907005556e8c5f7a87e76343352f3b2df478","target":"record","created_at":"2026-05-18T04:03:43Z","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":"90f36748815c0a69c824fe8632a857141019ed146b7a782e3ed57fde0e1998de","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-08-01T10:45:09Z","title_canon_sha256":"0643ff68f5e93ba8f4a20c895d55933b8245a2a7885712d81f792513852856e9"},"schema_version":"1.0","source":{"id":"1108.0277","kind":"arxiv","version":2}},"canonical_sha256":"3cc5fa93d85c9d0693c2b1f3e84c47d2d58415394f08459ccccd843bb2dbc933","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3cc5fa93d85c9d0693c2b1f3e84c47d2d58415394f08459ccccd843bb2dbc933","first_computed_at":"2026-05-18T04:03:43.043341Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:03:43.043341Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"82yLfenmpYcJiTU7d9IIIhu8SpQokzS/oJhQVfYCjxNuKxzi9sbx6RbrbXHp34SNf+P7B7S58vlhFeurJQE8CA==","signature_status":"signed_v1","signed_at":"2026-05-18T04:03:43.044087Z","signed_message":"canonical_sha256_bytes"},"source_id":"1108.0277","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4c586b65d6e64aa6818f5928a995907005556e8c5f7a87e76343352f3b2df478","sha256:1bbb8afacb4c6fd16c9f7e8dbeac269c1c85736d9e4a81ee580e20884d38d5b9"],"state_sha256":"41e0151fc18353c7cfafd3bf0660501dd0f4cd3f3d5fd808abc6b8e951fe6e2d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yAQA3WUVt0sxyvy5/TBxc3wDm7aKu4szIMuI6H4DH3X4xlmCnWzO6mKKMFPgcuSDdcrkiYYIrMUvc3ujjAdTBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T05:22:53.428530Z","bundle_sha256":"a1c4b479fe2d15d03028c296f5230ec4e32da7f4a63884cd39204091f615ff27"}}