{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2009:YNCBLLORFPB4LNNU6YQGHBZAK4","short_pith_number":"pith:YNCBLLOR","canonical_record":{"source":{"id":"0909.5302","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2009-09-29T11:30:14Z","cross_cats_sorted":[],"title_canon_sha256":"f203eb4740b6385ff96cb1d25091ffaaa8bbb3ce89ec5473503a1a3e13189add","abstract_canon_sha256":"3ddc37d1258b46009026f0a4ceaa6a5045e80412dd34cc0748e40236bb557231"},"schema_version":"1.0"},"canonical_sha256":"c34415add12bc3c5b5b4f62063872057302f7cd20a0a6524958fa66dd627fb36","source":{"kind":"arxiv","id":"0909.5302","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0909.5302","created_at":"2026-05-18T04:39:50Z"},{"alias_kind":"arxiv_version","alias_value":"0909.5302v1","created_at":"2026-05-18T04:39:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0909.5302","created_at":"2026-05-18T04:39:50Z"},{"alias_kind":"pith_short_12","alias_value":"YNCBLLORFPB4","created_at":"2026-05-18T12:26:02Z"},{"alias_kind":"pith_short_16","alias_value":"YNCBLLORFPB4LNNU","created_at":"2026-05-18T12:26:02Z"},{"alias_kind":"pith_short_8","alias_value":"YNCBLLOR","created_at":"2026-05-18T12:26:02Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2009:YNCBLLORFPB4LNNU6YQGHBZAK4","target":"record","payload":{"canonical_record":{"source":{"id":"0909.5302","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2009-09-29T11:30:14Z","cross_cats_sorted":[],"title_canon_sha256":"f203eb4740b6385ff96cb1d25091ffaaa8bbb3ce89ec5473503a1a3e13189add","abstract_canon_sha256":"3ddc37d1258b46009026f0a4ceaa6a5045e80412dd34cc0748e40236bb557231"},"schema_version":"1.0"},"canonical_sha256":"c34415add12bc3c5b5b4f62063872057302f7cd20a0a6524958fa66dd627fb36","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:39:50.399033Z","signature_b64":"zNjj+YuB6qzKDZzKYaQCYOSW0leoCs5wzRcpfVbukEzyc2pzJ2/do9K9PxKM/sSqC73bOnmeSvVbzIdL0xA5DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c34415add12bc3c5b5b4f62063872057302f7cd20a0a6524958fa66dd627fb36","last_reissued_at":"2026-05-18T04:39:50.398603Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:39:50.398603Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"0909.5302","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-18T04:39:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8vul/VeGrWbzkcPOUUDdE3koT5M9Sw5Z5nqHBMrgVqkjZWJ37gNCFvG64BUzKUMI1Y21AA8J/yCDhW40BmWmCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-03T19:54:50.933819Z"},"content_sha256":"78be390585cf1c1600fce7c15b3831e9a899e219fb186e7ce2918a6e2cbcbc19","schema_version":"1.0","event_id":"sha256:78be390585cf1c1600fce7c15b3831e9a899e219fb186e7ce2918a6e2cbcbc19"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2009:YNCBLLORFPB4LNNU6YQGHBZAK4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The competition number of a graph with exactly two holes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jung Yeun Lee, Seog-Jin Kim, Suh-Ryung Kim, Yoshio Sano","submitted_at":"2009-09-29T11:30:14Z","abstract_excerpt":"Let D be an acyclic digraph. The competition graph of D is a graph which has the same vertex set as D and has an edge between x and y if and only if there exists a vertex v in D such that (x,v) and (y,v) are arcs of D. For any graph G, G together with sufficiently many isolated vertices is the competition graph of some acyclic digraph. The competition number k(G) of G is the smallest number of such isolated vertices.\n  A hole of a graph is a cycle of length at least 4 as an induced subgraph. In 2005, Kim [5] conjectured that the competition number of a graph with h holes is at most h+1. Though"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0909.5302","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-18T04:39:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pHjf1q33lQfnnrDNEZ+G9IGL4OK0V7332fGoENgn1XrbzjfsLVNsjebGC7PKqDrQEHQO9BTjahbqxsMaaOciAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-03T19:54:50.934161Z"},"content_sha256":"5d7b6a0c005c8e5a2a9010ec688ed3f0040b5733160b70965b2245b394976e19","schema_version":"1.0","event_id":"sha256:5d7b6a0c005c8e5a2a9010ec688ed3f0040b5733160b70965b2245b394976e19"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YNCBLLORFPB4LNNU6YQGHBZAK4/bundle.json","state_url":"https://pith.science/pith/YNCBLLORFPB4LNNU6YQGHBZAK4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YNCBLLORFPB4LNNU6YQGHBZAK4/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-07-03T19:54:50Z","links":{"resolver":"https://pith.science/pith/YNCBLLORFPB4LNNU6YQGHBZAK4","bundle":"https://pith.science/pith/YNCBLLORFPB4LNNU6YQGHBZAK4/bundle.json","state":"https://pith.science/pith/YNCBLLORFPB4LNNU6YQGHBZAK4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YNCBLLORFPB4LNNU6YQGHBZAK4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2009:YNCBLLORFPB4LNNU6YQGHBZAK4","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":"3ddc37d1258b46009026f0a4ceaa6a5045e80412dd34cc0748e40236bb557231","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2009-09-29T11:30:14Z","title_canon_sha256":"f203eb4740b6385ff96cb1d25091ffaaa8bbb3ce89ec5473503a1a3e13189add"},"schema_version":"1.0","source":{"id":"0909.5302","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0909.5302","created_at":"2026-05-18T04:39:50Z"},{"alias_kind":"arxiv_version","alias_value":"0909.5302v1","created_at":"2026-05-18T04:39:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0909.5302","created_at":"2026-05-18T04:39:50Z"},{"alias_kind":"pith_short_12","alias_value":"YNCBLLORFPB4","created_at":"2026-05-18T12:26:02Z"},{"alias_kind":"pith_short_16","alias_value":"YNCBLLORFPB4LNNU","created_at":"2026-05-18T12:26:02Z"},{"alias_kind":"pith_short_8","alias_value":"YNCBLLOR","created_at":"2026-05-18T12:26:02Z"}],"graph_snapshots":[{"event_id":"sha256:5d7b6a0c005c8e5a2a9010ec688ed3f0040b5733160b70965b2245b394976e19","target":"graph","created_at":"2026-05-18T04:39:50Z","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 D be an acyclic digraph. The competition graph of D is a graph which has the same vertex set as D and has an edge between x and y if and only if there exists a vertex v in D such that (x,v) and (y,v) are arcs of D. For any graph G, G together with sufficiently many isolated vertices is the competition graph of some acyclic digraph. The competition number k(G) of G is the smallest number of such isolated vertices.\n  A hole of a graph is a cycle of length at least 4 as an induced subgraph. In 2005, Kim [5] conjectured that the competition number of a graph with h holes is at most h+1. Though","authors_text":"Jung Yeun Lee, Seog-Jin Kim, Suh-Ryung Kim, Yoshio Sano","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2009-09-29T11:30:14Z","title":"The competition number of a graph with exactly two holes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0909.5302","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:78be390585cf1c1600fce7c15b3831e9a899e219fb186e7ce2918a6e2cbcbc19","target":"record","created_at":"2026-05-18T04:39:50Z","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":"3ddc37d1258b46009026f0a4ceaa6a5045e80412dd34cc0748e40236bb557231","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2009-09-29T11:30:14Z","title_canon_sha256":"f203eb4740b6385ff96cb1d25091ffaaa8bbb3ce89ec5473503a1a3e13189add"},"schema_version":"1.0","source":{"id":"0909.5302","kind":"arxiv","version":1}},"canonical_sha256":"c34415add12bc3c5b5b4f62063872057302f7cd20a0a6524958fa66dd627fb36","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c34415add12bc3c5b5b4f62063872057302f7cd20a0a6524958fa66dd627fb36","first_computed_at":"2026-05-18T04:39:50.398603Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:39:50.398603Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"zNjj+YuB6qzKDZzKYaQCYOSW0leoCs5wzRcpfVbukEzyc2pzJ2/do9K9PxKM/sSqC73bOnmeSvVbzIdL0xA5DQ==","signature_status":"signed_v1","signed_at":"2026-05-18T04:39:50.399033Z","signed_message":"canonical_sha256_bytes"},"source_id":"0909.5302","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:78be390585cf1c1600fce7c15b3831e9a899e219fb186e7ce2918a6e2cbcbc19","sha256:5d7b6a0c005c8e5a2a9010ec688ed3f0040b5733160b70965b2245b394976e19"],"state_sha256":"24371c4f2c9d39211be197260512df5907dfe150689204ae168cd480037a4d66"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wtRAD5xhTp0kDkXywUXndvnysblfyAbQ4Pzxq5SnGwkqx97gLKZ75jJxwb/PYryDj3+Syx3x3Eap5pia3UjtAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-03T19:54:50.936179Z","bundle_sha256":"f6c1391c055a373b4b153187670c0b45f5469f9ff2647ba01afaeb5991d2f1e7"}}