{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:A22KC2SQ2VI72ZCCDE4BS2OW7H","short_pith_number":"pith:A22KC2SQ","canonical_record":{"source":{"id":"1902.02283","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2019-02-06T17:19:04Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"9dd08c8e433e97edac0769337937ea697e2a1e39231416ff4f839764e96d76b2","abstract_canon_sha256":"271c7437abd9ce76bbe5f01e06474ac1bd9708e2078bf9d3f20e2c8eb1921a30"},"schema_version":"1.0"},"canonical_sha256":"06b4a16a50d551fd644219381969d6f9e582d3da56ebe8e76c02b4d43c6b7532","source":{"kind":"arxiv","id":"1902.02283","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1902.02283","created_at":"2026-05-17T23:54:37Z"},{"alias_kind":"arxiv_version","alias_value":"1902.02283v1","created_at":"2026-05-17T23:54:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.02283","created_at":"2026-05-17T23:54:37Z"},{"alias_kind":"pith_short_12","alias_value":"A22KC2SQ2VI7","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_16","alias_value":"A22KC2SQ2VI72ZCC","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_8","alias_value":"A22KC2SQ","created_at":"2026-05-18T12:33:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:A22KC2SQ2VI72ZCCDE4BS2OW7H","target":"record","payload":{"canonical_record":{"source":{"id":"1902.02283","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2019-02-06T17:19:04Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"9dd08c8e433e97edac0769337937ea697e2a1e39231416ff4f839764e96d76b2","abstract_canon_sha256":"271c7437abd9ce76bbe5f01e06474ac1bd9708e2078bf9d3f20e2c8eb1921a30"},"schema_version":"1.0"},"canonical_sha256":"06b4a16a50d551fd644219381969d6f9e582d3da56ebe8e76c02b4d43c6b7532","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:54:37.406075Z","signature_b64":"MFkGcg21H5Qt2X/++pVX8KPqrg0t9IkB1SqLg7f5P9PlrpyAjsDg0VWiOqA8wJeV3hLvg1nS0jnh01q+TB9IDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"06b4a16a50d551fd644219381969d6f9e582d3da56ebe8e76c02b4d43c6b7532","last_reissued_at":"2026-05-17T23:54:37.405605Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:54:37.405605Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1902.02283","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-17T23:54:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Inp6MTMP+vrN4u4n7QsGqxoVDGzek2LNonWdk4rZHLpE0hmY31mTBEOzgbKq0/LvBLIca63oqig+LaF7ODeoBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T21:27:24.440679Z"},"content_sha256":"04b2e4a0786ef77a323d067c3f38f69a2d3c6a0e50cc741efd56aca92297b15c","schema_version":"1.0","event_id":"sha256:04b2e4a0786ef77a323d067c3f38f69a2d3c6a0e50cc741efd56aca92297b15c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:A22KC2SQ2VI72ZCCDE4BS2OW7H","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On maximum volume submatrices and cross approximation for symmetric semidefinite and diagonally dominant matrices","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.NA","authors_text":"Alice Cortinovis, Daniel Kressner, Stefano Massei","submitted_at":"2019-02-06T17:19:04Z","abstract_excerpt":"The problem of finding a $k \\times k$ submatrix of maximum volume of a matrix $A$ is of interest in a variety of applications. For example, it yields a quasi-best low-rank approximation constructed from the rows and columns of $A$. We show that such a submatrix can always be chosen to be a principal submatrix if $A$ is symmetric semidefinite or diagonally dominant. Then we analyze the low-rank approximation error returned by a greedy method for volume maximization, cross approximation with complete pivoting. Our bound for general matrices extends an existing result for symmetric semidefinite m"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.02283","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-17T23:54:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7dWuJro7AvyIRE76sUTnIOSQuLQE5GPE9igmWrQrNsfJ2ebKm3s40NdW9Q4wjNKcx/tsOUcjbf+Ts7OBIz8bAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T21:27:24.441350Z"},"content_sha256":"f85258faa64db99a833c8196ddb51771b2d42bedb03e3f7659db9e862184006c","schema_version":"1.0","event_id":"sha256:f85258faa64db99a833c8196ddb51771b2d42bedb03e3f7659db9e862184006c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/A22KC2SQ2VI72ZCCDE4BS2OW7H/bundle.json","state_url":"https://pith.science/pith/A22KC2SQ2VI72ZCCDE4BS2OW7H/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/A22KC2SQ2VI72ZCCDE4BS2OW7H/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-25T21:27:24Z","links":{"resolver":"https://pith.science/pith/A22KC2SQ2VI72ZCCDE4BS2OW7H","bundle":"https://pith.science/pith/A22KC2SQ2VI72ZCCDE4BS2OW7H/bundle.json","state":"https://pith.science/pith/A22KC2SQ2VI72ZCCDE4BS2OW7H/state.json","well_known_bundle":"https://pith.science/.well-known/pith/A22KC2SQ2VI72ZCCDE4BS2OW7H/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:A22KC2SQ2VI72ZCCDE4BS2OW7H","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":"271c7437abd9ce76bbe5f01e06474ac1bd9708e2078bf9d3f20e2c8eb1921a30","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2019-02-06T17:19:04Z","title_canon_sha256":"9dd08c8e433e97edac0769337937ea697e2a1e39231416ff4f839764e96d76b2"},"schema_version":"1.0","source":{"id":"1902.02283","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1902.02283","created_at":"2026-05-17T23:54:37Z"},{"alias_kind":"arxiv_version","alias_value":"1902.02283v1","created_at":"2026-05-17T23:54:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.02283","created_at":"2026-05-17T23:54:37Z"},{"alias_kind":"pith_short_12","alias_value":"A22KC2SQ2VI7","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_16","alias_value":"A22KC2SQ2VI72ZCC","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_8","alias_value":"A22KC2SQ","created_at":"2026-05-18T12:33:12Z"}],"graph_snapshots":[{"event_id":"sha256:f85258faa64db99a833c8196ddb51771b2d42bedb03e3f7659db9e862184006c","target":"graph","created_at":"2026-05-17T23:54:37Z","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 problem of finding a $k \\times k$ submatrix of maximum volume of a matrix $A$ is of interest in a variety of applications. For example, it yields a quasi-best low-rank approximation constructed from the rows and columns of $A$. We show that such a submatrix can always be chosen to be a principal submatrix if $A$ is symmetric semidefinite or diagonally dominant. Then we analyze the low-rank approximation error returned by a greedy method for volume maximization, cross approximation with complete pivoting. Our bound for general matrices extends an existing result for symmetric semidefinite m","authors_text":"Alice Cortinovis, Daniel Kressner, Stefano Massei","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2019-02-06T17:19:04Z","title":"On maximum volume submatrices and cross approximation for symmetric semidefinite and diagonally dominant matrices"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.02283","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:04b2e4a0786ef77a323d067c3f38f69a2d3c6a0e50cc741efd56aca92297b15c","target":"record","created_at":"2026-05-17T23:54:37Z","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":"271c7437abd9ce76bbe5f01e06474ac1bd9708e2078bf9d3f20e2c8eb1921a30","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2019-02-06T17:19:04Z","title_canon_sha256":"9dd08c8e433e97edac0769337937ea697e2a1e39231416ff4f839764e96d76b2"},"schema_version":"1.0","source":{"id":"1902.02283","kind":"arxiv","version":1}},"canonical_sha256":"06b4a16a50d551fd644219381969d6f9e582d3da56ebe8e76c02b4d43c6b7532","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"06b4a16a50d551fd644219381969d6f9e582d3da56ebe8e76c02b4d43c6b7532","first_computed_at":"2026-05-17T23:54:37.405605Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:54:37.405605Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"MFkGcg21H5Qt2X/++pVX8KPqrg0t9IkB1SqLg7f5P9PlrpyAjsDg0VWiOqA8wJeV3hLvg1nS0jnh01q+TB9IDw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:54:37.406075Z","signed_message":"canonical_sha256_bytes"},"source_id":"1902.02283","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:04b2e4a0786ef77a323d067c3f38f69a2d3c6a0e50cc741efd56aca92297b15c","sha256:f85258faa64db99a833c8196ddb51771b2d42bedb03e3f7659db9e862184006c"],"state_sha256":"31cec29a319a3cfd9141b438db2f89cbc0705a82b7a3e1968ef2f835adc79266"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iSUpYswP3ip3U0t5/X9R9mEgQ0Sc72eIhcUiJM45BbMIefffsPQkqrt5gzTkDw3tD6yeysV5BTFjH3IdC/1QDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T21:27:24.444871Z","bundle_sha256":"a62aa78c16002dcd9f4da2627008589fb8365a7692606d3f5b6519e2b6bd04b0"}}