{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:O6N32AGGFIEBDJ5LTKZ22EY2NV","short_pith_number":"pith:O6N32AGG","canonical_record":{"source":{"id":"1102.5718","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-02-28T17:38:37Z","cross_cats_sorted":[],"title_canon_sha256":"bd1915502561782a49972273968e00ef162ade60ebd38216a0596d1184a7896b","abstract_canon_sha256":"abb2872ecd2b2f5a6472572222e490c1c9fec77558a7f64776e18c028d5e35d6"},"schema_version":"1.0"},"canonical_sha256":"779bbd00c62a0811a7ab9ab3ad131a6d4696c6b9d98df94445d140eea0cba4cc","source":{"kind":"arxiv","id":"1102.5718","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1102.5718","created_at":"2026-05-18T04:27:46Z"},{"alias_kind":"arxiv_version","alias_value":"1102.5718v1","created_at":"2026-05-18T04:27:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1102.5718","created_at":"2026-05-18T04:27:46Z"},{"alias_kind":"pith_short_12","alias_value":"O6N32AGGFIEB","created_at":"2026-05-18T12:26:37Z"},{"alias_kind":"pith_short_16","alias_value":"O6N32AGGFIEBDJ5L","created_at":"2026-05-18T12:26:37Z"},{"alias_kind":"pith_short_8","alias_value":"O6N32AGG","created_at":"2026-05-18T12:26:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:O6N32AGGFIEBDJ5LTKZ22EY2NV","target":"record","payload":{"canonical_record":{"source":{"id":"1102.5718","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-02-28T17:38:37Z","cross_cats_sorted":[],"title_canon_sha256":"bd1915502561782a49972273968e00ef162ade60ebd38216a0596d1184a7896b","abstract_canon_sha256":"abb2872ecd2b2f5a6472572222e490c1c9fec77558a7f64776e18c028d5e35d6"},"schema_version":"1.0"},"canonical_sha256":"779bbd00c62a0811a7ab9ab3ad131a6d4696c6b9d98df94445d140eea0cba4cc","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:27:46.162105Z","signature_b64":"gdMmbZAke4GQ1OGXge2NWdbof1Ls+E1ufqF2sAl7skatzA5mmjjHSSQrP1jvrpAxCVnLFOzW8iQQjmFodPD6BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"779bbd00c62a0811a7ab9ab3ad131a6d4696c6b9d98df94445d140eea0cba4cc","last_reissued_at":"2026-05-18T04:27:46.161584Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:27:46.161584Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1102.5718","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:27:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gQVXd9gkhfRUnxBdgfq8TS5hoNVGBhpPF7s1FChKPAF0Nk6X/PFn5jSIwmMT0zZuU/RJP2mZ3BK32KDM1olDBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-04T03:13:39.421773Z"},"content_sha256":"2af615d535125c3216206822250424868661a582cebca15e802dc5c2913ceb1a","schema_version":"1.0","event_id":"sha256:2af615d535125c3216206822250424868661a582cebca15e802dc5c2913ceb1a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:O6N32AGGFIEBDJ5LTKZ22EY2NV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The competition number of a graph in which any two holes share at most one edge","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jung Yeun Lee, Suh-Ryung Kim, Yoshio Sano","submitted_at":"2011-02-28T17:38:37Z","abstract_excerpt":"The competition graph of a digraph D is a (simple undirected) 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. In general, it is hard to compute the competition number k(G) for a graph G and it has been one of important research problems in the study of competition graphs to characterize "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1102.5718","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:27:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VjA1QAddXPM05Rs8qP6LPSqZ4I1vvUQNgGBPb3l5q5IBoC5YF/Mj4fI5nE+0tueBhqruKdyulAbBoMhKC+Y8Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-04T03:13:39.422126Z"},"content_sha256":"e5c4214d8c6adcf5f52ca36a086c822b6bb49225485c9e910ab1110cd23709b4","schema_version":"1.0","event_id":"sha256:e5c4214d8c6adcf5f52ca36a086c822b6bb49225485c9e910ab1110cd23709b4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/O6N32AGGFIEBDJ5LTKZ22EY2NV/bundle.json","state_url":"https://pith.science/pith/O6N32AGGFIEBDJ5LTKZ22EY2NV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/O6N32AGGFIEBDJ5LTKZ22EY2NV/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-04T03:13:39Z","links":{"resolver":"https://pith.science/pith/O6N32AGGFIEBDJ5LTKZ22EY2NV","bundle":"https://pith.science/pith/O6N32AGGFIEBDJ5LTKZ22EY2NV/bundle.json","state":"https://pith.science/pith/O6N32AGGFIEBDJ5LTKZ22EY2NV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/O6N32AGGFIEBDJ5LTKZ22EY2NV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:O6N32AGGFIEBDJ5LTKZ22EY2NV","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":"abb2872ecd2b2f5a6472572222e490c1c9fec77558a7f64776e18c028d5e35d6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-02-28T17:38:37Z","title_canon_sha256":"bd1915502561782a49972273968e00ef162ade60ebd38216a0596d1184a7896b"},"schema_version":"1.0","source":{"id":"1102.5718","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1102.5718","created_at":"2026-05-18T04:27:46Z"},{"alias_kind":"arxiv_version","alias_value":"1102.5718v1","created_at":"2026-05-18T04:27:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1102.5718","created_at":"2026-05-18T04:27:46Z"},{"alias_kind":"pith_short_12","alias_value":"O6N32AGGFIEB","created_at":"2026-05-18T12:26:37Z"},{"alias_kind":"pith_short_16","alias_value":"O6N32AGGFIEBDJ5L","created_at":"2026-05-18T12:26:37Z"},{"alias_kind":"pith_short_8","alias_value":"O6N32AGG","created_at":"2026-05-18T12:26:37Z"}],"graph_snapshots":[{"event_id":"sha256:e5c4214d8c6adcf5f52ca36a086c822b6bb49225485c9e910ab1110cd23709b4","target":"graph","created_at":"2026-05-18T04:27:46Z","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":"The competition graph of a digraph D is a (simple undirected) 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. In general, it is hard to compute the competition number k(G) for a graph G and it has been one of important research problems in the study of competition graphs to characterize ","authors_text":"Jung Yeun Lee, Suh-Ryung Kim, Yoshio Sano","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-02-28T17:38:37Z","title":"The competition number of a graph in which any two holes share at most one edge"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1102.5718","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:2af615d535125c3216206822250424868661a582cebca15e802dc5c2913ceb1a","target":"record","created_at":"2026-05-18T04:27:46Z","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":"abb2872ecd2b2f5a6472572222e490c1c9fec77558a7f64776e18c028d5e35d6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-02-28T17:38:37Z","title_canon_sha256":"bd1915502561782a49972273968e00ef162ade60ebd38216a0596d1184a7896b"},"schema_version":"1.0","source":{"id":"1102.5718","kind":"arxiv","version":1}},"canonical_sha256":"779bbd00c62a0811a7ab9ab3ad131a6d4696c6b9d98df94445d140eea0cba4cc","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"779bbd00c62a0811a7ab9ab3ad131a6d4696c6b9d98df94445d140eea0cba4cc","first_computed_at":"2026-05-18T04:27:46.161584Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:27:46.161584Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"gdMmbZAke4GQ1OGXge2NWdbof1Ls+E1ufqF2sAl7skatzA5mmjjHSSQrP1jvrpAxCVnLFOzW8iQQjmFodPD6BA==","signature_status":"signed_v1","signed_at":"2026-05-18T04:27:46.162105Z","signed_message":"canonical_sha256_bytes"},"source_id":"1102.5718","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2af615d535125c3216206822250424868661a582cebca15e802dc5c2913ceb1a","sha256:e5c4214d8c6adcf5f52ca36a086c822b6bb49225485c9e910ab1110cd23709b4"],"state_sha256":"2b1ed08f5456d4451dae6aa1cb684cf5bb3d4eda6808d957c47858af7b5dfca9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"I8c2FoaWSa6mmpXfweYuhQGfUuMZKj1j2N26zzajhcYlGdWaC6sUK0KdLpNd0jnaR16Q8IFDAp5mwisQVHyvCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-04T03:13:39.424335Z","bundle_sha256":"97d87b531dd17afbd02bf8638f31e138b5a04186027022f622e0cb0bd3d3b5a3"}}