{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:E5ZN77UQ62JQMTIYLTHR5Y7X54","short_pith_number":"pith:E5ZN77UQ","canonical_record":{"source":{"id":"1304.8108","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-04-30T18:39:26Z","cross_cats_sorted":["cs.CC","cs.DM","math.CO","stat.CO"],"title_canon_sha256":"b353baeb343fabd3aba15544229e2b229530d7b0140da2e9a71323f65616e5da","abstract_canon_sha256":"010743ea5cc09e7b90ed9bb765e9e00fc232b7c45886a9840dac5caf8ccff0b4"},"schema_version":"1.0"},"canonical_sha256":"2772dffe90f693064d185ccf1ee3f7ef134e8e13004757d274df08d9319d8d61","source":{"kind":"arxiv","id":"1304.8108","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1304.8108","created_at":"2026-05-18T03:26:42Z"},{"alias_kind":"arxiv_version","alias_value":"1304.8108v1","created_at":"2026-05-18T03:26:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.8108","created_at":"2026-05-18T03:26:42Z"},{"alias_kind":"pith_short_12","alias_value":"E5ZN77UQ62JQ","created_at":"2026-05-18T12:27:43Z"},{"alias_kind":"pith_short_16","alias_value":"E5ZN77UQ62JQMTIY","created_at":"2026-05-18T12:27:43Z"},{"alias_kind":"pith_short_8","alias_value":"E5ZN77UQ","created_at":"2026-05-18T12:27:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:E5ZN77UQ62JQMTIYLTHR5Y7X54","target":"record","payload":{"canonical_record":{"source":{"id":"1304.8108","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-04-30T18:39:26Z","cross_cats_sorted":["cs.CC","cs.DM","math.CO","stat.CO"],"title_canon_sha256":"b353baeb343fabd3aba15544229e2b229530d7b0140da2e9a71323f65616e5da","abstract_canon_sha256":"010743ea5cc09e7b90ed9bb765e9e00fc232b7c45886a9840dac5caf8ccff0b4"},"schema_version":"1.0"},"canonical_sha256":"2772dffe90f693064d185ccf1ee3f7ef134e8e13004757d274df08d9319d8d61","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:26:42.290310Z","signature_b64":"vlZHrtjjK0hl+5IKMrK+6Tfl7m3uY3am0uUjTJxW2oeefBZV+O+j45rmruWfjsZR2f8Mp/lyRTe0lQrXxWapCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2772dffe90f693064d185ccf1ee3f7ef134e8e13004757d274df08d9319d8d61","last_reissued_at":"2026-05-18T03:26:42.289626Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:26:42.289626Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1304.8108","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:26:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eIdpV5aeFkIwBWy+iL/4UpUQe4EVUg9N8+G3TjGk53i6dESJqyhh495dwtql6FC5W3anMT4HMl2ZJEiGnDjoBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T12:37:28.905628Z"},"content_sha256":"eaf5967838518deebb2f47080ddb9357bbb0d73679c9d920bf269935218bbe7a","schema_version":"1.0","event_id":"sha256:eaf5967838518deebb2f47080ddb9357bbb0d73679c9d920bf269935218bbe7a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:E5ZN77UQ62JQMTIYLTHR5Y7X54","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Entropy, Optimization and Counting","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.DM","math.CO","stat.CO"],"primary_cat":"cs.DS","authors_text":"Mohit Singh, Nisheeth K. Vishnoi","submitted_at":"2013-04-30T18:39:26Z","abstract_excerpt":"In this paper we study the problem of computing max-entropy distributions over a discrete set of objects subject to observed marginals. Interest in such distributions arises due to their applicability in areas such as statistical physics, economics, biology, information theory, machine learning, combinatorics and, more recently, approximation algorithms. A key difficulty in computing max-entropy distributions has been to show that they have polynomially-sized descriptions. We show that such descriptions exist under general conditions. Subsequently, we show how algorithms for (approximately) co"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.8108","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:26:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1g0hoDdGhjo8I1vxqhm5lAn29I6nNj+qFvlG73jihOpJe2pAWmkcE1Qx/pmSQG/xZ7KYDwQK588yOiX6wiiKDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T12:37:28.905978Z"},"content_sha256":"6a329310639f7d6ba135e74922d742cddcea341e87e074b7d99b35756703f1f6","schema_version":"1.0","event_id":"sha256:6a329310639f7d6ba135e74922d742cddcea341e87e074b7d99b35756703f1f6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/E5ZN77UQ62JQMTIYLTHR5Y7X54/bundle.json","state_url":"https://pith.science/pith/E5ZN77UQ62JQMTIYLTHR5Y7X54/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/E5ZN77UQ62JQMTIYLTHR5Y7X54/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-20T12:37:28Z","links":{"resolver":"https://pith.science/pith/E5ZN77UQ62JQMTIYLTHR5Y7X54","bundle":"https://pith.science/pith/E5ZN77UQ62JQMTIYLTHR5Y7X54/bundle.json","state":"https://pith.science/pith/E5ZN77UQ62JQMTIYLTHR5Y7X54/state.json","well_known_bundle":"https://pith.science/.well-known/pith/E5ZN77UQ62JQMTIYLTHR5Y7X54/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:E5ZN77UQ62JQMTIYLTHR5Y7X54","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":"010743ea5cc09e7b90ed9bb765e9e00fc232b7c45886a9840dac5caf8ccff0b4","cross_cats_sorted":["cs.CC","cs.DM","math.CO","stat.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-04-30T18:39:26Z","title_canon_sha256":"b353baeb343fabd3aba15544229e2b229530d7b0140da2e9a71323f65616e5da"},"schema_version":"1.0","source":{"id":"1304.8108","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1304.8108","created_at":"2026-05-18T03:26:42Z"},{"alias_kind":"arxiv_version","alias_value":"1304.8108v1","created_at":"2026-05-18T03:26:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.8108","created_at":"2026-05-18T03:26:42Z"},{"alias_kind":"pith_short_12","alias_value":"E5ZN77UQ62JQ","created_at":"2026-05-18T12:27:43Z"},{"alias_kind":"pith_short_16","alias_value":"E5ZN77UQ62JQMTIY","created_at":"2026-05-18T12:27:43Z"},{"alias_kind":"pith_short_8","alias_value":"E5ZN77UQ","created_at":"2026-05-18T12:27:43Z"}],"graph_snapshots":[{"event_id":"sha256:6a329310639f7d6ba135e74922d742cddcea341e87e074b7d99b35756703f1f6","target":"graph","created_at":"2026-05-18T03:26:42Z","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":"In this paper we study the problem of computing max-entropy distributions over a discrete set of objects subject to observed marginals. Interest in such distributions arises due to their applicability in areas such as statistical physics, economics, biology, information theory, machine learning, combinatorics and, more recently, approximation algorithms. A key difficulty in computing max-entropy distributions has been to show that they have polynomially-sized descriptions. We show that such descriptions exist under general conditions. Subsequently, we show how algorithms for (approximately) co","authors_text":"Mohit Singh, Nisheeth K. Vishnoi","cross_cats":["cs.CC","cs.DM","math.CO","stat.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-04-30T18:39:26Z","title":"Entropy, Optimization and Counting"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.8108","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:eaf5967838518deebb2f47080ddb9357bbb0d73679c9d920bf269935218bbe7a","target":"record","created_at":"2026-05-18T03:26:42Z","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":"010743ea5cc09e7b90ed9bb765e9e00fc232b7c45886a9840dac5caf8ccff0b4","cross_cats_sorted":["cs.CC","cs.DM","math.CO","stat.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-04-30T18:39:26Z","title_canon_sha256":"b353baeb343fabd3aba15544229e2b229530d7b0140da2e9a71323f65616e5da"},"schema_version":"1.0","source":{"id":"1304.8108","kind":"arxiv","version":1}},"canonical_sha256":"2772dffe90f693064d185ccf1ee3f7ef134e8e13004757d274df08d9319d8d61","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2772dffe90f693064d185ccf1ee3f7ef134e8e13004757d274df08d9319d8d61","first_computed_at":"2026-05-18T03:26:42.289626Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:26:42.289626Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"vlZHrtjjK0hl+5IKMrK+6Tfl7m3uY3am0uUjTJxW2oeefBZV+O+j45rmruWfjsZR2f8Mp/lyRTe0lQrXxWapCA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:26:42.290310Z","signed_message":"canonical_sha256_bytes"},"source_id":"1304.8108","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:eaf5967838518deebb2f47080ddb9357bbb0d73679c9d920bf269935218bbe7a","sha256:6a329310639f7d6ba135e74922d742cddcea341e87e074b7d99b35756703f1f6"],"state_sha256":"cf1feeacfb1bbf4dc787d944bd4ea36266fa478a7ecf978d552c5af2f75a0cab"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tlZUxjXoucqTfyYKhiv9tRFxDeBXEVl0eRhi06Lnu//M0KCQHIj5b0ckypWSnC5PPNnWizL2oGchrdgGyUJMBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-20T12:37:28.907920Z","bundle_sha256":"015d90698a9f69aebf7880bb7698a588f54f18bb8365e280bd0ae563a4dbddbe"}}