{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:PUTO736D6SKSDOKSLDRPEQRL25","short_pith_number":"pith:PUTO736D","schema_version":"1.0","canonical_sha256":"7d26efefc3f49521b95258e2f2422bd76916250257a95f57e30109c641fcfec0","source":{"kind":"arxiv","id":"1006.2628","version":2},"attestation_state":"computed","paper":{"title":"The competition numbers of ternary Hamming graphs","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-06-14T08:14:00Z","abstract_excerpt":"It is known to be a hard problem to compute the competition number k(G) of a graph G in general. Park and Sano [13] gave the exact values of the competition numbers of Hamming graphs H(n,q) if $1 \\leq n \\leq 3$ or $1 \\leq q \\leq 2$. In this paper, we give an explicit formula of the competition numbers of ternary Hamming graphs."},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1006.2628","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-06-14T08:14:00Z","cross_cats_sorted":[],"title_canon_sha256":"deb252c214857e10831f045b27f9cd8ea1d7489ddff8b25226af98aad7d06557","abstract_canon_sha256":"c2119ca924896d7eed3ba038ad61e175820f7e97d102e856694173f99897b7d9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:22:02.380338Z","signature_b64":"byqgfu3sjUz6cJPm/Aa1A4eSEbRklRngC1dDaZP6B3iFt7qQaUhhekBzPGHw4oEws1MOBhJJ8m9og/XN3xxrCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7d26efefc3f49521b95258e2f2422bd76916250257a95f57e30109c641fcfec0","last_reissued_at":"2026-05-18T04:22:02.379878Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:22:02.379878Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The competition numbers of ternary Hamming graphs","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-06-14T08:14:00Z","abstract_excerpt":"It is known to be a hard problem to compute the competition number k(G) of a graph G in general. Park and Sano [13] gave the exact values of the competition numbers of Hamming graphs H(n,q) if $1 \\leq n \\leq 3$ or $1 \\leq q \\leq 2$. In this paper, we give an explicit formula of the competition numbers of ternary Hamming graphs."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1006.2628","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1006.2628","created_at":"2026-05-18T04:22:02.379963+00:00"},{"alias_kind":"arxiv_version","alias_value":"1006.2628v2","created_at":"2026-05-18T04:22:02.379963+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1006.2628","created_at":"2026-05-18T04:22:02.379963+00:00"},{"alias_kind":"pith_short_12","alias_value":"PUTO736D6SKS","created_at":"2026-05-18T12:26:12.377268+00:00"},{"alias_kind":"pith_short_16","alias_value":"PUTO736D6SKSDOKS","created_at":"2026-05-18T12:26:12.377268+00:00"},{"alias_kind":"pith_short_8","alias_value":"PUTO736D","created_at":"2026-05-18T12:26:12.377268+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/PUTO736D6SKSDOKSLDRPEQRL25","json":"https://pith.science/pith/PUTO736D6SKSDOKSLDRPEQRL25.json","graph_json":"https://pith.science/api/pith-number/PUTO736D6SKSDOKSLDRPEQRL25/graph.json","events_json":"https://pith.science/api/pith-number/PUTO736D6SKSDOKSLDRPEQRL25/events.json","paper":"https://pith.science/paper/PUTO736D"},"agent_actions":{"view_html":"https://pith.science/pith/PUTO736D6SKSDOKSLDRPEQRL25","download_json":"https://pith.science/pith/PUTO736D6SKSDOKSLDRPEQRL25.json","view_paper":"https://pith.science/paper/PUTO736D","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1006.2628&json=true","fetch_graph":"https://pith.science/api/pith-number/PUTO736D6SKSDOKSLDRPEQRL25/graph.json","fetch_events":"https://pith.science/api/pith-number/PUTO736D6SKSDOKSLDRPEQRL25/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PUTO736D6SKSDOKSLDRPEQRL25/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PUTO736D6SKSDOKSLDRPEQRL25/action/storage_attestation","attest_author":"https://pith.science/pith/PUTO736D6SKSDOKSLDRPEQRL25/action/author_attestation","sign_citation":"https://pith.science/pith/PUTO736D6SKSDOKSLDRPEQRL25/action/citation_signature","submit_replication":"https://pith.science/pith/PUTO736D6SKSDOKSLDRPEQRL25/action/replication_record"}},"created_at":"2026-05-18T04:22:02.379963+00:00","updated_at":"2026-05-18T04:22:02.379963+00:00"}