{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:SD5AGF64GTPWYORA4EZ32SV7VA","short_pith_number":"pith:SD5AGF64","canonical_record":{"source":{"id":"1110.2933","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-10-13T13:21:31Z","cross_cats_sorted":[],"title_canon_sha256":"903f47ae4c0c4d9e1e4e6e260595ae8e191fe3715691bd33933e1f3659756c23","abstract_canon_sha256":"5d64e5d64908f4dd5ec21802570b3dfea71720386739daf8f35de25eb67cee7f"},"schema_version":"1.0"},"canonical_sha256":"90fa0317dc34df6c3a20e133bd4abfa829d355a019c1bc9f1a4614736a7c0d6d","source":{"kind":"arxiv","id":"1110.2933","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1110.2933","created_at":"2026-05-18T03:09:23Z"},{"alias_kind":"arxiv_version","alias_value":"1110.2933v3","created_at":"2026-05-18T03:09:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1110.2933","created_at":"2026-05-18T03:09:23Z"},{"alias_kind":"pith_short_12","alias_value":"SD5AGF64GTPW","created_at":"2026-05-18T12:26:41Z"},{"alias_kind":"pith_short_16","alias_value":"SD5AGF64GTPWYORA","created_at":"2026-05-18T12:26:41Z"},{"alias_kind":"pith_short_8","alias_value":"SD5AGF64","created_at":"2026-05-18T12:26:41Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:SD5AGF64GTPWYORA4EZ32SV7VA","target":"record","payload":{"canonical_record":{"source":{"id":"1110.2933","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-10-13T13:21:31Z","cross_cats_sorted":[],"title_canon_sha256":"903f47ae4c0c4d9e1e4e6e260595ae8e191fe3715691bd33933e1f3659756c23","abstract_canon_sha256":"5d64e5d64908f4dd5ec21802570b3dfea71720386739daf8f35de25eb67cee7f"},"schema_version":"1.0"},"canonical_sha256":"90fa0317dc34df6c3a20e133bd4abfa829d355a019c1bc9f1a4614736a7c0d6d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:09:23.189484Z","signature_b64":"4iLSLRCa2XVMEgkL4fhisW6sJBY5eh3EyFQ8UdFH6iUVZpV1+NRnvbZyaOgdiAPBq9Qq85fi+rnz+i6aBoRNCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"90fa0317dc34df6c3a20e133bd4abfa829d355a019c1bc9f1a4614736a7c0d6d","last_reissued_at":"2026-05-18T03:09:23.188750Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:09:23.188750Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1110.2933","source_version":3,"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:09:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"izEo2oIOEnzbGhEpCQnLoXmmHKegWINKIzfbTyDWIJZ0XTEXRDa5WFcVqvEhLg9FEjAx0yNybLyjYSQi+0u6Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-30T08:12:04.489177Z"},"content_sha256":"3318c0a8e2d98f09506748d740f26a87c9b49ebc4752c0d70a5c5485878dd7ce","schema_version":"1.0","event_id":"sha256:3318c0a8e2d98f09506748d740f26a87c9b49ebc4752c0d70a5c5485878dd7ce"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:SD5AGF64GTPWYORA4EZ32SV7VA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Competition Numbers, Quasi-Line Graphs and Holes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Brendan D. McKay, Pascal Schweitzer, Patrick Schweitzer","submitted_at":"2011-10-13T13:21:31Z","abstract_excerpt":"The competition graph of a directed acyclic graph D is the undirected graph on the same vertex set as D in which two distinct vertices are adjacent if they have a common out-neighbor in D. The competition number of an undirected graph G is the least number of isolated vertices that have to be added to G to make it the competition graph of a directed acyclic graph. We resolve two conjectures concerning competition graphs. First we prove a conjecture of Opsut by showing that the competition number of every quasi-line graph is at most 2. Recall that a quasi-line graph, also called a locally co-bi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1110.2933","kind":"arxiv","version":3},"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:09:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EUayxpXVFSZNvwKSKnodq1kO0BUnjAYfYZiS9xhu0LHX10EbHD3oG3W4d0YgoDFB9dUI6lffSYoP7qVBxdc9Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-30T08:12:04.489533Z"},"content_sha256":"214a77ed6b23e59f6236542598852badd373c66efd865d7d8f8f147d227bd077","schema_version":"1.0","event_id":"sha256:214a77ed6b23e59f6236542598852badd373c66efd865d7d8f8f147d227bd077"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SD5AGF64GTPWYORA4EZ32SV7VA/bundle.json","state_url":"https://pith.science/pith/SD5AGF64GTPWYORA4EZ32SV7VA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SD5AGF64GTPWYORA4EZ32SV7VA/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-30T08:12:04Z","links":{"resolver":"https://pith.science/pith/SD5AGF64GTPWYORA4EZ32SV7VA","bundle":"https://pith.science/pith/SD5AGF64GTPWYORA4EZ32SV7VA/bundle.json","state":"https://pith.science/pith/SD5AGF64GTPWYORA4EZ32SV7VA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SD5AGF64GTPWYORA4EZ32SV7VA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:SD5AGF64GTPWYORA4EZ32SV7VA","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":"5d64e5d64908f4dd5ec21802570b3dfea71720386739daf8f35de25eb67cee7f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-10-13T13:21:31Z","title_canon_sha256":"903f47ae4c0c4d9e1e4e6e260595ae8e191fe3715691bd33933e1f3659756c23"},"schema_version":"1.0","source":{"id":"1110.2933","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1110.2933","created_at":"2026-05-18T03:09:23Z"},{"alias_kind":"arxiv_version","alias_value":"1110.2933v3","created_at":"2026-05-18T03:09:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1110.2933","created_at":"2026-05-18T03:09:23Z"},{"alias_kind":"pith_short_12","alias_value":"SD5AGF64GTPW","created_at":"2026-05-18T12:26:41Z"},{"alias_kind":"pith_short_16","alias_value":"SD5AGF64GTPWYORA","created_at":"2026-05-18T12:26:41Z"},{"alias_kind":"pith_short_8","alias_value":"SD5AGF64","created_at":"2026-05-18T12:26:41Z"}],"graph_snapshots":[{"event_id":"sha256:214a77ed6b23e59f6236542598852badd373c66efd865d7d8f8f147d227bd077","target":"graph","created_at":"2026-05-18T03:09:23Z","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 directed acyclic graph D is the undirected graph on the same vertex set as D in which two distinct vertices are adjacent if they have a common out-neighbor in D. The competition number of an undirected graph G is the least number of isolated vertices that have to be added to G to make it the competition graph of a directed acyclic graph. We resolve two conjectures concerning competition graphs. First we prove a conjecture of Opsut by showing that the competition number of every quasi-line graph is at most 2. Recall that a quasi-line graph, also called a locally co-bi","authors_text":"Brendan D. McKay, Pascal Schweitzer, Patrick Schweitzer","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-10-13T13:21:31Z","title":"Competition Numbers, Quasi-Line Graphs and Holes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1110.2933","kind":"arxiv","version":3},"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:3318c0a8e2d98f09506748d740f26a87c9b49ebc4752c0d70a5c5485878dd7ce","target":"record","created_at":"2026-05-18T03:09:23Z","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":"5d64e5d64908f4dd5ec21802570b3dfea71720386739daf8f35de25eb67cee7f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-10-13T13:21:31Z","title_canon_sha256":"903f47ae4c0c4d9e1e4e6e260595ae8e191fe3715691bd33933e1f3659756c23"},"schema_version":"1.0","source":{"id":"1110.2933","kind":"arxiv","version":3}},"canonical_sha256":"90fa0317dc34df6c3a20e133bd4abfa829d355a019c1bc9f1a4614736a7c0d6d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"90fa0317dc34df6c3a20e133bd4abfa829d355a019c1bc9f1a4614736a7c0d6d","first_computed_at":"2026-05-18T03:09:23.188750Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:09:23.188750Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"4iLSLRCa2XVMEgkL4fhisW6sJBY5eh3EyFQ8UdFH6iUVZpV1+NRnvbZyaOgdiAPBq9Qq85fi+rnz+i6aBoRNCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:09:23.189484Z","signed_message":"canonical_sha256_bytes"},"source_id":"1110.2933","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3318c0a8e2d98f09506748d740f26a87c9b49ebc4752c0d70a5c5485878dd7ce","sha256:214a77ed6b23e59f6236542598852badd373c66efd865d7d8f8f147d227bd077"],"state_sha256":"36c5114a51b32a5695bbc390a15d4f9f3d0631461a232e3b74f87b40bf7698c6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PbcOaKG6k8C0ah0TvTL2D/mwiOFV7AJgSSIVyTlXK6/aX2PLItvWONg20kHbCfaEuyqjl4xDMXV/rbWeijhCBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-30T08:12:04.491373Z","bundle_sha256":"0057482f6c1d9cfb8a35e1c1f5b3e94c618533a8e2148179835aa8c1854afb7b"}}