{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:QI6MPWPJIZJYNK5LQIQZP6JOV4","short_pith_number":"pith:QI6MPWPJ","canonical_record":{"source":{"id":"1206.3596","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-06-15T21:02:07Z","cross_cats_sorted":[],"title_canon_sha256":"160938fdc07230bec752ea3028f8de9dbf436cd59cda726115a7d706513c3318","abstract_canon_sha256":"fb551fae6b3ad5ce90c22f935024a3127ed0a2bd278f6828dc06d321b2d989b4"},"schema_version":"1.0"},"canonical_sha256":"823cc7d9e9465386abab822197f92eaf032fccf85888438dc8f9b40413f6cae1","source":{"kind":"arxiv","id":"1206.3596","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1206.3596","created_at":"2026-05-18T03:53:19Z"},{"alias_kind":"arxiv_version","alias_value":"1206.3596v1","created_at":"2026-05-18T03:53:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1206.3596","created_at":"2026-05-18T03:53:19Z"},{"alias_kind":"pith_short_12","alias_value":"QI6MPWPJIZJY","created_at":"2026-05-18T12:27:18Z"},{"alias_kind":"pith_short_16","alias_value":"QI6MPWPJIZJYNK5L","created_at":"2026-05-18T12:27:18Z"},{"alias_kind":"pith_short_8","alias_value":"QI6MPWPJ","created_at":"2026-05-18T12:27:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:QI6MPWPJIZJYNK5LQIQZP6JOV4","target":"record","payload":{"canonical_record":{"source":{"id":"1206.3596","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-06-15T21:02:07Z","cross_cats_sorted":[],"title_canon_sha256":"160938fdc07230bec752ea3028f8de9dbf436cd59cda726115a7d706513c3318","abstract_canon_sha256":"fb551fae6b3ad5ce90c22f935024a3127ed0a2bd278f6828dc06d321b2d989b4"},"schema_version":"1.0"},"canonical_sha256":"823cc7d9e9465386abab822197f92eaf032fccf85888438dc8f9b40413f6cae1","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:53:19.393056Z","signature_b64":"rkjbgUyC7PPbbBqBZtr2LSV/i/hbEz+YgwTLp7lWUuwslqtD8HfK3VamT5T0elEZf6V4RmM1P9F41pqzDGnnAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"823cc7d9e9465386abab822197f92eaf032fccf85888438dc8f9b40413f6cae1","last_reissued_at":"2026-05-18T03:53:19.392421Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:53:19.392421Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1206.3596","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:53:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"b/LFEL1rmPzSdQt7OgvcdZu4ZHAMmbnHI/1mLkA0jWySNje7b5BOB+xzoPYoQwMFRkmMU66cc+fcQDI93guEAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T07:31:43.648457Z"},"content_sha256":"634e1b0980f8441b20887c3ba559c8646b5443f192c32d37de67ec9e4618fd13","schema_version":"1.0","event_id":"sha256:634e1b0980f8441b20887c3ba559c8646b5443f192c32d37de67ec9e4618fd13"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:QI6MPWPJIZJYNK5LQIQZP6JOV4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Identifying codes of the direct product of two cliques","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Douglas F. Rall, Kirsti Wash","submitted_at":"2012-06-15T21:02:07Z","abstract_excerpt":"An identifying code in a graph is a dominating set that also has the property that the closed neighborhood of each vertex in the graph has a distinct intersection with the set. It was recently shown by Gravier, Moncel and Semri that the minimum cardinality of an identifying code for the Cartesian product of two cliques of the same order n is the floor of 3n/2. We consider identifying codes of the direct product of two cliques. In particular, we answer a question of Klavzar and determine the minimum cardinality of an identifying code for the direct product of any two cliques."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1206.3596","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:53:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eW3QGPnmWGJQC327Vdt8kaO/cjReBOJwMcuni2hWLdFXoAFjx8ktdzhTloc9M5ZOxlMdUt8OyU1kjM3IDPI6BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T07:31:43.649233Z"},"content_sha256":"03ac550270dc04898f7add2006c5c228dac7819fbfa4e15d2ab9f64265b5d021","schema_version":"1.0","event_id":"sha256:03ac550270dc04898f7add2006c5c228dac7819fbfa4e15d2ab9f64265b5d021"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QI6MPWPJIZJYNK5LQIQZP6JOV4/bundle.json","state_url":"https://pith.science/pith/QI6MPWPJIZJYNK5LQIQZP6JOV4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QI6MPWPJIZJYNK5LQIQZP6JOV4/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-05-31T07:31:43Z","links":{"resolver":"https://pith.science/pith/QI6MPWPJIZJYNK5LQIQZP6JOV4","bundle":"https://pith.science/pith/QI6MPWPJIZJYNK5LQIQZP6JOV4/bundle.json","state":"https://pith.science/pith/QI6MPWPJIZJYNK5LQIQZP6JOV4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QI6MPWPJIZJYNK5LQIQZP6JOV4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:QI6MPWPJIZJYNK5LQIQZP6JOV4","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":"fb551fae6b3ad5ce90c22f935024a3127ed0a2bd278f6828dc06d321b2d989b4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-06-15T21:02:07Z","title_canon_sha256":"160938fdc07230bec752ea3028f8de9dbf436cd59cda726115a7d706513c3318"},"schema_version":"1.0","source":{"id":"1206.3596","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1206.3596","created_at":"2026-05-18T03:53:19Z"},{"alias_kind":"arxiv_version","alias_value":"1206.3596v1","created_at":"2026-05-18T03:53:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1206.3596","created_at":"2026-05-18T03:53:19Z"},{"alias_kind":"pith_short_12","alias_value":"QI6MPWPJIZJY","created_at":"2026-05-18T12:27:18Z"},{"alias_kind":"pith_short_16","alias_value":"QI6MPWPJIZJYNK5L","created_at":"2026-05-18T12:27:18Z"},{"alias_kind":"pith_short_8","alias_value":"QI6MPWPJ","created_at":"2026-05-18T12:27:18Z"}],"graph_snapshots":[{"event_id":"sha256:03ac550270dc04898f7add2006c5c228dac7819fbfa4e15d2ab9f64265b5d021","target":"graph","created_at":"2026-05-18T03:53:19Z","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":"An identifying code in a graph is a dominating set that also has the property that the closed neighborhood of each vertex in the graph has a distinct intersection with the set. It was recently shown by Gravier, Moncel and Semri that the minimum cardinality of an identifying code for the Cartesian product of two cliques of the same order n is the floor of 3n/2. We consider identifying codes of the direct product of two cliques. In particular, we answer a question of Klavzar and determine the minimum cardinality of an identifying code for the direct product of any two cliques.","authors_text":"Douglas F. Rall, Kirsti Wash","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-06-15T21:02:07Z","title":"Identifying codes of the direct product of two cliques"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1206.3596","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:634e1b0980f8441b20887c3ba559c8646b5443f192c32d37de67ec9e4618fd13","target":"record","created_at":"2026-05-18T03:53:19Z","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":"fb551fae6b3ad5ce90c22f935024a3127ed0a2bd278f6828dc06d321b2d989b4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-06-15T21:02:07Z","title_canon_sha256":"160938fdc07230bec752ea3028f8de9dbf436cd59cda726115a7d706513c3318"},"schema_version":"1.0","source":{"id":"1206.3596","kind":"arxiv","version":1}},"canonical_sha256":"823cc7d9e9465386abab822197f92eaf032fccf85888438dc8f9b40413f6cae1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"823cc7d9e9465386abab822197f92eaf032fccf85888438dc8f9b40413f6cae1","first_computed_at":"2026-05-18T03:53:19.392421Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:53:19.392421Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"rkjbgUyC7PPbbBqBZtr2LSV/i/hbEz+YgwTLp7lWUuwslqtD8HfK3VamT5T0elEZf6V4RmM1P9F41pqzDGnnAg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:53:19.393056Z","signed_message":"canonical_sha256_bytes"},"source_id":"1206.3596","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:634e1b0980f8441b20887c3ba559c8646b5443f192c32d37de67ec9e4618fd13","sha256:03ac550270dc04898f7add2006c5c228dac7819fbfa4e15d2ab9f64265b5d021"],"state_sha256":"749a9c68c2b4e928c67cde3d9b571f66a218b6f54fd6d70c180a45b4ac61ee9b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UX8GRRmsqdtMzobNTLz2XvuEKToRL4xYXGCFzyPMylWBewf/sb7oGj/lqJXR98LS6dDqztA3Jxw8ipn33RLBCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T07:31:43.653198Z","bundle_sha256":"88642a0c799be134a652efecd78fc59b65bdc5bc3e64b6608983a7c635b194a8"}}