{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:KXYA3KIWDZWPHLEEZKVDRPFASD","short_pith_number":"pith:KXYA3KIW","canonical_record":{"source":{"id":"1203.2660","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-03-12T21:34:04Z","cross_cats_sorted":[],"title_canon_sha256":"38950a9842d6c72212080a2794acca466274bc23ac7c45ac742523b89f6c9b91","abstract_canon_sha256":"06ae726a762862aa855ad239e54d503b55310b5ae1a57df1e526707b19675372"},"schema_version":"1.0"},"canonical_sha256":"55f00da9161e6cf3ac84caaa38bca090c4e4d7faef752529dc651f2ae34e6772","source":{"kind":"arxiv","id":"1203.2660","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1203.2660","created_at":"2026-05-18T02:59:48Z"},{"alias_kind":"arxiv_version","alias_value":"1203.2660v2","created_at":"2026-05-18T02:59:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1203.2660","created_at":"2026-05-18T02:59:48Z"},{"alias_kind":"pith_short_12","alias_value":"KXYA3KIWDZWP","created_at":"2026-05-18T12:27:11Z"},{"alias_kind":"pith_short_16","alias_value":"KXYA3KIWDZWPHLEE","created_at":"2026-05-18T12:27:11Z"},{"alias_kind":"pith_short_8","alias_value":"KXYA3KIW","created_at":"2026-05-18T12:27:11Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:KXYA3KIWDZWPHLEEZKVDRPFASD","target":"record","payload":{"canonical_record":{"source":{"id":"1203.2660","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-03-12T21:34:04Z","cross_cats_sorted":[],"title_canon_sha256":"38950a9842d6c72212080a2794acca466274bc23ac7c45ac742523b89f6c9b91","abstract_canon_sha256":"06ae726a762862aa855ad239e54d503b55310b5ae1a57df1e526707b19675372"},"schema_version":"1.0"},"canonical_sha256":"55f00da9161e6cf3ac84caaa38bca090c4e4d7faef752529dc651f2ae34e6772","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:59:48.428880Z","signature_b64":"wJYKQjFLE73XGdr0DBDCMBZbDHNqmehnSMALOuGu9qyQFUEhKsAPVISGqfw2vVHJsLeKpwBxOfrgbW2dxvBjCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"55f00da9161e6cf3ac84caaa38bca090c4e4d7faef752529dc651f2ae34e6772","last_reissued_at":"2026-05-18T02:59:48.428303Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:59:48.428303Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1203.2660","source_version":2,"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-18T02:59:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ia387BF7OXgbnhtBNxsEFXWLETAJOE8i/FAK8iC33k5NIdtosO//nYdDf0YPMNlDfjUdVuJO8jvQ6gtDY7x7Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T17:39:04.316534Z"},"content_sha256":"5de4f9ff5da442210170d13dc925a9fc8647a2be6d5cf994b087d8bbf3396899","schema_version":"1.0","event_id":"sha256:5de4f9ff5da442210170d13dc925a9fc8647a2be6d5cf994b087d8bbf3396899"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:KXYA3KIWDZWPHLEEZKVDRPFASD","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Resolving sets for Johnson and Kneser graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Alberto M\\'arquez, Antonio Gonz\\'alez, Delia Garijo, Jos\\'e C\\'aceres, Karen Meagher, Mar\\'ia Luz Puertas, Robert F. Bailey","submitted_at":"2012-03-12T21:34:04Z","abstract_excerpt":"A set of vertices $S$ in a graph $G$ is a {\\em resolving set} for $G$ if, for any two vertices $u,v$, there exists $x\\in S$ such that the distances $d(u,x) \\neq d(v,x)$. In this paper, we consider the Johnson graphs $J(n,k)$ and Kneser graphs $K(n,k)$, and obtain various constructions of resolving sets for these graphs. As well as general constructions, we show that various interesting combinatorial objects can be used to obtain resolving sets in these graphs, including (for Johnson graphs) projective planes and symmetric designs, as well as (for Kneser graphs) partial geometries, Hadamard mat"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1203.2660","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"},"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-18T02:59:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sEJRBibvNVwRfvxlFGsreOY1Srq83Nk0WY3Hi6b0AYwpyaRAWku0hUeZB9Uxp6HiRYlPsxxmfDBu/qBwk1L9Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T17:39:04.317159Z"},"content_sha256":"fb6e3936e821044443520c2c8c583b164ed76a390418994f6015ead0170dc364","schema_version":"1.0","event_id":"sha256:fb6e3936e821044443520c2c8c583b164ed76a390418994f6015ead0170dc364"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KXYA3KIWDZWPHLEEZKVDRPFASD/bundle.json","state_url":"https://pith.science/pith/KXYA3KIWDZWPHLEEZKVDRPFASD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KXYA3KIWDZWPHLEEZKVDRPFASD/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-26T17:39:04Z","links":{"resolver":"https://pith.science/pith/KXYA3KIWDZWPHLEEZKVDRPFASD","bundle":"https://pith.science/pith/KXYA3KIWDZWPHLEEZKVDRPFASD/bundle.json","state":"https://pith.science/pith/KXYA3KIWDZWPHLEEZKVDRPFASD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KXYA3KIWDZWPHLEEZKVDRPFASD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:KXYA3KIWDZWPHLEEZKVDRPFASD","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":"06ae726a762862aa855ad239e54d503b55310b5ae1a57df1e526707b19675372","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-03-12T21:34:04Z","title_canon_sha256":"38950a9842d6c72212080a2794acca466274bc23ac7c45ac742523b89f6c9b91"},"schema_version":"1.0","source":{"id":"1203.2660","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1203.2660","created_at":"2026-05-18T02:59:48Z"},{"alias_kind":"arxiv_version","alias_value":"1203.2660v2","created_at":"2026-05-18T02:59:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1203.2660","created_at":"2026-05-18T02:59:48Z"},{"alias_kind":"pith_short_12","alias_value":"KXYA3KIWDZWP","created_at":"2026-05-18T12:27:11Z"},{"alias_kind":"pith_short_16","alias_value":"KXYA3KIWDZWPHLEE","created_at":"2026-05-18T12:27:11Z"},{"alias_kind":"pith_short_8","alias_value":"KXYA3KIW","created_at":"2026-05-18T12:27:11Z"}],"graph_snapshots":[{"event_id":"sha256:fb6e3936e821044443520c2c8c583b164ed76a390418994f6015ead0170dc364","target":"graph","created_at":"2026-05-18T02:59:48Z","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":"A set of vertices $S$ in a graph $G$ is a {\\em resolving set} for $G$ if, for any two vertices $u,v$, there exists $x\\in S$ such that the distances $d(u,x) \\neq d(v,x)$. In this paper, we consider the Johnson graphs $J(n,k)$ and Kneser graphs $K(n,k)$, and obtain various constructions of resolving sets for these graphs. As well as general constructions, we show that various interesting combinatorial objects can be used to obtain resolving sets in these graphs, including (for Johnson graphs) projective planes and symmetric designs, as well as (for Kneser graphs) partial geometries, Hadamard mat","authors_text":"Alberto M\\'arquez, Antonio Gonz\\'alez, Delia Garijo, Jos\\'e C\\'aceres, Karen Meagher, Mar\\'ia Luz Puertas, Robert F. Bailey","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-03-12T21:34:04Z","title":"Resolving sets for Johnson and Kneser graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1203.2660","kind":"arxiv","version":2},"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:5de4f9ff5da442210170d13dc925a9fc8647a2be6d5cf994b087d8bbf3396899","target":"record","created_at":"2026-05-18T02:59:48Z","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":"06ae726a762862aa855ad239e54d503b55310b5ae1a57df1e526707b19675372","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-03-12T21:34:04Z","title_canon_sha256":"38950a9842d6c72212080a2794acca466274bc23ac7c45ac742523b89f6c9b91"},"schema_version":"1.0","source":{"id":"1203.2660","kind":"arxiv","version":2}},"canonical_sha256":"55f00da9161e6cf3ac84caaa38bca090c4e4d7faef752529dc651f2ae34e6772","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"55f00da9161e6cf3ac84caaa38bca090c4e4d7faef752529dc651f2ae34e6772","first_computed_at":"2026-05-18T02:59:48.428303Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:59:48.428303Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"wJYKQjFLE73XGdr0DBDCMBZbDHNqmehnSMALOuGu9qyQFUEhKsAPVISGqfw2vVHJsLeKpwBxOfrgbW2dxvBjCg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:59:48.428880Z","signed_message":"canonical_sha256_bytes"},"source_id":"1203.2660","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5de4f9ff5da442210170d13dc925a9fc8647a2be6d5cf994b087d8bbf3396899","sha256:fb6e3936e821044443520c2c8c583b164ed76a390418994f6015ead0170dc364"],"state_sha256":"1b72fe37b4a57002da5acfa35d67cd821d5e6f2fb3b2dd3515d6c202cd601645"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"A8XD6SyUGiIYZ14LRQWxVzMwguJmDb6sEbB8D2GW4agMzNZh7WPbQyYsKLNBQYOfS1e0MvZCP3RuwlDdXwm0Aw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T17:39:04.320632Z","bundle_sha256":"11258fcd13b0d30e5a85308eaf90c1e31cfab10a860fcfd7dd354b8c49f3b469"}}