{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:NITFQHSM7FL4UWW4CYQKRC6MEF","short_pith_number":"pith:NITFQHSM","canonical_record":{"source":{"id":"1301.6658","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2013-01-28T19:55:01Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"c74960c6ecb8516b46ba3d8c2ec72777e5561d6ae6b219578c9e21ded9c8bd9d","abstract_canon_sha256":"dfade1ff3ca554ec2939cac0b50b98f1696c298bb7e49f5ef155ab405d7e4a57"},"schema_version":"1.0"},"canonical_sha256":"6a26581e4cf957ca5adc1620a88bcc2160cbde2793bdf2c7e693b34a4362d5df","source":{"kind":"arxiv","id":"1301.6658","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1301.6658","created_at":"2026-05-18T03:35:14Z"},{"alias_kind":"arxiv_version","alias_value":"1301.6658v1","created_at":"2026-05-18T03:35:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.6658","created_at":"2026-05-18T03:35:14Z"},{"alias_kind":"pith_short_12","alias_value":"NITFQHSM7FL4","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_16","alias_value":"NITFQHSM7FL4UWW4","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_8","alias_value":"NITFQHSM","created_at":"2026-05-18T12:27:52Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:NITFQHSM7FL4UWW4CYQKRC6MEF","target":"record","payload":{"canonical_record":{"source":{"id":"1301.6658","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2013-01-28T19:55:01Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"c74960c6ecb8516b46ba3d8c2ec72777e5561d6ae6b219578c9e21ded9c8bd9d","abstract_canon_sha256":"dfade1ff3ca554ec2939cac0b50b98f1696c298bb7e49f5ef155ab405d7e4a57"},"schema_version":"1.0"},"canonical_sha256":"6a26581e4cf957ca5adc1620a88bcc2160cbde2793bdf2c7e693b34a4362d5df","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:35:14.736427Z","signature_b64":"jHot+lqWEvYfKHQnmE8LpDhPLXAXcwmM28084odAFMYyZ+JrFq0wQWsN4MEIH6Djuzi4VCNOoGg01OO2xCU3Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6a26581e4cf957ca5adc1620a88bcc2160cbde2793bdf2c7e693b34a4362d5df","last_reissued_at":"2026-05-18T03:35:14.735676Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:35:14.735676Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1301.6658","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:35:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CTd+Q96apQb7agfGKwuhjB/HaDxLae/w/3DKb/47sUxpiw7fsXuCGKHlstv/7BqfBlUgqSr3e6sORLUnoy5mBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T21:36:46.039895Z"},"content_sha256":"e3522a6628206c56e5ff5e9805edb55003b678bf114e3cd41c7d511be75c6a14","schema_version":"1.0","event_id":"sha256:e3522a6628206c56e5ff5e9805edb55003b678bf114e3cd41c7d511be75c6a14"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:NITFQHSM7FL4UWW4CYQKRC6MEF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Minimum Relative Entropy for Quantum Estimation: Feasibility and General Solution","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"quant-ph","authors_text":"Augusto Ferrante, Francesco Ticozzi, Mattia Zorzi","submitted_at":"2013-01-28T19:55:01Z","abstract_excerpt":"We propose a general framework for solving quantum state estimation problems using the minimum relative entropy criterion. A convex optimization approach allows us to decide the feasibility of the problem given the data and, whenever necessary, to relax the constraints in order to allow for a physically admissible solution. Building on these results, the variational analysis can be completed ensuring existence and uniqueness of the optimum. The latter can then be computed by standard, efficient standard algorithms for convex optimization, without resorting to approximate methods or restrictive"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.6658","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:35:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"66d0+sCsang3N0rFiNxAD3H7XccvygY39MuDnfY/RiE0xTS5SE79UqdnD/3HNr9SYb2SGUuGV/9XeEIdxMuSBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T21:36:46.040260Z"},"content_sha256":"b4f7d685d9b9656ead578802b7d5abdfac277d8a94f5db0a929ae69c887f108b","schema_version":"1.0","event_id":"sha256:b4f7d685d9b9656ead578802b7d5abdfac277d8a94f5db0a929ae69c887f108b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NITFQHSM7FL4UWW4CYQKRC6MEF/bundle.json","state_url":"https://pith.science/pith/NITFQHSM7FL4UWW4CYQKRC6MEF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NITFQHSM7FL4UWW4CYQKRC6MEF/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-05-26T21:36:46Z","links":{"resolver":"https://pith.science/pith/NITFQHSM7FL4UWW4CYQKRC6MEF","bundle":"https://pith.science/pith/NITFQHSM7FL4UWW4CYQKRC6MEF/bundle.json","state":"https://pith.science/pith/NITFQHSM7FL4UWW4CYQKRC6MEF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NITFQHSM7FL4UWW4CYQKRC6MEF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:NITFQHSM7FL4UWW4CYQKRC6MEF","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":"dfade1ff3ca554ec2939cac0b50b98f1696c298bb7e49f5ef155ab405d7e4a57","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2013-01-28T19:55:01Z","title_canon_sha256":"c74960c6ecb8516b46ba3d8c2ec72777e5561d6ae6b219578c9e21ded9c8bd9d"},"schema_version":"1.0","source":{"id":"1301.6658","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1301.6658","created_at":"2026-05-18T03:35:14Z"},{"alias_kind":"arxiv_version","alias_value":"1301.6658v1","created_at":"2026-05-18T03:35:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.6658","created_at":"2026-05-18T03:35:14Z"},{"alias_kind":"pith_short_12","alias_value":"NITFQHSM7FL4","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_16","alias_value":"NITFQHSM7FL4UWW4","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_8","alias_value":"NITFQHSM","created_at":"2026-05-18T12:27:52Z"}],"graph_snapshots":[{"event_id":"sha256:b4f7d685d9b9656ead578802b7d5abdfac277d8a94f5db0a929ae69c887f108b","target":"graph","created_at":"2026-05-18T03:35:14Z","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":"We propose a general framework for solving quantum state estimation problems using the minimum relative entropy criterion. A convex optimization approach allows us to decide the feasibility of the problem given the data and, whenever necessary, to relax the constraints in order to allow for a physically admissible solution. Building on these results, the variational analysis can be completed ensuring existence and uniqueness of the optimum. The latter can then be computed by standard, efficient standard algorithms for convex optimization, without resorting to approximate methods or restrictive","authors_text":"Augusto Ferrante, Francesco Ticozzi, Mattia Zorzi","cross_cats":["cs.IT","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2013-01-28T19:55:01Z","title":"Minimum Relative Entropy for Quantum Estimation: Feasibility and General Solution"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.6658","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:e3522a6628206c56e5ff5e9805edb55003b678bf114e3cd41c7d511be75c6a14","target":"record","created_at":"2026-05-18T03:35:14Z","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":"dfade1ff3ca554ec2939cac0b50b98f1696c298bb7e49f5ef155ab405d7e4a57","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2013-01-28T19:55:01Z","title_canon_sha256":"c74960c6ecb8516b46ba3d8c2ec72777e5561d6ae6b219578c9e21ded9c8bd9d"},"schema_version":"1.0","source":{"id":"1301.6658","kind":"arxiv","version":1}},"canonical_sha256":"6a26581e4cf957ca5adc1620a88bcc2160cbde2793bdf2c7e693b34a4362d5df","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6a26581e4cf957ca5adc1620a88bcc2160cbde2793bdf2c7e693b34a4362d5df","first_computed_at":"2026-05-18T03:35:14.735676Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:35:14.735676Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"jHot+lqWEvYfKHQnmE8LpDhPLXAXcwmM28084odAFMYyZ+JrFq0wQWsN4MEIH6Djuzi4VCNOoGg01OO2xCU3Aw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:35:14.736427Z","signed_message":"canonical_sha256_bytes"},"source_id":"1301.6658","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e3522a6628206c56e5ff5e9805edb55003b678bf114e3cd41c7d511be75c6a14","sha256:b4f7d685d9b9656ead578802b7d5abdfac277d8a94f5db0a929ae69c887f108b"],"state_sha256":"464edd50e7740a64695f335e06a4ebc30af84877c0450c555b5d1bf38f41131d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oIww5D5VidkfRkeuj87X4Of4qSVQ/ly/+40cfb+c0eNdEhUAIz1W1mwcEqd6J7UsA5pQ/ExvcFLoXGK4DiG/DA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T21:36:46.042488Z","bundle_sha256":"6c5f7c8ae8f70bb47eabd41637e7fbec015f9bc05a72417c2ec0139c8acdf9d0"}}