{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:26J3FJJSRHRVOHNOCZ3SQZWLNK","short_pith_number":"pith:26J3FJJS","canonical_record":{"source":{"id":"1609.05995","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-09-20T02:04:57Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"c65cb79e110932698630a609332971b0bf03b25e6788a951511b12fcc1f72e64","abstract_canon_sha256":"bfa95eb95662ed2be72dd675095772e52ad7f90429802b08a59883081e9be1c6"},"schema_version":"1.0"},"canonical_sha256":"d793b2a53289e3571dae16772866cb6aaa5d7f7042d91c2712f2690a6a932f89","source":{"kind":"arxiv","id":"1609.05995","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1609.05995","created_at":"2026-05-18T00:53:30Z"},{"alias_kind":"arxiv_version","alias_value":"1609.05995v2","created_at":"2026-05-18T00:53:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.05995","created_at":"2026-05-18T00:53:30Z"},{"alias_kind":"pith_short_12","alias_value":"26J3FJJSRHRV","created_at":"2026-05-18T12:29:52Z"},{"alias_kind":"pith_short_16","alias_value":"26J3FJJSRHRVOHNO","created_at":"2026-05-18T12:29:52Z"},{"alias_kind":"pith_short_8","alias_value":"26J3FJJS","created_at":"2026-05-18T12:29:52Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:26J3FJJSRHRVOHNOCZ3SQZWLNK","target":"record","payload":{"canonical_record":{"source":{"id":"1609.05995","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-09-20T02:04:57Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"c65cb79e110932698630a609332971b0bf03b25e6788a951511b12fcc1f72e64","abstract_canon_sha256":"bfa95eb95662ed2be72dd675095772e52ad7f90429802b08a59883081e9be1c6"},"schema_version":"1.0"},"canonical_sha256":"d793b2a53289e3571dae16772866cb6aaa5d7f7042d91c2712f2690a6a932f89","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:53:30.204339Z","signature_b64":"YhbfN/W6R4HLOLMl8Dd7KVxo1/Q/CJbwUulMlMtEAqQZwHuMba7tHNSc9TBaUmDNS4Q9XMshaILSOhw9NZiuAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d793b2a53289e3571dae16772866cb6aaa5d7f7042d91c2712f2690a6a932f89","last_reissued_at":"2026-05-18T00:53:30.203826Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:53:30.203826Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1609.05995","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:53:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2qoqnAX0YFtsNc7kERRP7mMk84CzhrI9JtkBefieaswqZ4TsKSLCGkDZh7J6NYsg/XW+7RKk2P//k0kjOVDpDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T09:55:53.531161Z"},"content_sha256":"e4aa195f4cf7bd2eb2a23d6deae01306aed9a8e0b54bbc88c07956399df94ee8","schema_version":"1.0","event_id":"sha256:e4aa195f4cf7bd2eb2a23d6deae01306aed9a8e0b54bbc88c07956399df94ee8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:26J3FJJSRHRVOHNOCZ3SQZWLNK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Addressing Graph Products and Distance-Regular Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Kevin Vander Meulen, Michelle Markiewitz, Randall J. Elzinga, Sebastian M. Cioab\\u{a}, Trevor Vanderwoerd","submitted_at":"2016-09-20T02:04:57Z","abstract_excerpt":"Graham and Pollak showed that the vertices of any connected graph $G$ can be assigned $t$-tuples with entries in $\\{0, a, b\\}$, called addresses, such that the distance in $G$ between any two vertices equals the number of positions in their addresses where one of the addresses equals $a$ and the other equals $b$. In this paper, we are interested in determining the minimum value of such $t$ for various families of graphs. We develop two ways to obtain this value for the Hamming graphs and present a lower bound for the triangular graphs."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.05995","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:53:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZBqAcMcwsKHjFFk4lFCEro1vqyq5Kl+CA6ccY+5AZphrK6r1Yvea23hf1pDVqkRTp8W1aWNMlDi2QoWy8owsCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T09:55:53.531523Z"},"content_sha256":"cb4f2e52fc316ce603c0f1237dbf9c15091b2508bb5f05962326832d6400efe3","schema_version":"1.0","event_id":"sha256:cb4f2e52fc316ce603c0f1237dbf9c15091b2508bb5f05962326832d6400efe3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/26J3FJJSRHRVOHNOCZ3SQZWLNK/bundle.json","state_url":"https://pith.science/pith/26J3FJJSRHRVOHNOCZ3SQZWLNK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/26J3FJJSRHRVOHNOCZ3SQZWLNK/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-02T09:55:53Z","links":{"resolver":"https://pith.science/pith/26J3FJJSRHRVOHNOCZ3SQZWLNK","bundle":"https://pith.science/pith/26J3FJJSRHRVOHNOCZ3SQZWLNK/bundle.json","state":"https://pith.science/pith/26J3FJJSRHRVOHNOCZ3SQZWLNK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/26J3FJJSRHRVOHNOCZ3SQZWLNK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:26J3FJJSRHRVOHNOCZ3SQZWLNK","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":"bfa95eb95662ed2be72dd675095772e52ad7f90429802b08a59883081e9be1c6","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-09-20T02:04:57Z","title_canon_sha256":"c65cb79e110932698630a609332971b0bf03b25e6788a951511b12fcc1f72e64"},"schema_version":"1.0","source":{"id":"1609.05995","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1609.05995","created_at":"2026-05-18T00:53:30Z"},{"alias_kind":"arxiv_version","alias_value":"1609.05995v2","created_at":"2026-05-18T00:53:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.05995","created_at":"2026-05-18T00:53:30Z"},{"alias_kind":"pith_short_12","alias_value":"26J3FJJSRHRV","created_at":"2026-05-18T12:29:52Z"},{"alias_kind":"pith_short_16","alias_value":"26J3FJJSRHRVOHNO","created_at":"2026-05-18T12:29:52Z"},{"alias_kind":"pith_short_8","alias_value":"26J3FJJS","created_at":"2026-05-18T12:29:52Z"}],"graph_snapshots":[{"event_id":"sha256:cb4f2e52fc316ce603c0f1237dbf9c15091b2508bb5f05962326832d6400efe3","target":"graph","created_at":"2026-05-18T00:53:30Z","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 connected graph $G$ can be assigned $t$-tuples with entries in $\\{0, a, b\\}$, called addresses, such that the distance in $G$ between any two vertices equals the number of positions in their addresses where one of the addresses equals $a$ and the other equals $b$. In this paper, we are interested in determining the minimum value of such $t$ for various families of graphs. We develop two ways to obtain this value for the Hamming graphs and present a lower bound for the triangular graphs.","authors_text":"Kevin Vander Meulen, Michelle Markiewitz, Randall J. Elzinga, Sebastian M. Cioab\\u{a}, Trevor Vanderwoerd","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-09-20T02:04:57Z","title":"Addressing Graph Products and Distance-Regular Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.05995","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:e4aa195f4cf7bd2eb2a23d6deae01306aed9a8e0b54bbc88c07956399df94ee8","target":"record","created_at":"2026-05-18T00:53:30Z","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":"bfa95eb95662ed2be72dd675095772e52ad7f90429802b08a59883081e9be1c6","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-09-20T02:04:57Z","title_canon_sha256":"c65cb79e110932698630a609332971b0bf03b25e6788a951511b12fcc1f72e64"},"schema_version":"1.0","source":{"id":"1609.05995","kind":"arxiv","version":2}},"canonical_sha256":"d793b2a53289e3571dae16772866cb6aaa5d7f7042d91c2712f2690a6a932f89","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d793b2a53289e3571dae16772866cb6aaa5d7f7042d91c2712f2690a6a932f89","first_computed_at":"2026-05-18T00:53:30.203826Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:53:30.203826Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"YhbfN/W6R4HLOLMl8Dd7KVxo1/Q/CJbwUulMlMtEAqQZwHuMba7tHNSc9TBaUmDNS4Q9XMshaILSOhw9NZiuAw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:53:30.204339Z","signed_message":"canonical_sha256_bytes"},"source_id":"1609.05995","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e4aa195f4cf7bd2eb2a23d6deae01306aed9a8e0b54bbc88c07956399df94ee8","sha256:cb4f2e52fc316ce603c0f1237dbf9c15091b2508bb5f05962326832d6400efe3"],"state_sha256":"73c7a48e6b239b4c83307159abd00a041861dbd9564d95769be00f447c7396ac"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zPBo+2jf6fSkg4Ufnv38PgPhAFQThbpF6v9SRBOukzAYE/+KfxB6zGzgH+i6eZ+UP4HGJ7XIUSKj2DQjISNECg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T09:55:53.533376Z","bundle_sha256":"156a16f45766c1f697c1c8f945f125c9d6a61c945a95a1d6da0726e3b2842847"}}