{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:A7S7CIJ6XV6RUIDSOWYZGK2XCT","short_pith_number":"pith:A7S7CIJ6","schema_version":"1.0","canonical_sha256":"07e5f1213ebd7d1a207275b1932b5714ce6dd3459f97c2729b8e8cdeb6cf5b00","source":{"kind":"arxiv","id":"1808.04757","version":2},"attestation_state":"computed","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 "},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1808.04757","created_at":"2026-05-18T00:02:09.298347+00:00"},{"alias_kind":"arxiv_version","alias_value":"1808.04757v2","created_at":"2026-05-18T00:02:09.298347+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.04757","created_at":"2026-05-18T00:02:09.298347+00:00"},{"alias_kind":"pith_short_12","alias_value":"A7S7CIJ6XV6R","created_at":"2026-05-18T12:32:13.499390+00:00"},{"alias_kind":"pith_short_16","alias_value":"A7S7CIJ6XV6RUIDS","created_at":"2026-05-18T12:32:13.499390+00:00"},{"alias_kind":"pith_short_8","alias_value":"A7S7CIJ6","created_at":"2026-05-18T12:32:13.499390+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/A7S7CIJ6XV6RUIDSOWYZGK2XCT","json":"https://pith.science/pith/A7S7CIJ6XV6RUIDSOWYZGK2XCT.json","graph_json":"https://pith.science/api/pith-number/A7S7CIJ6XV6RUIDSOWYZGK2XCT/graph.json","events_json":"https://pith.science/api/pith-number/A7S7CIJ6XV6RUIDSOWYZGK2XCT/events.json","paper":"https://pith.science/paper/A7S7CIJ6"},"agent_actions":{"view_html":"https://pith.science/pith/A7S7CIJ6XV6RUIDSOWYZGK2XCT","download_json":"https://pith.science/pith/A7S7CIJ6XV6RUIDSOWYZGK2XCT.json","view_paper":"https://pith.science/paper/A7S7CIJ6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1808.04757&json=true","fetch_graph":"https://pith.science/api/pith-number/A7S7CIJ6XV6RUIDSOWYZGK2XCT/graph.json","fetch_events":"https://pith.science/api/pith-number/A7S7CIJ6XV6RUIDSOWYZGK2XCT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/A7S7CIJ6XV6RUIDSOWYZGK2XCT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/A7S7CIJ6XV6RUIDSOWYZGK2XCT/action/storage_attestation","attest_author":"https://pith.science/pith/A7S7CIJ6XV6RUIDSOWYZGK2XCT/action/author_attestation","sign_citation":"https://pith.science/pith/A7S7CIJ6XV6RUIDSOWYZGK2XCT/action/citation_signature","submit_replication":"https://pith.science/pith/A7S7CIJ6XV6RUIDSOWYZGK2XCT/action/replication_record"}},"created_at":"2026-05-18T00:02:09.298347+00:00","updated_at":"2026-05-18T00:02:09.298347+00:00"}