{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:HQ3GR3A3UFEINIDWVNUB5DH2OP","short_pith_number":"pith:HQ3GR3A3","schema_version":"1.0","canonical_sha256":"3c3668ec1ba14886a076ab681e8cfa73eb93a3f50fe6c06901ca5f5fff1ed5b1","source":{"kind":"arxiv","id":"2312.08649","version":3},"attestation_state":"computed","paper":{"title":"A decomposition theorem for balanced measures","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Ansel Goh, Gregory Baimetov, Owen Jacobs, Raymond Guo, Ryan Bushling, Sean Lee","submitted_at":"2023-12-14T04:14:15Z","abstract_excerpt":"Let $G = (V,E)$ be a connected graph. A probability measure $\\mu$ on $V$ is called \"balanced\" if it has the following property: if $T_\\mu(v)$ denotes the \"earth mover's\" cost of transporting all the mass of $\\mu$ from all over the graph to the vertex $v$, then $T_\\mu$ attains its global maximum at each point in the support of $\\mu$. We prove a decomposition result that characterizes balanced measures as convex combinations of suitable \"extremal\" balanced measures that we call \"basic.\" An upper bound on the number of basic balanced measures on $G$ follows, and an example shows that this estimat"},"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":"2312.08649","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"math.CO","submitted_at":"2023-12-14T04:14:15Z","cross_cats_sorted":[],"title_canon_sha256":"243ca4769e5257a103f4ac064b21b0c300ab2b6b48de2941668047eb474f7e9c","abstract_canon_sha256":"7f5047f50a0e619e12b7c9f319a0b93443a585766103b5aaa61bd35206d160bc"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:58:57.192221Z","signature_b64":"nrUchGtbhpcLf1AirwHBSsqSy19rQu0g9xZ9td3L11OnfzIvtvF6nh26rza4JigMmyOwlPuUy3dZZauyXH/ZBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3c3668ec1ba14886a076ab681e8cfa73eb93a3f50fe6c06901ca5f5fff1ed5b1","last_reissued_at":"2026-07-05T09:58:57.191653Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:58:57.191653Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A decomposition theorem for balanced measures","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Ansel Goh, Gregory Baimetov, Owen Jacobs, Raymond Guo, Ryan Bushling, Sean Lee","submitted_at":"2023-12-14T04:14:15Z","abstract_excerpt":"Let $G = (V,E)$ be a connected graph. A probability measure $\\mu$ on $V$ is called \"balanced\" if it has the following property: if $T_\\mu(v)$ denotes the \"earth mover's\" cost of transporting all the mass of $\\mu$ from all over the graph to the vertex $v$, then $T_\\mu$ attains its global maximum at each point in the support of $\\mu$. We prove a decomposition result that characterizes balanced measures as convex combinations of suitable \"extremal\" balanced measures that we call \"basic.\" An upper bound on the number of basic balanced measures on $G$ follows, and an example shows that this estimat"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2312.08649","kind":"arxiv","version":3},"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/2312.08649/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":"2312.08649","created_at":"2026-07-05T09:58:57.191736+00:00"},{"alias_kind":"arxiv_version","alias_value":"2312.08649v3","created_at":"2026-07-05T09:58:57.191736+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2312.08649","created_at":"2026-07-05T09:58:57.191736+00:00"},{"alias_kind":"pith_short_12","alias_value":"HQ3GR3A3UFEI","created_at":"2026-07-05T09:58:57.191736+00:00"},{"alias_kind":"pith_short_16","alias_value":"HQ3GR3A3UFEINIDW","created_at":"2026-07-05T09:58:57.191736+00:00"},{"alias_kind":"pith_short_8","alias_value":"HQ3GR3A3","created_at":"2026-07-05T09:58:57.191736+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/HQ3GR3A3UFEINIDWVNUB5DH2OP","json":"https://pith.science/pith/HQ3GR3A3UFEINIDWVNUB5DH2OP.json","graph_json":"https://pith.science/api/pith-number/HQ3GR3A3UFEINIDWVNUB5DH2OP/graph.json","events_json":"https://pith.science/api/pith-number/HQ3GR3A3UFEINIDWVNUB5DH2OP/events.json","paper":"https://pith.science/paper/HQ3GR3A3"},"agent_actions":{"view_html":"https://pith.science/pith/HQ3GR3A3UFEINIDWVNUB5DH2OP","download_json":"https://pith.science/pith/HQ3GR3A3UFEINIDWVNUB5DH2OP.json","view_paper":"https://pith.science/paper/HQ3GR3A3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2312.08649&json=true","fetch_graph":"https://pith.science/api/pith-number/HQ3GR3A3UFEINIDWVNUB5DH2OP/graph.json","fetch_events":"https://pith.science/api/pith-number/HQ3GR3A3UFEINIDWVNUB5DH2OP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HQ3GR3A3UFEINIDWVNUB5DH2OP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HQ3GR3A3UFEINIDWVNUB5DH2OP/action/storage_attestation","attest_author":"https://pith.science/pith/HQ3GR3A3UFEINIDWVNUB5DH2OP/action/author_attestation","sign_citation":"https://pith.science/pith/HQ3GR3A3UFEINIDWVNUB5DH2OP/action/citation_signature","submit_replication":"https://pith.science/pith/HQ3GR3A3UFEINIDWVNUB5DH2OP/action/replication_record"}},"created_at":"2026-07-05T09:58:57.191736+00:00","updated_at":"2026-07-05T09:58:57.191736+00:00"}