{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:JPKIDMFIPAUSMCQENG2WJ5IURW","short_pith_number":"pith:JPKIDMFI","schema_version":"1.0","canonical_sha256":"4bd481b0a87829260a0469b564f5148db0dd593d35c845e6969c59ff24309f0e","source":{"kind":"arxiv","id":"2605.15017","version":1},"attestation_state":"computed","paper":{"title":"Conformal Rigidity of Graphs: Subdifferentials and Orbit-Isometries","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"A single eigenvector certifies conformal rigidity for vertex-transitive graphs and similar symmetric ones.","cross_cats":["math.OC","math.SP"],"primary_cat":"math.CO","authors_text":"Andrew Niu","submitted_at":"2026-05-14T16:18:40Z","abstract_excerpt":"A connected undirected graph $G = (V,E)$ is lower conformally rigid if uniform edge weights maximize the second smallest Laplacian eigenvalue $\\lambda_2(w)$ over all normalized edge weights $w$, and upper conformally rigid if uniform edge weights minimize the largest eigenvalue $\\lambda_n(w)$ over all normalized edge weights; $G$ is conformally rigid if it is lower or upper conformally rigid. This paper establishes a new framework for conformal rigidity through the language of subdifferentials, unifying the variational perspective on eigenvalue optimization with the geometry of edge-isometric "},"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":true,"formal_links_present":true},"canonical_record":{"source":{"id":"2605.15017","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-05-14T16:18:40Z","cross_cats_sorted":["math.OC","math.SP"],"title_canon_sha256":"2520e2583bbaa0d3f97b87a8c8df3f4c2399a943e06e47b1bc60f7509deb3777","abstract_canon_sha256":"4c7b3826caafc71df2598e6749e3d81434083f8bd0d1667856d7a050cbacac3e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:38:54.717526Z","signature_b64":"cFSN8IDJy3cGaYQeOVwji2kUkH3lSjXeEcruNwAPsG9KoqpyxNkcEry0dqwzdHVtXaqIASduOCVYdMV6bFh4Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4bd481b0a87829260a0469b564f5148db0dd593d35c845e6969c59ff24309f0e","last_reissued_at":"2026-05-17T23:38:54.716976Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:38:54.716976Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Conformal Rigidity of Graphs: Subdifferentials and Orbit-Isometries","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"A single eigenvector certifies conformal rigidity for vertex-transitive graphs and similar symmetric ones.","cross_cats":["math.OC","math.SP"],"primary_cat":"math.CO","authors_text":"Andrew Niu","submitted_at":"2026-05-14T16:18:40Z","abstract_excerpt":"A connected undirected graph $G = (V,E)$ is lower conformally rigid if uniform edge weights maximize the second smallest Laplacian eigenvalue $\\lambda_2(w)$ over all normalized edge weights $w$, and upper conformally rigid if uniform edge weights minimize the largest eigenvalue $\\lambda_n(w)$ over all normalized edge weights; $G$ is conformally rigid if it is lower or upper conformally rigid. This paper establishes a new framework for conformal rigidity through the language of subdifferentials, unifying the variational perspective on eigenvalue optimization with the geometry of edge-isometric "},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"for a large class of graphs, including all vertex-transitive ones, we show that conformal rigidity is certified by a single eigenvector, resolving an open question and explaining the conformal rigidity of previously unexplained graphs.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"The assumption that edge-isometric spectral embeddings characterize conformal rigidity (unified here with the subdifferential perspective) and that the orbit-isometric weakening remains sufficient.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"A subdifferential framework certifies conformal rigidity via orbit-isometric embeddings, reducing the problem for vertex-transitive graphs to a single-eigenvector check and in general to linear feasibility or Gröbner bases.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"A single eigenvector certifies conformal rigidity for vertex-transitive graphs and similar symmetric ones.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"5f5ea48f2e2e73db964e35c897d9c96f565f3ec024f8347e04dc8e2486e938bb"},"source":{"id":"2605.15017","kind":"arxiv","version":1},"verdict":{"id":"99a492e2-18d2-483b-8991-6a133a747be7","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-15T03:04:25.095617Z","strongest_claim":"for a large class of graphs, including all vertex-transitive ones, we show that conformal rigidity is certified by a single eigenvector, resolving an open question and explaining the conformal rigidity of previously unexplained graphs.","one_line_summary":"A subdifferential framework certifies conformal rigidity via orbit-isometric embeddings, reducing the problem for vertex-transitive graphs to a single-eigenvector check and in general to linear feasibility or Gröbner bases.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"The assumption that edge-isometric spectral embeddings characterize conformal rigidity (unified here with the subdifferential perspective) and that the orbit-isometric weakening remains sufficient.","pith_extraction_headline":"A single eigenvector certifies conformal rigidity for vertex-transitive graphs and similar symmetric ones."},"references":{"count":48,"sample":[{"doi":"","year":2025,"title":"Catherine Babecki, Stefan Steinerberger, and Rekha R. Thomas. Spectrahedral geometry of graph sparsifiers.SIAM J. Discrete Math., 39(1):449–483, 2025","work_id":"eac39494-d20b-4d41-bad6-8d3e790ee497","ref_index":1,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2019,"title":"Laugesen.Symmetrization in analysis","work_id":"0f726880-0e09-482c-8863-a258b4215604","ref_index":2,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2001,"title":"MPS/SIAM Series on Optimization","work_id":"a58e1014-1aed-4144-b235-f7285425d0b6","ref_index":3,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2024,"title":"A survey of maximalk-degenerate graphs andk-trees.Theory and Applications of Graphs, 0(1):Article 5, 2024","work_id":"427292b2-4312-4887-bc3b-939f0b49aa3a","ref_index":4,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":1998,"title":"Jacek Bochnak, Michel Coste, and Marie-Fran¸ coise Roy.Real algebraic geometry. Transl. from the French., volume 36 ofErgeb. Math. Grenzgeb., 3. Folge. Berlin: Springer, rev. and updated ed. edition, ","work_id":"e3630e76-c040-45fc-a599-8b98bbc152a0","ref_index":5,"cited_arxiv_id":"","is_internal_anchor":false}],"resolved_work":48,"snapshot_sha256":"ff4252c97ae79400a3362172b70000fb64e8fa49b346dd7a486d7c7f5bd712b0","internal_anchors":0},"formal_canon":{"evidence_count":2,"snapshot_sha256":"71ee0c2b90362e3925077cde95aa42fbd88e76d5eb60202e8c309d565654cfb0"},"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":"2605.15017","created_at":"2026-05-17T23:38:54.717066+00:00"},{"alias_kind":"arxiv_version","alias_value":"2605.15017v1","created_at":"2026-05-17T23:38:54.717066+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.15017","created_at":"2026-05-17T23:38:54.717066+00:00"},{"alias_kind":"pith_short_12","alias_value":"JPKIDMFIPAUS","created_at":"2026-05-18T12:33:37.589309+00:00"},{"alias_kind":"pith_short_16","alias_value":"JPKIDMFIPAUSMCQE","created_at":"2026-05-18T12:33:37.589309+00:00"},{"alias_kind":"pith_short_8","alias_value":"JPKIDMFI","created_at":"2026-05-18T12:33:37.589309+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":2,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/JPKIDMFIPAUSMCQENG2WJ5IURW","json":"https://pith.science/pith/JPKIDMFIPAUSMCQENG2WJ5IURW.json","graph_json":"https://pith.science/api/pith-number/JPKIDMFIPAUSMCQENG2WJ5IURW/graph.json","events_json":"https://pith.science/api/pith-number/JPKIDMFIPAUSMCQENG2WJ5IURW/events.json","paper":"https://pith.science/paper/JPKIDMFI"},"agent_actions":{"view_html":"https://pith.science/pith/JPKIDMFIPAUSMCQENG2WJ5IURW","download_json":"https://pith.science/pith/JPKIDMFIPAUSMCQENG2WJ5IURW.json","view_paper":"https://pith.science/paper/JPKIDMFI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2605.15017&json=true","fetch_graph":"https://pith.science/api/pith-number/JPKIDMFIPAUSMCQENG2WJ5IURW/graph.json","fetch_events":"https://pith.science/api/pith-number/JPKIDMFIPAUSMCQENG2WJ5IURW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JPKIDMFIPAUSMCQENG2WJ5IURW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JPKIDMFIPAUSMCQENG2WJ5IURW/action/storage_attestation","attest_author":"https://pith.science/pith/JPKIDMFIPAUSMCQENG2WJ5IURW/action/author_attestation","sign_citation":"https://pith.science/pith/JPKIDMFIPAUSMCQENG2WJ5IURW/action/citation_signature","submit_replication":"https://pith.science/pith/JPKIDMFIPAUSMCQENG2WJ5IURW/action/replication_record"}},"created_at":"2026-05-17T23:38:54.717066+00:00","updated_at":"2026-05-17T23:38:54.717066+00:00"}