{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:G3D7T2ND3NAUFHVQL4IETXCCUD","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":"1d1dd0ed9058952546c075ef430e24f2e8446db9c21395ae3712412152a223dd","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"math.CO","submitted_at":"2024-04-05T11:49:28Z","title_canon_sha256":"0ec145a503b6017bb9f47b8ee0d56b16a903d376ec9b39843a5c35ce6e2a01e4"},"schema_version":"1.0","source":{"id":"2404.04039","kind":"arxiv","version":8}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2404.04039","created_at":"2026-07-05T09:54:26Z"},{"alias_kind":"arxiv_version","alias_value":"2404.04039v8","created_at":"2026-07-05T09:54:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2404.04039","created_at":"2026-07-05T09:54:26Z"},{"alias_kind":"pith_short_12","alias_value":"G3D7T2ND3NAU","created_at":"2026-07-05T09:54:26Z"},{"alias_kind":"pith_short_16","alias_value":"G3D7T2ND3NAUFHVQ","created_at":"2026-07-05T09:54:26Z"},{"alias_kind":"pith_short_8","alias_value":"G3D7T2ND","created_at":"2026-07-05T09:54:26Z"}],"graph_snapshots":[{"event_id":"sha256:4655527d83144d0abb29aa7097bb76f5e297fe733833955c8294c385cc328f3c","target":"graph","created_at":"2026-07-05T09:54:26Z","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/2404.04039/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"A vertex $v$ of a connected graph $G$ is said to be a boundary vertex of $G$ if for some other vertex $u$ of $G$, no neighbor of $v$ is further away from $u$ than $v$. The boundary $\\partial(G)$ of $G$ is the set of all of its boundary vertices.\n  The boundary distance matrix $\\hat{D}_G$ of a graph $G=([n],E)$ is the square matrix of order $\\kappa$, being $\\kappa$ the order of $\\partial(G)$, such that for every $i,j\\in \\partial(G)$, $[\\hat{D}_G]_{ij}=d_G(i,j)$.\n  Given a square matrix $\\hat{B}$ of order $\\kappa$, we prove under which conditions $\\hat{B}$ is the distance matrix $\\hat{D}_T$ of t","authors_text":"Ignacio M. Pelayo, Jos\\'e C\\'aceres","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"math.CO","submitted_at":"2024-04-05T11:49:28Z","title":"Reconstructing a graph from the distance matrix of its boundary"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2404.04039","kind":"arxiv","version":8},"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:7710179713c649c393762b2f1edd4a8576f88c405e422dfa60dbeb980cc10e6a","target":"record","created_at":"2026-07-05T09:54:26Z","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":"1d1dd0ed9058952546c075ef430e24f2e8446db9c21395ae3712412152a223dd","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"math.CO","submitted_at":"2024-04-05T11:49:28Z","title_canon_sha256":"0ec145a503b6017bb9f47b8ee0d56b16a903d376ec9b39843a5c35ce6e2a01e4"},"schema_version":"1.0","source":{"id":"2404.04039","kind":"arxiv","version":8}},"canonical_sha256":"36c7f9e9a3db41429eb05f1049dc42a0d1b5bc71a1e02372139ae7036cf1dd69","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"36c7f9e9a3db41429eb05f1049dc42a0d1b5bc71a1e02372139ae7036cf1dd69","first_computed_at":"2026-07-05T09:54:26.003237Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:54:26.003237Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"lmRFlHgQP+aj/9fzOLy3PX54TGnQnWlzaBAKg1wLvwzghYjr1qjwzDbvL+boCOn77j76qKCqQkT+PrB3Wz8cCg==","signature_status":"signed_v1","signed_at":"2026-07-05T09:54:26.003669Z","signed_message":"canonical_sha256_bytes"},"source_id":"2404.04039","source_kind":"arxiv","source_version":8}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7710179713c649c393762b2f1edd4a8576f88c405e422dfa60dbeb980cc10e6a","sha256:4655527d83144d0abb29aa7097bb76f5e297fe733833955c8294c385cc328f3c"],"state_sha256":"ec26807daea72f7e5e0c7f7c492664355cdde629b3c10453b7aee71d65d90402"}