{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:JPKIDMFIPAUSMCQENG2WJ5IURW","short_pith_number":"pith:JPKIDMFI","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"},"canonical_sha256":"4bd481b0a87829260a0469b564f5148db0dd593d35c845e6969c59ff24309f0e","source":{"kind":"arxiv","id":"2605.15017","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.15017","created_at":"2026-05-17T23:38:54Z"},{"alias_kind":"arxiv_version","alias_value":"2605.15017v1","created_at":"2026-05-17T23:38:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.15017","created_at":"2026-05-17T23:38:54Z"},{"alias_kind":"pith_short_12","alias_value":"JPKIDMFIPAUS","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"JPKIDMFIPAUSMCQE","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"JPKIDMFI","created_at":"2026-05-18T12:33:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:JPKIDMFIPAUSMCQENG2WJ5IURW","target":"record","payload":{"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"},"canonical_sha256":"4bd481b0a87829260a0469b564f5148db0dd593d35c845e6969c59ff24309f0e","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"},"source_kind":"arxiv","source_id":"2605.15017","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-05-17T23:38:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GZMNybWvSYOPI2OBqt0po99i6vSiXVolRJrM1DX1b39VVqeA/v0NeZPMzgn+VzPS7IPj00mN5wM+4EckYNkqDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T20:59:24.180043Z"},"content_sha256":"db7e892a71bf1839700f8f3a8021d12b372007391ebca9c6aa86e5935f8fd42f","schema_version":"1.0","event_id":"sha256:db7e892a71bf1839700f8f3a8021d12b372007391ebca9c6aa86e5935f8fd42f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:JPKIDMFIPAUSMCQENG2WJ5IURW","target":"graph","payload":{"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"},"verdict_id":"99a492e2-18d2-483b-8991-6a133a747be7"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:38:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XAFYko67mbZQWtJEdwo4rp18P/qMkhqDoUNOsh0kjuTLJqzS7Ux5e3xbbBd6O9xui2iYpTxh92yi/EIaY2nsAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T20:59:24.180918Z"},"content_sha256":"249aa11d896ae9cb252ce1293f98ed297a37cf7bff16e3a760e4e460a30ee134","schema_version":"1.0","event_id":"sha256:249aa11d896ae9cb252ce1293f98ed297a37cf7bff16e3a760e4e460a30ee134"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JPKIDMFIPAUSMCQENG2WJ5IURW/bundle.json","state_url":"https://pith.science/pith/JPKIDMFIPAUSMCQENG2WJ5IURW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JPKIDMFIPAUSMCQENG2WJ5IURW/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-05-25T20:59:24Z","links":{"resolver":"https://pith.science/pith/JPKIDMFIPAUSMCQENG2WJ5IURW","bundle":"https://pith.science/pith/JPKIDMFIPAUSMCQENG2WJ5IURW/bundle.json","state":"https://pith.science/pith/JPKIDMFIPAUSMCQENG2WJ5IURW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JPKIDMFIPAUSMCQENG2WJ5IURW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:JPKIDMFIPAUSMCQENG2WJ5IURW","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":"4c7b3826caafc71df2598e6749e3d81434083f8bd0d1667856d7a050cbacac3e","cross_cats_sorted":["math.OC","math.SP"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-05-14T16:18:40Z","title_canon_sha256":"2520e2583bbaa0d3f97b87a8c8df3f4c2399a943e06e47b1bc60f7509deb3777"},"schema_version":"1.0","source":{"id":"2605.15017","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.15017","created_at":"2026-05-17T23:38:54Z"},{"alias_kind":"arxiv_version","alias_value":"2605.15017v1","created_at":"2026-05-17T23:38:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.15017","created_at":"2026-05-17T23:38:54Z"},{"alias_kind":"pith_short_12","alias_value":"JPKIDMFIPAUS","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"JPKIDMFIPAUSMCQE","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"JPKIDMFI","created_at":"2026-05-18T12:33:37Z"}],"graph_snapshots":[{"event_id":"sha256:249aa11d896ae9cb252ce1293f98ed297a37cf7bff16e3a760e4e460a30ee134","target":"graph","created_at":"2026-05-17T23:38:54Z","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":4,"items":[{"attestation":"unclaimed","claim_id":"C1","kind":"strongest_claim","source":"verdict.strongest_claim","status":"machine_extracted","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."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","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."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","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."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"A single eigenvector certifies conformal rigidity for vertex-transitive graphs and similar symmetric ones."}],"snapshot_sha256":"5f5ea48f2e2e73db964e35c897d9c96f565f3ec024f8347e04dc8e2486e938bb"},"formal_canon":{"evidence_count":2,"snapshot_sha256":"71ee0c2b90362e3925077cde95aa42fbd88e76d5eb60202e8c309d565654cfb0"},"paper":{"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 ","authors_text":"Andrew Niu","cross_cats":["math.OC","math.SP"],"headline":"A single eigenvector certifies conformal rigidity for vertex-transitive graphs and similar symmetric ones.","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-05-14T16:18:40Z","title":"Conformal Rigidity of Graphs: Subdifferentials and Orbit-Isometries"},"references":{"count":48,"internal_anchors":0,"resolved_work":48,"sample":[{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":1,"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","year":2025},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":2,"title":"Laugesen.Symmetrization in analysis","work_id":"0f726880-0e09-482c-8863-a258b4215604","year":2019},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":3,"title":"MPS/SIAM Series on Optimization","work_id":"a58e1014-1aed-4144-b235-f7285425d0b6","year":2001},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":4,"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","year":2024},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":5,"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","year":1998}],"snapshot_sha256":"ff4252c97ae79400a3362172b70000fb64e8fa49b346dd7a486d7c7f5bd712b0"},"source":{"id":"2605.15017","kind":"arxiv","version":1},"verdict":{"created_at":"2026-05-15T03:04:25.095617Z","id":"99a492e2-18d2-483b-8991-6a133a747be7","model_set":{"reader":"grok-4.3"},"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","pith_extraction_headline":"A single eigenvector certifies conformal rigidity for vertex-transitive graphs and similar symmetric ones.","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.","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."}},"verdict_id":"99a492e2-18d2-483b-8991-6a133a747be7"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:db7e892a71bf1839700f8f3a8021d12b372007391ebca9c6aa86e5935f8fd42f","target":"record","created_at":"2026-05-17T23:38:54Z","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":"4c7b3826caafc71df2598e6749e3d81434083f8bd0d1667856d7a050cbacac3e","cross_cats_sorted":["math.OC","math.SP"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-05-14T16:18:40Z","title_canon_sha256":"2520e2583bbaa0d3f97b87a8c8df3f4c2399a943e06e47b1bc60f7509deb3777"},"schema_version":"1.0","source":{"id":"2605.15017","kind":"arxiv","version":1}},"canonical_sha256":"4bd481b0a87829260a0469b564f5148db0dd593d35c845e6969c59ff24309f0e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4bd481b0a87829260a0469b564f5148db0dd593d35c845e6969c59ff24309f0e","first_computed_at":"2026-05-17T23:38:54.716976Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:38:54.716976Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"cFSN8IDJy3cGaYQeOVwji2kUkH3lSjXeEcruNwAPsG9KoqpyxNkcEry0dqwzdHVtXaqIASduOCVYdMV6bFh4Dw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:38:54.717526Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.15017","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:db7e892a71bf1839700f8f3a8021d12b372007391ebca9c6aa86e5935f8fd42f","sha256:249aa11d896ae9cb252ce1293f98ed297a37cf7bff16e3a760e4e460a30ee134"],"state_sha256":"974b975f433774a9caab1cfd0e5111d35dfa3a7038ac5a45bdd74836034566a5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oykB4J/XAigXDs+xukY1Rkrg8P0unHXqInuRau53UbwOqP25Z7Ma761iIeHLBgDGfV8VJe2/YTLoXgmfsEY5CQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T20:59:24.185013Z","bundle_sha256":"c2edfdb966a5b4ae19763aa1cc841d4269b8505217d7bfc2f28852af8486e6b4"}}