{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:3GUOU2UOIZJ5MNN7NBFEHUCYYI","short_pith_number":"pith:3GUOU2UO","schema_version":"1.0","canonical_sha256":"d9a8ea6a8e4653d635bf684a43d058c238187ff297c50c1b50efd6af7d925489","source":{"kind":"arxiv","id":"2308.16851","version":2},"attestation_state":"computed","paper":{"title":"Stress-linked pairs of vertices and the generic stress matroid","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.AG","math.MG"],"primary_cat":"math.CO","authors_text":"D\\'aniel Garamv\\\"olgyi","submitted_at":"2023-08-31T16:47:19Z","abstract_excerpt":"Given a graph $G$ and a mapping $p : V(G) \\to \\mathbb{R}^d$, we say that the pair $(G,p)$ is a ($d$-dimensional) realization of $G$. Two realizations $(G,p)$ and $(G,q)$ are equivalent if each of the point pairs corresponding to the edges of $G$ have the same distance under the embeddings $p$ and $q$. A pair of vertices $\\{u,v\\}$ is globally linked in $G$ in $\\mathbb{R}^d$ if for every generic realization $(G,p)$ and every equivalent realization $(G,q)$, $(G+uv,p)$ and $(G+uv,q)$ are also equivalent.\n  In this paper, we introduce and investigate the notion of $d$-stress-linked vertex pairs. Ro"},"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":"2308.16851","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2023-08-31T16:47:19Z","cross_cats_sorted":["math.AG","math.MG"],"title_canon_sha256":"e79ed92764b2e44bcbe30baeb9b6c2cef1b6024913c155a3512558894ecc1cac","abstract_canon_sha256":"e913fef2090be457603a217bab6d19615d43c69547d21fb4861666506b31f018"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:56:47.331626Z","signature_b64":"kr3KOzWTzy9/+5d8ls5K1m6KLeE50a/XU93FwxnLABLlAJikNULfLijo9raloyWj3tb4ybdhmxnTQIewfTSyAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d9a8ea6a8e4653d635bf684a43d058c238187ff297c50c1b50efd6af7d925489","last_reissued_at":"2026-07-05T11:56:47.331160Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:56:47.331160Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Stress-linked pairs of vertices and the generic stress matroid","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.AG","math.MG"],"primary_cat":"math.CO","authors_text":"D\\'aniel Garamv\\\"olgyi","submitted_at":"2023-08-31T16:47:19Z","abstract_excerpt":"Given a graph $G$ and a mapping $p : V(G) \\to \\mathbb{R}^d$, we say that the pair $(G,p)$ is a ($d$-dimensional) realization of $G$. Two realizations $(G,p)$ and $(G,q)$ are equivalent if each of the point pairs corresponding to the edges of $G$ have the same distance under the embeddings $p$ and $q$. A pair of vertices $\\{u,v\\}$ is globally linked in $G$ in $\\mathbb{R}^d$ if for every generic realization $(G,p)$ and every equivalent realization $(G,q)$, $(G+uv,p)$ and $(G+uv,q)$ are also equivalent.\n  In this paper, we introduce and investigate the notion of $d$-stress-linked vertex pairs. Ro"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2308.16851","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2308.16851/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":"2308.16851","created_at":"2026-07-05T11:56:47.331217+00:00"},{"alias_kind":"arxiv_version","alias_value":"2308.16851v2","created_at":"2026-07-05T11:56:47.331217+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2308.16851","created_at":"2026-07-05T11:56:47.331217+00:00"},{"alias_kind":"pith_short_12","alias_value":"3GUOU2UOIZJ5","created_at":"2026-07-05T11:56:47.331217+00:00"},{"alias_kind":"pith_short_16","alias_value":"3GUOU2UOIZJ5MNN7","created_at":"2026-07-05T11:56:47.331217+00:00"},{"alias_kind":"pith_short_8","alias_value":"3GUOU2UO","created_at":"2026-07-05T11:56:47.331217+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2509.03150","citing_title":"Sparsity, Stress-Independence and Globally Linked Pairs in Graph Rigidity Theory","ref_index":3,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/3GUOU2UOIZJ5MNN7NBFEHUCYYI","json":"https://pith.science/pith/3GUOU2UOIZJ5MNN7NBFEHUCYYI.json","graph_json":"https://pith.science/api/pith-number/3GUOU2UOIZJ5MNN7NBFEHUCYYI/graph.json","events_json":"https://pith.science/api/pith-number/3GUOU2UOIZJ5MNN7NBFEHUCYYI/events.json","paper":"https://pith.science/paper/3GUOU2UO"},"agent_actions":{"view_html":"https://pith.science/pith/3GUOU2UOIZJ5MNN7NBFEHUCYYI","download_json":"https://pith.science/pith/3GUOU2UOIZJ5MNN7NBFEHUCYYI.json","view_paper":"https://pith.science/paper/3GUOU2UO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2308.16851&json=true","fetch_graph":"https://pith.science/api/pith-number/3GUOU2UOIZJ5MNN7NBFEHUCYYI/graph.json","fetch_events":"https://pith.science/api/pith-number/3GUOU2UOIZJ5MNN7NBFEHUCYYI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3GUOU2UOIZJ5MNN7NBFEHUCYYI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3GUOU2UOIZJ5MNN7NBFEHUCYYI/action/storage_attestation","attest_author":"https://pith.science/pith/3GUOU2UOIZJ5MNN7NBFEHUCYYI/action/author_attestation","sign_citation":"https://pith.science/pith/3GUOU2UOIZJ5MNN7NBFEHUCYYI/action/citation_signature","submit_replication":"https://pith.science/pith/3GUOU2UOIZJ5MNN7NBFEHUCYYI/action/replication_record"}},"created_at":"2026-07-05T11:56:47.331217+00:00","updated_at":"2026-07-05T11:56:47.331217+00:00"}