{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:YLFKVKANL7WS6NDOLUMDRF6ZF2","short_pith_number":"pith:YLFKVKAN","schema_version":"1.0","canonical_sha256":"c2caaaa80d5fed2f346e5d183897d92e9b9ade9ad377f35a179e16ecb3d7da88","source":{"kind":"arxiv","id":"2506.02652","version":1},"attestation_state":"computed","paper":{"title":"Not every graph can be reconstructed from its boundary distance matrix","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Ignacio M. Pelayo, Jos\\'e C\\'aceres","submitted_at":"2025-06-03T09:04:04Z","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  In a recent paper [doi.org/10.7151/dmgt.2567], it was shown that if a graph $G$ is either a block graph or a unicyclic graph, then $"},"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":"2506.02652","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"math.CO","submitted_at":"2025-06-03T09:04:04Z","cross_cats_sorted":[],"title_canon_sha256":"f7505de83070cb2927591dc0d7d17d6682e318e5c0c75610b35025bc75b2a847","abstract_canon_sha256":"dd801764b43fbfa8c426968a9127cd950943698d038d0b5d8b3d481cb750d182"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:15:05.959379Z","signature_b64":"8dSNq3SiJb7HoWokfg0HEhAiwwTUASRhBI3nkbDTdGGOstpstF3lfjZNwZId2UIdGsHn+hjd/wuXN3q9PjdZBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c2caaaa80d5fed2f346e5d183897d92e9b9ade9ad377f35a179e16ecb3d7da88","last_reissued_at":"2026-07-05T11:15:05.958862Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:15:05.958862Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Not every graph can be reconstructed from its boundary distance matrix","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Ignacio M. Pelayo, Jos\\'e C\\'aceres","submitted_at":"2025-06-03T09:04:04Z","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  In a recent paper [doi.org/10.7151/dmgt.2567], it was shown that if a graph $G$ is either a block graph or a unicyclic graph, then $"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.02652","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/2506.02652/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2506.02652","created_at":"2026-07-05T11:15:05.958928+00:00"},{"alias_kind":"arxiv_version","alias_value":"2506.02652v1","created_at":"2026-07-05T11:15:05.958928+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.02652","created_at":"2026-07-05T11:15:05.958928+00:00"},{"alias_kind":"pith_short_12","alias_value":"YLFKVKANL7WS","created_at":"2026-07-05T11:15:05.958928+00:00"},{"alias_kind":"pith_short_16","alias_value":"YLFKVKANL7WS6NDO","created_at":"2026-07-05T11:15:05.958928+00:00"},{"alias_kind":"pith_short_8","alias_value":"YLFKVKAN","created_at":"2026-07-05T11:15:05.958928+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/YLFKVKANL7WS6NDOLUMDRF6ZF2","json":"https://pith.science/pith/YLFKVKANL7WS6NDOLUMDRF6ZF2.json","graph_json":"https://pith.science/api/pith-number/YLFKVKANL7WS6NDOLUMDRF6ZF2/graph.json","events_json":"https://pith.science/api/pith-number/YLFKVKANL7WS6NDOLUMDRF6ZF2/events.json","paper":"https://pith.science/paper/YLFKVKAN"},"agent_actions":{"view_html":"https://pith.science/pith/YLFKVKANL7WS6NDOLUMDRF6ZF2","download_json":"https://pith.science/pith/YLFKVKANL7WS6NDOLUMDRF6ZF2.json","view_paper":"https://pith.science/paper/YLFKVKAN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2506.02652&json=true","fetch_graph":"https://pith.science/api/pith-number/YLFKVKANL7WS6NDOLUMDRF6ZF2/graph.json","fetch_events":"https://pith.science/api/pith-number/YLFKVKANL7WS6NDOLUMDRF6ZF2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YLFKVKANL7WS6NDOLUMDRF6ZF2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YLFKVKANL7WS6NDOLUMDRF6ZF2/action/storage_attestation","attest_author":"https://pith.science/pith/YLFKVKANL7WS6NDOLUMDRF6ZF2/action/author_attestation","sign_citation":"https://pith.science/pith/YLFKVKANL7WS6NDOLUMDRF6ZF2/action/citation_signature","submit_replication":"https://pith.science/pith/YLFKVKANL7WS6NDOLUMDRF6ZF2/action/replication_record"}},"created_at":"2026-07-05T11:15:05.958928+00:00","updated_at":"2026-07-05T11:15:05.958928+00:00"}