{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:OMQYA5BJ6LSRR64WKLMCVFDHIM","short_pith_number":"pith:OMQYA5BJ","canonical_record":{"source":{"id":"1112.6203","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-12-28T23:29:26Z","cross_cats_sorted":[],"title_canon_sha256":"7a41cb7a390d3cc068f0fcc7fdddd692442d30abce4226e3a2f0c9694c19fe12","abstract_canon_sha256":"efe0ddc65af6f549b18696bb52a474082792797159e5153ae3bfdb6ef9dc0902"},"schema_version":"1.0"},"canonical_sha256":"7321807429f2e518fb9652d82a946743346e6a031838b182610407049c6f0c62","source":{"kind":"arxiv","id":"1112.6203","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1112.6203","created_at":"2026-05-18T03:03:57Z"},{"alias_kind":"arxiv_version","alias_value":"1112.6203v2","created_at":"2026-05-18T03:03:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1112.6203","created_at":"2026-05-18T03:03:57Z"},{"alias_kind":"pith_short_12","alias_value":"OMQYA5BJ6LSR","created_at":"2026-05-18T12:26:37Z"},{"alias_kind":"pith_short_16","alias_value":"OMQYA5BJ6LSRR64W","created_at":"2026-05-18T12:26:37Z"},{"alias_kind":"pith_short_8","alias_value":"OMQYA5BJ","created_at":"2026-05-18T12:26:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:OMQYA5BJ6LSRR64WKLMCVFDHIM","target":"record","payload":{"canonical_record":{"source":{"id":"1112.6203","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-12-28T23:29:26Z","cross_cats_sorted":[],"title_canon_sha256":"7a41cb7a390d3cc068f0fcc7fdddd692442d30abce4226e3a2f0c9694c19fe12","abstract_canon_sha256":"efe0ddc65af6f549b18696bb52a474082792797159e5153ae3bfdb6ef9dc0902"},"schema_version":"1.0"},"canonical_sha256":"7321807429f2e518fb9652d82a946743346e6a031838b182610407049c6f0c62","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:03:57.087520Z","signature_b64":"IKYlkJqUcmzZMqDWTmyTQ+HqHgpL0a7f2KtgGqzNXNXOijv9K3/WGMTemoFKdWxdahzUmjq730BXhfPHEL/iCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7321807429f2e518fb9652d82a946743346e6a031838b182610407049c6f0c62","last_reissued_at":"2026-05-18T03:03:57.086632Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:03:57.086632Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1112.6203","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-18T03:03:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vnDCB0+GKyJD/0+jWF5+Y2iYE9QLEx3lwf+DjfJ4EysgRjzy8H1Qd0jKW4CVLcz6E1v3qwwmueENDPPbBdKmCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-03T22:57:56.809886Z"},"content_sha256":"4622d6168f8cd19273482c746e162722c5951a5aa0f061e1f8fb9bb2a7636fec","schema_version":"1.0","event_id":"sha256:4622d6168f8cd19273482c746e162722c5951a5aa0f061e1f8fb9bb2a7636fec"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:OMQYA5BJ6LSRR64WKLMCVFDHIM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Competitively tight graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Boram Park, Jung Yeun Lee, Suh-Ryung Kim, Yoshio Sano","submitted_at":"2011-12-28T23:29:26Z","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 two distinct vertices $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 a graph $G$ is the smallest number of such isolated vertices. Computing the competition number of a graph is an NP-hard problem in general and has been one of the important research pr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1112.6203","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-18T03:03:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gDj5tVj0RT3PzHcjjwCjaoqLJ7Lww503ryZPyyziv6edEXq6REPupHJ8qrhXAJa2c9BbZveraqI1oILx2LTADg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-03T22:57:56.810346Z"},"content_sha256":"00f4621d1a5990db29695cad18374d75e5e2e9436fc278d4637dc66a9364dbc8","schema_version":"1.0","event_id":"sha256:00f4621d1a5990db29695cad18374d75e5e2e9436fc278d4637dc66a9364dbc8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OMQYA5BJ6LSRR64WKLMCVFDHIM/bundle.json","state_url":"https://pith.science/pith/OMQYA5BJ6LSRR64WKLMCVFDHIM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OMQYA5BJ6LSRR64WKLMCVFDHIM/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-03T22:57:56Z","links":{"resolver":"https://pith.science/pith/OMQYA5BJ6LSRR64WKLMCVFDHIM","bundle":"https://pith.science/pith/OMQYA5BJ6LSRR64WKLMCVFDHIM/bundle.json","state":"https://pith.science/pith/OMQYA5BJ6LSRR64WKLMCVFDHIM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OMQYA5BJ6LSRR64WKLMCVFDHIM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:OMQYA5BJ6LSRR64WKLMCVFDHIM","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":"efe0ddc65af6f549b18696bb52a474082792797159e5153ae3bfdb6ef9dc0902","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-12-28T23:29:26Z","title_canon_sha256":"7a41cb7a390d3cc068f0fcc7fdddd692442d30abce4226e3a2f0c9694c19fe12"},"schema_version":"1.0","source":{"id":"1112.6203","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1112.6203","created_at":"2026-05-18T03:03:57Z"},{"alias_kind":"arxiv_version","alias_value":"1112.6203v2","created_at":"2026-05-18T03:03:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1112.6203","created_at":"2026-05-18T03:03:57Z"},{"alias_kind":"pith_short_12","alias_value":"OMQYA5BJ6LSR","created_at":"2026-05-18T12:26:37Z"},{"alias_kind":"pith_short_16","alias_value":"OMQYA5BJ6LSRR64W","created_at":"2026-05-18T12:26:37Z"},{"alias_kind":"pith_short_8","alias_value":"OMQYA5BJ","created_at":"2026-05-18T12:26:37Z"}],"graph_snapshots":[{"event_id":"sha256:00f4621d1a5990db29695cad18374d75e5e2e9436fc278d4637dc66a9364dbc8","target":"graph","created_at":"2026-05-18T03:03:57Z","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 two distinct vertices $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 a graph $G$ is the smallest number of such isolated vertices. Computing the competition number of a graph is an NP-hard problem in general and has been one of the important research pr","authors_text":"Boram Park, 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-12-28T23:29:26Z","title":"Competitively tight graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1112.6203","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:4622d6168f8cd19273482c746e162722c5951a5aa0f061e1f8fb9bb2a7636fec","target":"record","created_at":"2026-05-18T03:03:57Z","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":"efe0ddc65af6f549b18696bb52a474082792797159e5153ae3bfdb6ef9dc0902","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-12-28T23:29:26Z","title_canon_sha256":"7a41cb7a390d3cc068f0fcc7fdddd692442d30abce4226e3a2f0c9694c19fe12"},"schema_version":"1.0","source":{"id":"1112.6203","kind":"arxiv","version":2}},"canonical_sha256":"7321807429f2e518fb9652d82a946743346e6a031838b182610407049c6f0c62","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7321807429f2e518fb9652d82a946743346e6a031838b182610407049c6f0c62","first_computed_at":"2026-05-18T03:03:57.086632Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:03:57.086632Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"IKYlkJqUcmzZMqDWTmyTQ+HqHgpL0a7f2KtgGqzNXNXOijv9K3/WGMTemoFKdWxdahzUmjq730BXhfPHEL/iCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:03:57.087520Z","signed_message":"canonical_sha256_bytes"},"source_id":"1112.6203","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4622d6168f8cd19273482c746e162722c5951a5aa0f061e1f8fb9bb2a7636fec","sha256:00f4621d1a5990db29695cad18374d75e5e2e9436fc278d4637dc66a9364dbc8"],"state_sha256":"b5162387211ea117c1c8d3d384a4a2d97542b1670caa79033846e7e9061d713e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/ngnEl8JrHAiJYJlJQNsQjzZ8YzvlfYiuSkg7rjfwKMZtfnK0eICuKk7aUYtklVbu5YHOpK6hBeTW5HDbX6DDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-03T22:57:56.812384Z","bundle_sha256":"f389e8d4ffd7e4086a245981ca43205c29a5ff53a149ea3e3bbc94120a6143ce"}}