{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:QGZCOKUTKWT63YMEQEIFWUX7BW","short_pith_number":"pith:QGZCOKUT","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"},"canonical_sha256":"81b2272a9355a7ede18481105b52ff0d83ca75def5acf4048338fcef89a3b7a2","source":{"kind":"arxiv","id":"1311.1644","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1311.1644","created_at":"2026-05-18T03:07:43Z"},{"alias_kind":"arxiv_version","alias_value":"1311.1644v1","created_at":"2026-05-18T03:07:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1311.1644","created_at":"2026-05-18T03:07:43Z"},{"alias_kind":"pith_short_12","alias_value":"QGZCOKUTKWT6","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_16","alias_value":"QGZCOKUTKWT63YME","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_8","alias_value":"QGZCOKUT","created_at":"2026-05-18T12:27:57Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:QGZCOKUTKWT63YMEQEIFWUX7BW","target":"record","payload":{"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"},"canonical_sha256":"81b2272a9355a7ede18481105b52ff0d83ca75def5acf4048338fcef89a3b7a2","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"},"source_kind":"arxiv","source_id":"1311.1644","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-18T03:07:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MoL5UnYZsFGKsJ/A7VbVU/ERETLDvMJBJV4Zee5GRb3kDqPef9F1KmN+XjrNLfZSrIKZPP6QyMSbfaVO8yhyBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T22:10:35.734101Z"},"content_sha256":"e671e147000ecf8845a76adf41a4ca4227be73839f4bea86e7415220c89bade7","schema_version":"1.0","event_id":"sha256:e671e147000ecf8845a76adf41a4ca4227be73839f4bea86e7415220c89bade7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:QGZCOKUTKWT63YMEQEIFWUX7BW","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:07:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"K1JxNsED4DcRBxcXY8CCAjyLFmpkS+HcjwNtmYteivyGN3HzvrbOwuvTWJipcG5KNbRsmf6YGq2370dCSxPXAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T22:10:35.734463Z"},"content_sha256":"c4f2d6176c6f5c9e37cd0fb9affd7f9a067a1615cf02a20bc59f8243c63ab862","schema_version":"1.0","event_id":"sha256:c4f2d6176c6f5c9e37cd0fb9affd7f9a067a1615cf02a20bc59f8243c63ab862"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QGZCOKUTKWT63YMEQEIFWUX7BW/bundle.json","state_url":"https://pith.science/pith/QGZCOKUTKWT63YMEQEIFWUX7BW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QGZCOKUTKWT63YMEQEIFWUX7BW/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-06-03T22:10:35Z","links":{"resolver":"https://pith.science/pith/QGZCOKUTKWT63YMEQEIFWUX7BW","bundle":"https://pith.science/pith/QGZCOKUTKWT63YMEQEIFWUX7BW/bundle.json","state":"https://pith.science/pith/QGZCOKUTKWT63YMEQEIFWUX7BW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QGZCOKUTKWT63YMEQEIFWUX7BW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:QGZCOKUTKWT63YMEQEIFWUX7BW","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":"80648a71bc21135610a9fef8856fbbfc753b56ebc476f7c328981d66cedb6b87","cross_cats_sorted":["math.OC","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2013-11-07T11:33:14Z","title_canon_sha256":"7b72c1fe4c4c9153c8e91f29a19269e56ae6c0d472f37013f2c1be4cd8782fd9"},"schema_version":"1.0","source":{"id":"1311.1644","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1311.1644","created_at":"2026-05-18T03:07:43Z"},{"alias_kind":"arxiv_version","alias_value":"1311.1644v1","created_at":"2026-05-18T03:07:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1311.1644","created_at":"2026-05-18T03:07:43Z"},{"alias_kind":"pith_short_12","alias_value":"QGZCOKUTKWT6","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_16","alias_value":"QGZCOKUTKWT63YME","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_8","alias_value":"QGZCOKUT","created_at":"2026-05-18T12:27:57Z"}],"graph_snapshots":[{"event_id":"sha256:c4f2d6176c6f5c9e37cd0fb9affd7f9a067a1615cf02a20bc59f8243c63ab862","target":"graph","created_at":"2026-05-18T03:07:43Z","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":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Matan Gavish, Moshe Dubiner, Yoram Singer","cross_cats":["math.OC","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2013-11-07T11:33:14Z","title":"The Maximum Entropy Relaxation Path"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1311.1644","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:e671e147000ecf8845a76adf41a4ca4227be73839f4bea86e7415220c89bade7","target":"record","created_at":"2026-05-18T03:07:43Z","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":"80648a71bc21135610a9fef8856fbbfc753b56ebc476f7c328981d66cedb6b87","cross_cats_sorted":["math.OC","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2013-11-07T11:33:14Z","title_canon_sha256":"7b72c1fe4c4c9153c8e91f29a19269e56ae6c0d472f37013f2c1be4cd8782fd9"},"schema_version":"1.0","source":{"id":"1311.1644","kind":"arxiv","version":1}},"canonical_sha256":"81b2272a9355a7ede18481105b52ff0d83ca75def5acf4048338fcef89a3b7a2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"81b2272a9355a7ede18481105b52ff0d83ca75def5acf4048338fcef89a3b7a2","first_computed_at":"2026-05-18T03:07:43.731056Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:07:43.731056Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"SZ0oVN4605gANsgXt2SpHUbEo8jmoX4FthS8pwHy7iY+yHzalhl/mS533iQFWttQI2c7RSx7Mcyei3997vlOCg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:07:43.731495Z","signed_message":"canonical_sha256_bytes"},"source_id":"1311.1644","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e671e147000ecf8845a76adf41a4ca4227be73839f4bea86e7415220c89bade7","sha256:c4f2d6176c6f5c9e37cd0fb9affd7f9a067a1615cf02a20bc59f8243c63ab862"],"state_sha256":"e27312d36dc1b7c00453edd86f1beac6cc774f1c081a750944702ba9785746d1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3UTKi++XacP1fYy69DCUOw8BVK4e/w+0Pr0F8uHPMToem0HT/0nzXFqJE3p1lvCDVWqqjYBllFedzmE1bhetBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T22:10:35.736479Z","bundle_sha256":"2e5d524ad83fb87bb36e9f0e706a78d92a2b98a0856b23e7e2cf66d849529787"}}