{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:BPMHKHOOELBBDQWXQRDGN7KU5Z","short_pith_number":"pith:BPMHKHOO","canonical_record":{"source":{"id":"2307.04740","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2023-07-10T17:52:19Z","cross_cats_sorted":["math.PR"],"title_canon_sha256":"0c3d123f97e771534b8a592f7a4f89d1b433919f4512db902665dbcf6e82d7b3","abstract_canon_sha256":"a502a8a3466fc1c03974dbd5c1125e20b047c9c8f642c4b9ae7330a9b008a7f0"},"schema_version":"1.0"},"canonical_sha256":"0bd8751dce22c211c2d7844666fd54ee599331943ab463642045222473a00aaa","source":{"kind":"arxiv","id":"2307.04740","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2307.04740","created_at":"2026-07-05T06:29:16Z"},{"alias_kind":"arxiv_version","alias_value":"2307.04740v1","created_at":"2026-07-05T06:29:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2307.04740","created_at":"2026-07-05T06:29:16Z"},{"alias_kind":"pith_short_12","alias_value":"BPMHKHOOELBB","created_at":"2026-07-05T06:29:16Z"},{"alias_kind":"pith_short_16","alias_value":"BPMHKHOOELBBDQWX","created_at":"2026-07-05T06:29:16Z"},{"alias_kind":"pith_short_8","alias_value":"BPMHKHOO","created_at":"2026-07-05T06:29:16Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:BPMHKHOOELBBDQWXQRDGN7KU5Z","target":"record","payload":{"canonical_record":{"source":{"id":"2307.04740","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2023-07-10T17:52:19Z","cross_cats_sorted":["math.PR"],"title_canon_sha256":"0c3d123f97e771534b8a592f7a4f89d1b433919f4512db902665dbcf6e82d7b3","abstract_canon_sha256":"a502a8a3466fc1c03974dbd5c1125e20b047c9c8f642c4b9ae7330a9b008a7f0"},"schema_version":"1.0"},"canonical_sha256":"0bd8751dce22c211c2d7844666fd54ee599331943ab463642045222473a00aaa","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:29:16.810603Z","signature_b64":"0MiF2Mq+R+21d6gXjAqK4xIlm/JNCoD4FnmU1XxF6w5OiTfBrOmsv6vI230+tLR70Y/H8fldh/QfTQQrNycVCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0bd8751dce22c211c2d7844666fd54ee599331943ab463642045222473a00aaa","last_reissued_at":"2026-07-05T06:29:16.810193Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:29:16.810193Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2307.04740","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-07-05T06:29:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"I9bB7NdUoDTs8wbBnlg2Byme/kYO91wwAIUlT5ewuIFegZWy7wdt/ZQB5/nlREPTe2M004V43+Iqgb5Y6b3uBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-14T09:25:38.826415Z"},"content_sha256":"2cca6d9ee643b48e23adfd539ce84d789023651e4cba488d1f5c4ab784eb1ba4","schema_version":"1.0","event_id":"sha256:2cca6d9ee643b48e23adfd539ce84d789023651e4cba488d1f5c4ab784eb1ba4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:BPMHKHOOELBBDQWXQRDGN7KU5Z","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the image of graph distance matrices","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.PR"],"primary_cat":"math.CO","authors_text":"Alicia Stepin, Andrea Ottolini, Ansel Goh, Joia Zhang, Noah Feinberg, Raghavenda Tripathi, Raymond Guo, William Dudarov","submitted_at":"2023-07-10T17:52:19Z","abstract_excerpt":"Let $G=(V,E)$ be a finite, simple, connected, combinatorial graph on $n$ vertices and let $D \\in \\mathbb{R}^{n \\times n}$ be its graph distance matrix $D_{ij} = d(v_i, v_j)$. Steinerberger (J. Graph Theory, 2023) empirically observed that the linear system of equations $Dx =\\mathbf{1}$, where $\\mathbf{1} = (1,1,\\dots, 1)^{T}$, very frequently has a solution (even in cases where $D$ is not invertible). The smallest nontrivial example of a graph where the linear system is not solvable are two graphs on 7 vertices. We prove that, in fact, counterexamples exists for all $n\\geq 7$. The construction"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2307.04740","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2307.04740/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T06:29:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/VxNdKsbQGIisi5aVZnHSOtCyf9S7dcz/FoqTsBVrQPtKNCDSfRk4MnpC/ya9SWfN5hd1bDCn8pjd65TpysBCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-14T09:25:38.826766Z"},"content_sha256":"09b0c49c0ebcb71002b1f2868ac59955fddd552f71e9e6da7f25ddf365a91189","schema_version":"1.0","event_id":"sha256:09b0c49c0ebcb71002b1f2868ac59955fddd552f71e9e6da7f25ddf365a91189"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BPMHKHOOELBBDQWXQRDGN7KU5Z/bundle.json","state_url":"https://pith.science/pith/BPMHKHOOELBBDQWXQRDGN7KU5Z/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BPMHKHOOELBBDQWXQRDGN7KU5Z/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-08-14T09:25:38Z","links":{"resolver":"https://pith.science/pith/BPMHKHOOELBBDQWXQRDGN7KU5Z","bundle":"https://pith.science/pith/BPMHKHOOELBBDQWXQRDGN7KU5Z/bundle.json","state":"https://pith.science/pith/BPMHKHOOELBBDQWXQRDGN7KU5Z/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BPMHKHOOELBBDQWXQRDGN7KU5Z/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:BPMHKHOOELBBDQWXQRDGN7KU5Z","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":"a502a8a3466fc1c03974dbd5c1125e20b047c9c8f642c4b9ae7330a9b008a7f0","cross_cats_sorted":["math.PR"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2023-07-10T17:52:19Z","title_canon_sha256":"0c3d123f97e771534b8a592f7a4f89d1b433919f4512db902665dbcf6e82d7b3"},"schema_version":"1.0","source":{"id":"2307.04740","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2307.04740","created_at":"2026-07-05T06:29:16Z"},{"alias_kind":"arxiv_version","alias_value":"2307.04740v1","created_at":"2026-07-05T06:29:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2307.04740","created_at":"2026-07-05T06:29:16Z"},{"alias_kind":"pith_short_12","alias_value":"BPMHKHOOELBB","created_at":"2026-07-05T06:29:16Z"},{"alias_kind":"pith_short_16","alias_value":"BPMHKHOOELBBDQWX","created_at":"2026-07-05T06:29:16Z"},{"alias_kind":"pith_short_8","alias_value":"BPMHKHOO","created_at":"2026-07-05T06:29:16Z"}],"graph_snapshots":[{"event_id":"sha256:09b0c49c0ebcb71002b1f2868ac59955fddd552f71e9e6da7f25ddf365a91189","target":"graph","created_at":"2026-07-05T06:29:16Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2307.04740/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Let $G=(V,E)$ be a finite, simple, connected, combinatorial graph on $n$ vertices and let $D \\in \\mathbb{R}^{n \\times n}$ be its graph distance matrix $D_{ij} = d(v_i, v_j)$. Steinerberger (J. Graph Theory, 2023) empirically observed that the linear system of equations $Dx =\\mathbf{1}$, where $\\mathbf{1} = (1,1,\\dots, 1)^{T}$, very frequently has a solution (even in cases where $D$ is not invertible). The smallest nontrivial example of a graph where the linear system is not solvable are two graphs on 7 vertices. We prove that, in fact, counterexamples exists for all $n\\geq 7$. The construction","authors_text":"Alicia Stepin, Andrea Ottolini, Ansel Goh, Joia Zhang, Noah Feinberg, Raghavenda Tripathi, Raymond Guo, William Dudarov","cross_cats":["math.PR"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2023-07-10T17:52:19Z","title":"On the image of graph distance matrices"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2307.04740","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:2cca6d9ee643b48e23adfd539ce84d789023651e4cba488d1f5c4ab784eb1ba4","target":"record","created_at":"2026-07-05T06:29:16Z","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":"a502a8a3466fc1c03974dbd5c1125e20b047c9c8f642c4b9ae7330a9b008a7f0","cross_cats_sorted":["math.PR"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2023-07-10T17:52:19Z","title_canon_sha256":"0c3d123f97e771534b8a592f7a4f89d1b433919f4512db902665dbcf6e82d7b3"},"schema_version":"1.0","source":{"id":"2307.04740","kind":"arxiv","version":1}},"canonical_sha256":"0bd8751dce22c211c2d7844666fd54ee599331943ab463642045222473a00aaa","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0bd8751dce22c211c2d7844666fd54ee599331943ab463642045222473a00aaa","first_computed_at":"2026-07-05T06:29:16.810193Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T06:29:16.810193Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"0MiF2Mq+R+21d6gXjAqK4xIlm/JNCoD4FnmU1XxF6w5OiTfBrOmsv6vI230+tLR70Y/H8fldh/QfTQQrNycVCA==","signature_status":"signed_v1","signed_at":"2026-07-05T06:29:16.810603Z","signed_message":"canonical_sha256_bytes"},"source_id":"2307.04740","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2cca6d9ee643b48e23adfd539ce84d789023651e4cba488d1f5c4ab784eb1ba4","sha256:09b0c49c0ebcb71002b1f2868ac59955fddd552f71e9e6da7f25ddf365a91189"],"state_sha256":"a0dd9a5d4a8644f9e43adb7f69f206fc1894de910fa9c190649a612c68daca71"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UzMWmKIHoubMJLqaGsk3Mz/27R/usR/xBPdGnnDvWqXzMf5wG3/e6qQFcOn8KDAsAm2u1QTgHxbpasHkbXzPAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-14T09:25:38.830621Z","bundle_sha256":"2cddaf2bbd774810b698b98c5be82f93923e39c0ea5da0bfef8a51614a46cb25"}}