{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:Y2YIITCLJTX47QESHJNGRLDUGK","short_pith_number":"pith:Y2YIITCL","canonical_record":{"source":{"id":"1205.4322","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-05-19T12:22:27Z","cross_cats_sorted":[],"title_canon_sha256":"f0b02577bdd2244bd4df93c632d7af4d5a7e781b2f7f66aa71fcec07f4e0a08b","abstract_canon_sha256":"46f63ddf475a1bf8d6d073022270199db46cb426811d9a7f3acb1551efcdb06f"},"schema_version":"1.0"},"canonical_sha256":"c6b0844c4b4cefcfc0923a5a68ac743286abb228d868a8b65000f4c1eb1f62af","source":{"kind":"arxiv","id":"1205.4322","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1205.4322","created_at":"2026-05-18T03:09:22Z"},{"alias_kind":"arxiv_version","alias_value":"1205.4322v1","created_at":"2026-05-18T03:09:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1205.4322","created_at":"2026-05-18T03:09:22Z"},{"alias_kind":"pith_short_12","alias_value":"Y2YIITCLJTX4","created_at":"2026-05-18T12:27:27Z"},{"alias_kind":"pith_short_16","alias_value":"Y2YIITCLJTX47QES","created_at":"2026-05-18T12:27:27Z"},{"alias_kind":"pith_short_8","alias_value":"Y2YIITCL","created_at":"2026-05-18T12:27:27Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:Y2YIITCLJTX47QESHJNGRLDUGK","target":"record","payload":{"canonical_record":{"source":{"id":"1205.4322","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-05-19T12:22:27Z","cross_cats_sorted":[],"title_canon_sha256":"f0b02577bdd2244bd4df93c632d7af4d5a7e781b2f7f66aa71fcec07f4e0a08b","abstract_canon_sha256":"46f63ddf475a1bf8d6d073022270199db46cb426811d9a7f3acb1551efcdb06f"},"schema_version":"1.0"},"canonical_sha256":"c6b0844c4b4cefcfc0923a5a68ac743286abb228d868a8b65000f4c1eb1f62af","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:09:22.903147Z","signature_b64":"9z4KBM+//EGNnXaRKc/DT3OutVF4rcQZZ0hLtWh4FrhiXo5AmSCjgAi7skEm0jCuyt2wzavOBu8wtxU/F0J3BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c6b0844c4b4cefcfc0923a5a68ac743286abb228d868a8b65000f4c1eb1f62af","last_reissued_at":"2026-05-18T03:09:22.902270Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:09:22.902270Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1205.4322","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-18T03:09:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eg3BuGV9E5OyWS7iE0C16ernsIt7gJM+Wt8q9SfMZXPiDoPnuYGKobhhZSqZWVK8M/12BnsR40gROQsNK5dMAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-04T02:36:07.609241Z"},"content_sha256":"7056ac1279627a3c91afdf1187576c3d477acf9e32cd093c3747f356c44a4407","schema_version":"1.0","event_id":"sha256:7056ac1279627a3c91afdf1187576c3d477acf9e32cd093c3747f356c44a4407"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:Y2YIITCLJTX47QESHJNGRLDUGK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A generalization of Opsut's lower bounds for the competition number of a graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Yoshio Sano","submitted_at":"2012-05-19T12:22:27Z","abstract_excerpt":"The notion of a competition graph was introduced by J. E. Cohen in 1968. The competition graph C(D) 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. In 1978, F. S. Roberts defined the competition number k(G) of a graph G as the minimum number of such isolated vertices. In general, it is hard to compute the "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1205.4322","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-18T03:09:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pSKvd/IVmKKfTUAl0MDAvY9WFgWZQbRufzllZOv0vuRo3WqQjLGtuhvuyuVYMzldTZMr0QsVXGxivI468XxrCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-04T02:36:07.609637Z"},"content_sha256":"9fc4debd6f8b7c1c549c619c9f61bc9ec748efc5923ac29b81f576711ba0e9f0","schema_version":"1.0","event_id":"sha256:9fc4debd6f8b7c1c549c619c9f61bc9ec748efc5923ac29b81f576711ba0e9f0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/Y2YIITCLJTX47QESHJNGRLDUGK/bundle.json","state_url":"https://pith.science/pith/Y2YIITCLJTX47QESHJNGRLDUGK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/Y2YIITCLJTX47QESHJNGRLDUGK/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-04T02:36:07Z","links":{"resolver":"https://pith.science/pith/Y2YIITCLJTX47QESHJNGRLDUGK","bundle":"https://pith.science/pith/Y2YIITCLJTX47QESHJNGRLDUGK/bundle.json","state":"https://pith.science/pith/Y2YIITCLJTX47QESHJNGRLDUGK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/Y2YIITCLJTX47QESHJNGRLDUGK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:Y2YIITCLJTX47QESHJNGRLDUGK","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":"46f63ddf475a1bf8d6d073022270199db46cb426811d9a7f3acb1551efcdb06f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-05-19T12:22:27Z","title_canon_sha256":"f0b02577bdd2244bd4df93c632d7af4d5a7e781b2f7f66aa71fcec07f4e0a08b"},"schema_version":"1.0","source":{"id":"1205.4322","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1205.4322","created_at":"2026-05-18T03:09:22Z"},{"alias_kind":"arxiv_version","alias_value":"1205.4322v1","created_at":"2026-05-18T03:09:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1205.4322","created_at":"2026-05-18T03:09:22Z"},{"alias_kind":"pith_short_12","alias_value":"Y2YIITCLJTX4","created_at":"2026-05-18T12:27:27Z"},{"alias_kind":"pith_short_16","alias_value":"Y2YIITCLJTX47QES","created_at":"2026-05-18T12:27:27Z"},{"alias_kind":"pith_short_8","alias_value":"Y2YIITCL","created_at":"2026-05-18T12:27:27Z"}],"graph_snapshots":[{"event_id":"sha256:9fc4debd6f8b7c1c549c619c9f61bc9ec748efc5923ac29b81f576711ba0e9f0","target":"graph","created_at":"2026-05-18T03:09:22Z","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 notion of a competition graph was introduced by J. E. Cohen in 1968. The competition graph C(D) 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. In 1978, F. S. Roberts defined the competition number k(G) of a graph G as the minimum number of such isolated vertices. In general, it is hard to compute the ","authors_text":"Yoshio Sano","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-05-19T12:22:27Z","title":"A generalization of Opsut's lower bounds for the competition number of a graph"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1205.4322","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:7056ac1279627a3c91afdf1187576c3d477acf9e32cd093c3747f356c44a4407","target":"record","created_at":"2026-05-18T03:09:22Z","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":"46f63ddf475a1bf8d6d073022270199db46cb426811d9a7f3acb1551efcdb06f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-05-19T12:22:27Z","title_canon_sha256":"f0b02577bdd2244bd4df93c632d7af4d5a7e781b2f7f66aa71fcec07f4e0a08b"},"schema_version":"1.0","source":{"id":"1205.4322","kind":"arxiv","version":1}},"canonical_sha256":"c6b0844c4b4cefcfc0923a5a68ac743286abb228d868a8b65000f4c1eb1f62af","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c6b0844c4b4cefcfc0923a5a68ac743286abb228d868a8b65000f4c1eb1f62af","first_computed_at":"2026-05-18T03:09:22.902270Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:09:22.902270Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"9z4KBM+//EGNnXaRKc/DT3OutVF4rcQZZ0hLtWh4FrhiXo5AmSCjgAi7skEm0jCuyt2wzavOBu8wtxU/F0J3BA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:09:22.903147Z","signed_message":"canonical_sha256_bytes"},"source_id":"1205.4322","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7056ac1279627a3c91afdf1187576c3d477acf9e32cd093c3747f356c44a4407","sha256:9fc4debd6f8b7c1c549c619c9f61bc9ec748efc5923ac29b81f576711ba0e9f0"],"state_sha256":"59512f260ab7e09d5854b234d209d5148c9edec5d252b304fb7d52deddda4aae"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Rc0XfBroTaZNEYPZSi8/r1hKR4kQlP/nh0RZLYCbDxl7gfDiH9KtRPPxCWeBacjTr1J5pyVeDaLaSHXoiNAUAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-04T02:36:07.611891Z","bundle_sha256":"2ae4ab3edc29b234053ec35536c551dcf155a10674ac0e9dfaea39c23291d367"}}