{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:3LM6COTFDGBEFXU6YJHZXPQWT7","short_pith_number":"pith:3LM6COTF","canonical_record":{"source":{"id":"1011.2591","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-11-11T08:34:48Z","cross_cats_sorted":[],"title_canon_sha256":"f1985f91a34b6a6c3e58fee1720b7d771b18fbe1367af0abca0397fcfe2b94fc","abstract_canon_sha256":"65b49f6f88593f07938397d1ab2e3542db0d4ca43ba10a2d247abbdcaa07b483"},"schema_version":"1.0"},"canonical_sha256":"dad9e13a65198242de9ec24f9bbe169fd55f869d8a23d380bb44f7c3a5cbc281","source":{"kind":"arxiv","id":"1011.2591","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1011.2591","created_at":"2026-05-18T04:19:23Z"},{"alias_kind":"arxiv_version","alias_value":"1011.2591v1","created_at":"2026-05-18T04:19:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1011.2591","created_at":"2026-05-18T04:19:23Z"},{"alias_kind":"pith_short_12","alias_value":"3LM6COTFDGBE","created_at":"2026-05-18T12:26:03Z"},{"alias_kind":"pith_short_16","alias_value":"3LM6COTFDGBEFXU6","created_at":"2026-05-18T12:26:03Z"},{"alias_kind":"pith_short_8","alias_value":"3LM6COTF","created_at":"2026-05-18T12:26:03Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:3LM6COTFDGBEFXU6YJHZXPQWT7","target":"record","payload":{"canonical_record":{"source":{"id":"1011.2591","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-11-11T08:34:48Z","cross_cats_sorted":[],"title_canon_sha256":"f1985f91a34b6a6c3e58fee1720b7d771b18fbe1367af0abca0397fcfe2b94fc","abstract_canon_sha256":"65b49f6f88593f07938397d1ab2e3542db0d4ca43ba10a2d247abbdcaa07b483"},"schema_version":"1.0"},"canonical_sha256":"dad9e13a65198242de9ec24f9bbe169fd55f869d8a23d380bb44f7c3a5cbc281","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:19:23.108426Z","signature_b64":"QNHd7u5uOsPlAkcayvTvjcBrkLWEpmXMauO3gHYpW6kBQWKFtJJE2xkrMaKK8+8ehFXGB5ulcbyA0GAJlUdmAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dad9e13a65198242de9ec24f9bbe169fd55f869d8a23d380bb44f7c3a5cbc281","last_reissued_at":"2026-05-18T04:19:23.107841Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:19:23.107841Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1011.2591","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:19:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1gtZ4erFwDOP9JXtxCUK1T54R/nupDjMNx5sQbUAeMUjGA6CqBoP/dnUhDA5eC8wJ7oGG/EvILFUob+9+P/BAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-04T02:36:02.412384Z"},"content_sha256":"8aebd4a7cf64aad51dc94c7ac5b3608301f4ee4b1b8976540f8926a0d76731fe","schema_version":"1.0","event_id":"sha256:8aebd4a7cf64aad51dc94c7ac5b3608301f4ee4b1b8976540f8926a0d76731fe"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:3LM6COTFDGBEFXU6YJHZXPQWT7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The competition numbers of Hamming graphs with diameter at most three","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Boram Park, Yoshio Sano","submitted_at":"2010-11-11T08:34:48Z","abstract_excerpt":"The competition graph of a digraph 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 a graph G is defined to be 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. In this paper"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1011.2591","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:19:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gpdSm595J96Kz4hHO+uKMrNH3h1ZCkiuw3v2ZLH813M5f9Nwb7ZaDxbAsKUPcl4E3ar/Sx6KANdeUCAfJujhAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-04T02:36:02.412738Z"},"content_sha256":"2873139b8db17fec6bf6cd136ee9f1023e98bad8bcedb5772f5721403b1124f0","schema_version":"1.0","event_id":"sha256:2873139b8db17fec6bf6cd136ee9f1023e98bad8bcedb5772f5721403b1124f0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3LM6COTFDGBEFXU6YJHZXPQWT7/bundle.json","state_url":"https://pith.science/pith/3LM6COTFDGBEFXU6YJHZXPQWT7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3LM6COTFDGBEFXU6YJHZXPQWT7/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:02Z","links":{"resolver":"https://pith.science/pith/3LM6COTFDGBEFXU6YJHZXPQWT7","bundle":"https://pith.science/pith/3LM6COTFDGBEFXU6YJHZXPQWT7/bundle.json","state":"https://pith.science/pith/3LM6COTFDGBEFXU6YJHZXPQWT7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3LM6COTFDGBEFXU6YJHZXPQWT7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:3LM6COTFDGBEFXU6YJHZXPQWT7","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":"65b49f6f88593f07938397d1ab2e3542db0d4ca43ba10a2d247abbdcaa07b483","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-11-11T08:34:48Z","title_canon_sha256":"f1985f91a34b6a6c3e58fee1720b7d771b18fbe1367af0abca0397fcfe2b94fc"},"schema_version":"1.0","source":{"id":"1011.2591","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1011.2591","created_at":"2026-05-18T04:19:23Z"},{"alias_kind":"arxiv_version","alias_value":"1011.2591v1","created_at":"2026-05-18T04:19:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1011.2591","created_at":"2026-05-18T04:19:23Z"},{"alias_kind":"pith_short_12","alias_value":"3LM6COTFDGBE","created_at":"2026-05-18T12:26:03Z"},{"alias_kind":"pith_short_16","alias_value":"3LM6COTFDGBEFXU6","created_at":"2026-05-18T12:26:03Z"},{"alias_kind":"pith_short_8","alias_value":"3LM6COTF","created_at":"2026-05-18T12:26:03Z"}],"graph_snapshots":[{"event_id":"sha256:2873139b8db17fec6bf6cd136ee9f1023e98bad8bcedb5772f5721403b1124f0","target":"graph","created_at":"2026-05-18T04:19: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 digraph 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 a graph G is defined to be 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. In this paper","authors_text":"Boram Park, Yoshio Sano","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-11-11T08:34:48Z","title":"The competition numbers of Hamming graphs with diameter at most three"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1011.2591","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:8aebd4a7cf64aad51dc94c7ac5b3608301f4ee4b1b8976540f8926a0d76731fe","target":"record","created_at":"2026-05-18T04:19: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":"65b49f6f88593f07938397d1ab2e3542db0d4ca43ba10a2d247abbdcaa07b483","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-11-11T08:34:48Z","title_canon_sha256":"f1985f91a34b6a6c3e58fee1720b7d771b18fbe1367af0abca0397fcfe2b94fc"},"schema_version":"1.0","source":{"id":"1011.2591","kind":"arxiv","version":1}},"canonical_sha256":"dad9e13a65198242de9ec24f9bbe169fd55f869d8a23d380bb44f7c3a5cbc281","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"dad9e13a65198242de9ec24f9bbe169fd55f869d8a23d380bb44f7c3a5cbc281","first_computed_at":"2026-05-18T04:19:23.107841Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:19:23.107841Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"QNHd7u5uOsPlAkcayvTvjcBrkLWEpmXMauO3gHYpW6kBQWKFtJJE2xkrMaKK8+8ehFXGB5ulcbyA0GAJlUdmAA==","signature_status":"signed_v1","signed_at":"2026-05-18T04:19:23.108426Z","signed_message":"canonical_sha256_bytes"},"source_id":"1011.2591","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8aebd4a7cf64aad51dc94c7ac5b3608301f4ee4b1b8976540f8926a0d76731fe","sha256:2873139b8db17fec6bf6cd136ee9f1023e98bad8bcedb5772f5721403b1124f0"],"state_sha256":"e7931e074961bd865f811aa783baf934f7e7b9abf24aea8e1e73e97f8d3fa5ba"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"x4bCgG7r3eAFtfSxij+w3DrLLq1p62m2XNSkD8ni0+OsKi7zpqDWKgl+y3JV6hqW9UW0v9Il+Tq4rl3ms94DCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-04T02:36:02.414838Z","bundle_sha256":"b61e5111d2144a91ad72b79aa1099e791a258535360229b907ee785a2ec8b044"}}