{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:QGZCOKUTKWT63YMEQEIFWUX7BW","short_pith_number":"pith:QGZCOKUT","schema_version":"1.0","canonical_sha256":"81b2272a9355a7ede18481105b52ff0d83ca75def5acf4048338fcef89a3b7a2","source":{"kind":"arxiv","id":"1311.1644","version":1},"attestation_state":"computed","paper":{"title":"The Maximum Entropy Relaxation Path","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC","stat.ML"],"primary_cat":"cs.LG","authors_text":"Matan Gavish, Moshe Dubiner, Yoram Singer","submitted_at":"2013-11-07T11:33:14Z","abstract_excerpt":"The relaxed maximum entropy problem is concerned with finding a probability distribution on a finite set that minimizes the relative entropy to a given prior distribution, while satisfying relaxed max-norm constraints with respect to a third observed multinomial distribution. We study the entire relaxation path for this problem in detail. We show existence and a geometric description of the relaxation path. Specifically, we show that the maximum entropy relaxation path admits a planar geometric description as an increasing, piecewise linear function in the inverse relaxation parameter. We deri"},"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":"1311.1644","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2013-11-07T11:33:14Z","cross_cats_sorted":["math.OC","stat.ML"],"title_canon_sha256":"7b72c1fe4c4c9153c8e91f29a19269e56ae6c0d472f37013f2c1be4cd8782fd9","abstract_canon_sha256":"80648a71bc21135610a9fef8856fbbfc753b56ebc476f7c328981d66cedb6b87"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:07:43.731495Z","signature_b64":"SZ0oVN4605gANsgXt2SpHUbEo8jmoX4FthS8pwHy7iY+yHzalhl/mS533iQFWttQI2c7RSx7Mcyei3997vlOCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"81b2272a9355a7ede18481105b52ff0d83ca75def5acf4048338fcef89a3b7a2","last_reissued_at":"2026-05-18T03:07:43.731056Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:07:43.731056Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Maximum Entropy Relaxation Path","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC","stat.ML"],"primary_cat":"cs.LG","authors_text":"Matan Gavish, Moshe Dubiner, Yoram Singer","submitted_at":"2013-11-07T11:33:14Z","abstract_excerpt":"The relaxed maximum entropy problem is concerned with finding a probability distribution on a finite set that minimizes the relative entropy to a given prior distribution, while satisfying relaxed max-norm constraints with respect to a third observed multinomial distribution. We study the entire relaxation path for this problem in detail. We show existence and a geometric description of the relaxation path. Specifically, we show that the maximum entropy relaxation path admits a planar geometric description as an increasing, piecewise linear function in the inverse relaxation parameter. We deri"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1311.1644","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"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":"1311.1644","created_at":"2026-05-18T03:07:43.731126+00:00"},{"alias_kind":"arxiv_version","alias_value":"1311.1644v1","created_at":"2026-05-18T03:07:43.731126+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1311.1644","created_at":"2026-05-18T03:07:43.731126+00:00"},{"alias_kind":"pith_short_12","alias_value":"QGZCOKUTKWT6","created_at":"2026-05-18T12:27:57.521954+00:00"},{"alias_kind":"pith_short_16","alias_value":"QGZCOKUTKWT63YME","created_at":"2026-05-18T12:27:57.521954+00:00"},{"alias_kind":"pith_short_8","alias_value":"QGZCOKUT","created_at":"2026-05-18T12:27:57.521954+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/QGZCOKUTKWT63YMEQEIFWUX7BW","json":"https://pith.science/pith/QGZCOKUTKWT63YMEQEIFWUX7BW.json","graph_json":"https://pith.science/api/pith-number/QGZCOKUTKWT63YMEQEIFWUX7BW/graph.json","events_json":"https://pith.science/api/pith-number/QGZCOKUTKWT63YMEQEIFWUX7BW/events.json","paper":"https://pith.science/paper/QGZCOKUT"},"agent_actions":{"view_html":"https://pith.science/pith/QGZCOKUTKWT63YMEQEIFWUX7BW","download_json":"https://pith.science/pith/QGZCOKUTKWT63YMEQEIFWUX7BW.json","view_paper":"https://pith.science/paper/QGZCOKUT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1311.1644&json=true","fetch_graph":"https://pith.science/api/pith-number/QGZCOKUTKWT63YMEQEIFWUX7BW/graph.json","fetch_events":"https://pith.science/api/pith-number/QGZCOKUTKWT63YMEQEIFWUX7BW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QGZCOKUTKWT63YMEQEIFWUX7BW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QGZCOKUTKWT63YMEQEIFWUX7BW/action/storage_attestation","attest_author":"https://pith.science/pith/QGZCOKUTKWT63YMEQEIFWUX7BW/action/author_attestation","sign_citation":"https://pith.science/pith/QGZCOKUTKWT63YMEQEIFWUX7BW/action/citation_signature","submit_replication":"https://pith.science/pith/QGZCOKUTKWT63YMEQEIFWUX7BW/action/replication_record"}},"created_at":"2026-05-18T03:07:43.731126+00:00","updated_at":"2026-05-18T03:07:43.731126+00:00"}