{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:GUK22IOLRVRJBEE5Y5OI2QMOQZ","short_pith_number":"pith:GUK22IOL","schema_version":"1.0","canonical_sha256":"3515ad21cb8d6290909dc75c8d418e8640a305b4e03844e9c6af5dd1150d73d4","source":{"kind":"arxiv","id":"2603.19927","version":4},"attestation_state":"computed","paper":{"title":"One-parameter counterexamples to the refined Bessis-Moussa-Villani conjecture","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Hyunho Cha, Jungwoo Lee","submitted_at":"2026-03-20T13:12:03Z","abstract_excerpt":"The Bessis-Moussa-Villani (BMV) conjecture, originating in quantum statistical mechanics, was proved by Stahl after an influential reformulation by Lieb and Seiringer. A later refinement asks whether the normalized average over all words with $n$ letters $A$ and $m$ letters $B$ is always bounded above by $\\mathrm{tr}(A^nB^m)$ and below by $\\mathrm{tr}\\exp(n\\log A+m\\log B)$. We study a specific one-parameter family $(A_x, B_x)$ and show that the correct small-$x$ invariant of a word is not its degree of fragmentation, but a weighted shortest-bridge cost on its cyclic run decomposition. Remarkab"},"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":"2603.19927","kind":"arxiv","version":4},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"quant-ph","submitted_at":"2026-03-20T13:12:03Z","cross_cats_sorted":[],"title_canon_sha256":"a0fb2459673be1b85bbad7ca4deda07ee6d69567096325bb43924ce029159ee5","abstract_canon_sha256":"672fee051eec72a7cd1012c862e2be90792d16e8c33287d8797ad9a297170499"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-28T01:04:38.750784Z","signature_b64":"vjfCVoKQ513iTzFpjMKTDJ5oARLjIPMtBftfSQDBwZhlnfq8wYxV8tWCKQuXhL5mhqmfTgmVLh9rGIKYhOsuBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3515ad21cb8d6290909dc75c8d418e8640a305b4e03844e9c6af5dd1150d73d4","last_reissued_at":"2026-05-28T01:04:38.750036Z","signature_status":"signed_v1","first_computed_at":"2026-05-28T01:04:38.750036Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"One-parameter counterexamples to the refined Bessis-Moussa-Villani conjecture","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Hyunho Cha, Jungwoo Lee","submitted_at":"2026-03-20T13:12:03Z","abstract_excerpt":"The Bessis-Moussa-Villani (BMV) conjecture, originating in quantum statistical mechanics, was proved by Stahl after an influential reformulation by Lieb and Seiringer. A later refinement asks whether the normalized average over all words with $n$ letters $A$ and $m$ letters $B$ is always bounded above by $\\mathrm{tr}(A^nB^m)$ and below by $\\mathrm{tr}\\exp(n\\log A+m\\log B)$. We study a specific one-parameter family $(A_x, B_x)$ and show that the correct small-$x$ invariant of a word is not its degree of fragmentation, but a weighted shortest-bridge cost on its cyclic run decomposition. Remarkab"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2603.19927","kind":"arxiv","version":4},"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/2603.19927/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":"2603.19927","created_at":"2026-05-28T01:04:38.750148+00:00"},{"alias_kind":"arxiv_version","alias_value":"2603.19927v4","created_at":"2026-05-28T01:04:38.750148+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2603.19927","created_at":"2026-05-28T01:04:38.750148+00:00"},{"alias_kind":"pith_short_12","alias_value":"GUK22IOLRVRJ","created_at":"2026-05-28T01:04:38.750148+00:00"},{"alias_kind":"pith_short_16","alias_value":"GUK22IOLRVRJBEE5","created_at":"2026-05-28T01:04:38.750148+00:00"},{"alias_kind":"pith_short_8","alias_value":"GUK22IOL","created_at":"2026-05-28T01:04:38.750148+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2605.17782","citing_title":"On the Failure of the Upper Bound in the Refined BMV Conjecture and a Pinching Correction","ref_index":6,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/GUK22IOLRVRJBEE5Y5OI2QMOQZ","json":"https://pith.science/pith/GUK22IOLRVRJBEE5Y5OI2QMOQZ.json","graph_json":"https://pith.science/api/pith-number/GUK22IOLRVRJBEE5Y5OI2QMOQZ/graph.json","events_json":"https://pith.science/api/pith-number/GUK22IOLRVRJBEE5Y5OI2QMOQZ/events.json","paper":"https://pith.science/paper/GUK22IOL"},"agent_actions":{"view_html":"https://pith.science/pith/GUK22IOLRVRJBEE5Y5OI2QMOQZ","download_json":"https://pith.science/pith/GUK22IOLRVRJBEE5Y5OI2QMOQZ.json","view_paper":"https://pith.science/paper/GUK22IOL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2603.19927&json=true","fetch_graph":"https://pith.science/api/pith-number/GUK22IOLRVRJBEE5Y5OI2QMOQZ/graph.json","fetch_events":"https://pith.science/api/pith-number/GUK22IOLRVRJBEE5Y5OI2QMOQZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GUK22IOLRVRJBEE5Y5OI2QMOQZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GUK22IOLRVRJBEE5Y5OI2QMOQZ/action/storage_attestation","attest_author":"https://pith.science/pith/GUK22IOLRVRJBEE5Y5OI2QMOQZ/action/author_attestation","sign_citation":"https://pith.science/pith/GUK22IOLRVRJBEE5Y5OI2QMOQZ/action/citation_signature","submit_replication":"https://pith.science/pith/GUK22IOLRVRJBEE5Y5OI2QMOQZ/action/replication_record"}},"created_at":"2026-05-28T01:04:38.750148+00:00","updated_at":"2026-05-28T01:04:38.750148+00:00"}