{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:KH3X4E7JXYHSVNJZMS63CF5DCU","short_pith_number":"pith:KH3X4E7J","canonical_record":{"source":{"id":"1810.10198","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-10-24T06:00:15Z","cross_cats_sorted":[],"title_canon_sha256":"0cfbf4954117edbf90560a395f35875dcba906c89315c50cb2e366f841301a5b","abstract_canon_sha256":"c61f0878100baa464ce841688d8436ed59f5a7be3fe573484d29e2ec60772b3f"},"schema_version":"1.0"},"canonical_sha256":"51f77e13e9be0f2ab53964bdb117a31530b432c7f36c6504d2b8cdffc3edfafe","source":{"kind":"arxiv","id":"1810.10198","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.10198","created_at":"2026-05-18T00:02:23Z"},{"alias_kind":"arxiv_version","alias_value":"1810.10198v1","created_at":"2026-05-18T00:02:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.10198","created_at":"2026-05-18T00:02:23Z"},{"alias_kind":"pith_short_12","alias_value":"KH3X4E7JXYHS","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_16","alias_value":"KH3X4E7JXYHSVNJZ","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_8","alias_value":"KH3X4E7J","created_at":"2026-05-18T12:32:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:KH3X4E7JXYHSVNJZMS63CF5DCU","target":"record","payload":{"canonical_record":{"source":{"id":"1810.10198","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-10-24T06:00:15Z","cross_cats_sorted":[],"title_canon_sha256":"0cfbf4954117edbf90560a395f35875dcba906c89315c50cb2e366f841301a5b","abstract_canon_sha256":"c61f0878100baa464ce841688d8436ed59f5a7be3fe573484d29e2ec60772b3f"},"schema_version":"1.0"},"canonical_sha256":"51f77e13e9be0f2ab53964bdb117a31530b432c7f36c6504d2b8cdffc3edfafe","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:02:23.953780Z","signature_b64":"gW0jps3cIiJl4enGx/sQSbHTTq2wvDceghfMvHXRdIMAQdDoeeNWi1P8YpjycmwZYhzswwhLjaoKEAPWEMtWCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"51f77e13e9be0f2ab53964bdb117a31530b432c7f36c6504d2b8cdffc3edfafe","last_reissued_at":"2026-05-18T00:02:23.952846Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:02:23.952846Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1810.10198","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-18T00:02:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vYrQkP7k7y8R0n7WtJiLFJnpC5NpXllW5JvKZDUT36vQKDoWXHQPEFKxOP6skWaYzh3DclcJXOLio/TswM5nAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T21:24:27.639686Z"},"content_sha256":"1270bfe490a73029c22f52e03b14de364bb0b2daba556d7046b4799f0c66a7fb","schema_version":"1.0","event_id":"sha256:1270bfe490a73029c22f52e03b14de364bb0b2daba556d7046b4799f0c66a7fb"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:KH3X4E7JXYHSVNJZMS63CF5DCU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Exact distance graphs of product graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Bo\\v{s}tjan Bre\\v{s}ar, Nicolas Gastineau, Olivier Togni, Sandi Klav\\v{z}ar","submitted_at":"2018-10-24T06:00:15Z","abstract_excerpt":"Given a graph $G$, the exact distance-$p$ graph $G^{[\\natural p]}$ has $V(G)$ as its vertex set, and two vertices are adjacent whenever the distance between them in $G$ equals $p$. We present formulas describing the structure of exact distance-$p$ graphs of the Cartesian, the strong, and the lexicographic product. We prove such formulas for the exact distance-$2$ graphs of direct products of graphs. We also consider infinite grids and some other product structures. We characterize the products of graphs of which exact distance graphs are connected. The exact distance-$p$ graphs of hypercubes $"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.10198","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-18T00:02:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cKXUnzommo2cTmtvxn6DwI8wQhH07mbGbGemUbnRiIVdLHs3HsolDdHKc5hnDu5ORhmfmWbEYd26/oC06XR3DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T21:24:27.640036Z"},"content_sha256":"bb91f71b1b9e55134436fa1f6a2284b3485e84ad1a0308ee3140ba20fed11853","schema_version":"1.0","event_id":"sha256:bb91f71b1b9e55134436fa1f6a2284b3485e84ad1a0308ee3140ba20fed11853"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KH3X4E7JXYHSVNJZMS63CF5DCU/bundle.json","state_url":"https://pith.science/pith/KH3X4E7JXYHSVNJZMS63CF5DCU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KH3X4E7JXYHSVNJZMS63CF5DCU/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-24T21:24:27Z","links":{"resolver":"https://pith.science/pith/KH3X4E7JXYHSVNJZMS63CF5DCU","bundle":"https://pith.science/pith/KH3X4E7JXYHSVNJZMS63CF5DCU/bundle.json","state":"https://pith.science/pith/KH3X4E7JXYHSVNJZMS63CF5DCU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KH3X4E7JXYHSVNJZMS63CF5DCU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:KH3X4E7JXYHSVNJZMS63CF5DCU","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":"c61f0878100baa464ce841688d8436ed59f5a7be3fe573484d29e2ec60772b3f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-10-24T06:00:15Z","title_canon_sha256":"0cfbf4954117edbf90560a395f35875dcba906c89315c50cb2e366f841301a5b"},"schema_version":"1.0","source":{"id":"1810.10198","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.10198","created_at":"2026-05-18T00:02:23Z"},{"alias_kind":"arxiv_version","alias_value":"1810.10198v1","created_at":"2026-05-18T00:02:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.10198","created_at":"2026-05-18T00:02:23Z"},{"alias_kind":"pith_short_12","alias_value":"KH3X4E7JXYHS","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_16","alias_value":"KH3X4E7JXYHSVNJZ","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_8","alias_value":"KH3X4E7J","created_at":"2026-05-18T12:32:33Z"}],"graph_snapshots":[{"event_id":"sha256:bb91f71b1b9e55134436fa1f6a2284b3485e84ad1a0308ee3140ba20fed11853","target":"graph","created_at":"2026-05-18T00:02:23Z","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":"Given a graph $G$, the exact distance-$p$ graph $G^{[\\natural p]}$ has $V(G)$ as its vertex set, and two vertices are adjacent whenever the distance between them in $G$ equals $p$. We present formulas describing the structure of exact distance-$p$ graphs of the Cartesian, the strong, and the lexicographic product. We prove such formulas for the exact distance-$2$ graphs of direct products of graphs. We also consider infinite grids and some other product structures. We characterize the products of graphs of which exact distance graphs are connected. The exact distance-$p$ graphs of hypercubes $","authors_text":"Bo\\v{s}tjan Bre\\v{s}ar, Nicolas Gastineau, Olivier Togni, Sandi Klav\\v{z}ar","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-10-24T06:00:15Z","title":"Exact distance graphs of product graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.10198","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:1270bfe490a73029c22f52e03b14de364bb0b2daba556d7046b4799f0c66a7fb","target":"record","created_at":"2026-05-18T00:02:23Z","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":"c61f0878100baa464ce841688d8436ed59f5a7be3fe573484d29e2ec60772b3f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-10-24T06:00:15Z","title_canon_sha256":"0cfbf4954117edbf90560a395f35875dcba906c89315c50cb2e366f841301a5b"},"schema_version":"1.0","source":{"id":"1810.10198","kind":"arxiv","version":1}},"canonical_sha256":"51f77e13e9be0f2ab53964bdb117a31530b432c7f36c6504d2b8cdffc3edfafe","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"51f77e13e9be0f2ab53964bdb117a31530b432c7f36c6504d2b8cdffc3edfafe","first_computed_at":"2026-05-18T00:02:23.952846Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:02:23.952846Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"gW0jps3cIiJl4enGx/sQSbHTTq2wvDceghfMvHXRdIMAQdDoeeNWi1P8YpjycmwZYhzswwhLjaoKEAPWEMtWCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:02:23.953780Z","signed_message":"canonical_sha256_bytes"},"source_id":"1810.10198","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1270bfe490a73029c22f52e03b14de364bb0b2daba556d7046b4799f0c66a7fb","sha256:bb91f71b1b9e55134436fa1f6a2284b3485e84ad1a0308ee3140ba20fed11853"],"state_sha256":"c3dac15a602512cea68985ce074664e6278615a9676f3a6b44243a53fbad14aa"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1yPQUzTaPMJz6ergWr3mhQOtKyKkjrm0fnA/EALCKY+ypKNn3R4xMjHRks4XW5TVtpdw/t+OKO+VyyHWvlOIDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-24T21:24:27.642087Z","bundle_sha256":"d26150336f14d6cb978fcd17fd9b5918ab7dc82478fa265d4784727d63b78377"}}