{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:A7S7CIJ6XV6RUIDSOWYZGK2XCT","short_pith_number":"pith:A7S7CIJ6","canonical_record":{"source":{"id":"1808.04757","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-08-14T15:42:56Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"52a0b87690ef711ed40374fd7bf2f88bad800f6ba0771076ea2568f1a10ba3b1","abstract_canon_sha256":"b843b2c507d907ce5f3859d2e840164cca3676472325a7ce6694ed1093ff38d3"},"schema_version":"1.0"},"canonical_sha256":"07e5f1213ebd7d1a207275b1932b5714ce6dd3459f97c2729b8e8cdeb6cf5b00","source":{"kind":"arxiv","id":"1808.04757","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1808.04757","created_at":"2026-05-18T00:02:09Z"},{"alias_kind":"arxiv_version","alias_value":"1808.04757v2","created_at":"2026-05-18T00:02:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.04757","created_at":"2026-05-18T00:02:09Z"},{"alias_kind":"pith_short_12","alias_value":"A7S7CIJ6XV6R","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_16","alias_value":"A7S7CIJ6XV6RUIDS","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_8","alias_value":"A7S7CIJ6","created_at":"2026-05-18T12:32:13Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:A7S7CIJ6XV6RUIDSOWYZGK2XCT","target":"record","payload":{"canonical_record":{"source":{"id":"1808.04757","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-08-14T15:42:56Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"52a0b87690ef711ed40374fd7bf2f88bad800f6ba0771076ea2568f1a10ba3b1","abstract_canon_sha256":"b843b2c507d907ce5f3859d2e840164cca3676472325a7ce6694ed1093ff38d3"},"schema_version":"1.0"},"canonical_sha256":"07e5f1213ebd7d1a207275b1932b5714ce6dd3459f97c2729b8e8cdeb6cf5b00","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:02:09.298851Z","signature_b64":"uBl8YTFU5e039Ak7vAF/w6NLBJcbmjD0sJQAEtTTX+65nViRDA/9ECHqFokJFrW35H7lsPmpIMxv6CljIft8AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"07e5f1213ebd7d1a207275b1932b5714ce6dd3459f97c2729b8e8cdeb6cf5b00","last_reissued_at":"2026-05-18T00:02:09.298246Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:02:09.298246Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1808.04757","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-18T00:02:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"91RX6HWr8ppGQtlcWh6TdK+4DfSscwtzO7KTpVNNB1QYnYPVgoWVNhpIs4X6p/W5ecYnfYN0YeBSJmMsTfBvCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T17:50:12.152139Z"},"content_sha256":"fa833314b2477d8d0aefcbfdd75e723cef4cf8f63e07fa85a0988d5d019ef6a4","schema_version":"1.0","event_id":"sha256:fa833314b2477d8d0aefcbfdd75e723cef4cf8f63e07fa85a0988d5d019ef6a4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:A7S7CIJ6XV6RUIDSOWYZGK2XCT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Addressing Johnson graphs, complete multipartite graphs, odd cycles and other graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Brandon D. Gilbert, Brendan D. McKay, Jack H. Koolen, Noga Alon, Sebastian M. Cioab\\u{a}","submitted_at":"2018-08-14T15:42:56Z","abstract_excerpt":"Graham and Pollak showed that the vertices of any graph $G$ can be addressed with $N$-tuples of three symbols, such that the distance between any two vertices may be easily determined from their addresses. An addressing is optimal if its length $N$ is minimum possible.\n  In this paper, we determine an addressing of length $k(n-k)$ for the Johnson graphs $J(n,k)$ and we show that our addressing is optimal when $k=1$ or when $k=2, n=4,5,6$, but not when $n=6$ and $k=3$. We study the addressing problem as well as a variation of it in which the alphabet used has more than three symbols, for other "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.04757","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-18T00:02:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AxjcxiedDllmU+sbvVf3937cvQh9GbRQq/MwFfOkqycwn+USr+AuO84P+b7JXZjoSXnnpt8QX3Qltlq7/pOeDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T17:50:12.152513Z"},"content_sha256":"20830e81daeae54309d766bb6641e175859a98fcaee8691e0f62270c178da681","schema_version":"1.0","event_id":"sha256:20830e81daeae54309d766bb6641e175859a98fcaee8691e0f62270c178da681"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/A7S7CIJ6XV6RUIDSOWYZGK2XCT/bundle.json","state_url":"https://pith.science/pith/A7S7CIJ6XV6RUIDSOWYZGK2XCT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/A7S7CIJ6XV6RUIDSOWYZGK2XCT/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-06-02T17:50:12Z","links":{"resolver":"https://pith.science/pith/A7S7CIJ6XV6RUIDSOWYZGK2XCT","bundle":"https://pith.science/pith/A7S7CIJ6XV6RUIDSOWYZGK2XCT/bundle.json","state":"https://pith.science/pith/A7S7CIJ6XV6RUIDSOWYZGK2XCT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/A7S7CIJ6XV6RUIDSOWYZGK2XCT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:A7S7CIJ6XV6RUIDSOWYZGK2XCT","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":"b843b2c507d907ce5f3859d2e840164cca3676472325a7ce6694ed1093ff38d3","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-08-14T15:42:56Z","title_canon_sha256":"52a0b87690ef711ed40374fd7bf2f88bad800f6ba0771076ea2568f1a10ba3b1"},"schema_version":"1.0","source":{"id":"1808.04757","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1808.04757","created_at":"2026-05-18T00:02:09Z"},{"alias_kind":"arxiv_version","alias_value":"1808.04757v2","created_at":"2026-05-18T00:02:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.04757","created_at":"2026-05-18T00:02:09Z"},{"alias_kind":"pith_short_12","alias_value":"A7S7CIJ6XV6R","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_16","alias_value":"A7S7CIJ6XV6RUIDS","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_8","alias_value":"A7S7CIJ6","created_at":"2026-05-18T12:32:13Z"}],"graph_snapshots":[{"event_id":"sha256:20830e81daeae54309d766bb6641e175859a98fcaee8691e0f62270c178da681","target":"graph","created_at":"2026-05-18T00:02:09Z","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":"Graham and Pollak showed that the vertices of any graph $G$ can be addressed with $N$-tuples of three symbols, such that the distance between any two vertices may be easily determined from their addresses. An addressing is optimal if its length $N$ is minimum possible.\n  In this paper, we determine an addressing of length $k(n-k)$ for the Johnson graphs $J(n,k)$ and we show that our addressing is optimal when $k=1$ or when $k=2, n=4,5,6$, but not when $n=6$ and $k=3$. We study the addressing problem as well as a variation of it in which the alphabet used has more than three symbols, for other ","authors_text":"Brandon D. Gilbert, Brendan D. McKay, Jack H. Koolen, Noga Alon, Sebastian M. Cioab\\u{a}","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-08-14T15:42:56Z","title":"Addressing Johnson graphs, complete multipartite graphs, odd cycles and other graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.04757","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:fa833314b2477d8d0aefcbfdd75e723cef4cf8f63e07fa85a0988d5d019ef6a4","target":"record","created_at":"2026-05-18T00:02:09Z","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":"b843b2c507d907ce5f3859d2e840164cca3676472325a7ce6694ed1093ff38d3","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-08-14T15:42:56Z","title_canon_sha256":"52a0b87690ef711ed40374fd7bf2f88bad800f6ba0771076ea2568f1a10ba3b1"},"schema_version":"1.0","source":{"id":"1808.04757","kind":"arxiv","version":2}},"canonical_sha256":"07e5f1213ebd7d1a207275b1932b5714ce6dd3459f97c2729b8e8cdeb6cf5b00","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"07e5f1213ebd7d1a207275b1932b5714ce6dd3459f97c2729b8e8cdeb6cf5b00","first_computed_at":"2026-05-18T00:02:09.298246Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:02:09.298246Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"uBl8YTFU5e039Ak7vAF/w6NLBJcbmjD0sJQAEtTTX+65nViRDA/9ECHqFokJFrW35H7lsPmpIMxv6CljIft8AA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:02:09.298851Z","signed_message":"canonical_sha256_bytes"},"source_id":"1808.04757","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fa833314b2477d8d0aefcbfdd75e723cef4cf8f63e07fa85a0988d5d019ef6a4","sha256:20830e81daeae54309d766bb6641e175859a98fcaee8691e0f62270c178da681"],"state_sha256":"fd0cd14fd6f3e385df0f5bd38df75721b84ccc5fa601d9c25a3a4ead249482c2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SYpN1pIRfS4tRdq5pTVk8QWI4BOf51KQfMB8+Ye5J64WL6QD4Wt/Isb/eSv8gbHeU6rdJ0hWYXipfT7ff+MfAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T17:50:12.154642Z","bundle_sha256":"34099bd7ac9fc19c3095c273c14a95f133a5f92f8bab88ea0470d6daaada0e9b"}}