{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:ZPO2JUZI247LBZHQPFUQRDDVQR","short_pith_number":"pith:ZPO2JUZI","canonical_record":{"source":{"id":"1704.02310","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-04-07T17:50:43Z","cross_cats_sorted":[],"title_canon_sha256":"23ccc1b901e53ea5c3c4d7a1d3cd292feace627e76b7e0beb158a364d075f668","abstract_canon_sha256":"160c28b6dfe72a275de84bfdcd5ecd295a0c6b502ae490b02f250d94a835312a"},"schema_version":"1.0"},"canonical_sha256":"cbdda4d328d73eb0e4f07969088c758452d355e3f2618ed9eca03b4c63de70bc","source":{"kind":"arxiv","id":"1704.02310","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1704.02310","created_at":"2026-05-18T00:37:47Z"},{"alias_kind":"arxiv_version","alias_value":"1704.02310v2","created_at":"2026-05-18T00:37:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.02310","created_at":"2026-05-18T00:37:47Z"},{"alias_kind":"pith_short_12","alias_value":"ZPO2JUZI247L","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_16","alias_value":"ZPO2JUZI247LBZHQ","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_8","alias_value":"ZPO2JUZI","created_at":"2026-05-18T12:31:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:ZPO2JUZI247LBZHQPFUQRDDVQR","target":"record","payload":{"canonical_record":{"source":{"id":"1704.02310","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-04-07T17:50:43Z","cross_cats_sorted":[],"title_canon_sha256":"23ccc1b901e53ea5c3c4d7a1d3cd292feace627e76b7e0beb158a364d075f668","abstract_canon_sha256":"160c28b6dfe72a275de84bfdcd5ecd295a0c6b502ae490b02f250d94a835312a"},"schema_version":"1.0"},"canonical_sha256":"cbdda4d328d73eb0e4f07969088c758452d355e3f2618ed9eca03b4c63de70bc","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:37:47.619226Z","signature_b64":"h+QQOKZOZ9a7+4Fk5YBe/yewpPE/DLXbnOE8DJQ2zH224fiMDGDASWaWfbV7YeWxGXK3H6u20vd77wna0rYLCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cbdda4d328d73eb0e4f07969088c758452d355e3f2618ed9eca03b4c63de70bc","last_reissued_at":"2026-05-18T00:37:47.618572Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:37:47.618572Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1704.02310","source_version":2,"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-18T00:37:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hKaqGZ6zT7yhxWQ1RaI85kEc1fidPZOTKFQKHoFI6ciLv1l/wFx8L+jSh/i0WXKf/VnnVjc9KvTf61KB6ZamCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T15:48:47.311288Z"},"content_sha256":"f93e905b7ec2749999ce9f1dd1f0a145f0f8f499b81a556b48e0b15425f7fe1c","schema_version":"1.0","event_id":"sha256:f93e905b7ec2749999ce9f1dd1f0a145f0f8f499b81a556b48e0b15425f7fe1c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:ZPO2JUZI247LBZHQPFUQRDDVQR","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Matrix Scaling and Balancing via Box Constrained Newton's Method and Interior Point Methods","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Adrian Vladu, Aleksander Madry, Dimitris Tsipras, Michael B. Cohen","submitted_at":"2017-04-07T17:50:43Z","abstract_excerpt":"In this paper, we study matrix scaling and balancing, which are fundamental problems in scientific computing, with a long line of work on them that dates back to the 1960s. We provide algorithms for both these problems that, ignoring logarithmic factors involving the dimension of the input matrix and the size of its entries, both run in time $\\widetilde{O}\\left(m\\log \\kappa \\log^2 (1/\\epsilon)\\right)$ where $\\epsilon$ is the amount of error we are willing to tolerate. Here, $\\kappa$ represents the ratio between the largest and the smallest entries of the optimal scalings. This implies that our"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.02310","kind":"arxiv","version":2},"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-18T00:37:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MlfxgFXvwRXtiUFpJeOo+kQACzSHKKAQr+9XOf5JXaDjaQnT3hfenJ86WSae0S6/6mm6uvSn/Y10t4XjRg8PAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T15:48:47.312027Z"},"content_sha256":"fa46148e0f18888ea0f9ffc960ed65e1979cffc7a9c6b014da7d2f3ec93a15ef","schema_version":"1.0","event_id":"sha256:fa46148e0f18888ea0f9ffc960ed65e1979cffc7a9c6b014da7d2f3ec93a15ef"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZPO2JUZI247LBZHQPFUQRDDVQR/bundle.json","state_url":"https://pith.science/pith/ZPO2JUZI247LBZHQPFUQRDDVQR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZPO2JUZI247LBZHQPFUQRDDVQR/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-26T15:48:47Z","links":{"resolver":"https://pith.science/pith/ZPO2JUZI247LBZHQPFUQRDDVQR","bundle":"https://pith.science/pith/ZPO2JUZI247LBZHQPFUQRDDVQR/bundle.json","state":"https://pith.science/pith/ZPO2JUZI247LBZHQPFUQRDDVQR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZPO2JUZI247LBZHQPFUQRDDVQR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:ZPO2JUZI247LBZHQPFUQRDDVQR","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":"160c28b6dfe72a275de84bfdcd5ecd295a0c6b502ae490b02f250d94a835312a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-04-07T17:50:43Z","title_canon_sha256":"23ccc1b901e53ea5c3c4d7a1d3cd292feace627e76b7e0beb158a364d075f668"},"schema_version":"1.0","source":{"id":"1704.02310","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1704.02310","created_at":"2026-05-18T00:37:47Z"},{"alias_kind":"arxiv_version","alias_value":"1704.02310v2","created_at":"2026-05-18T00:37:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.02310","created_at":"2026-05-18T00:37:47Z"},{"alias_kind":"pith_short_12","alias_value":"ZPO2JUZI247L","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_16","alias_value":"ZPO2JUZI247LBZHQ","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_8","alias_value":"ZPO2JUZI","created_at":"2026-05-18T12:31:59Z"}],"graph_snapshots":[{"event_id":"sha256:fa46148e0f18888ea0f9ffc960ed65e1979cffc7a9c6b014da7d2f3ec93a15ef","target":"graph","created_at":"2026-05-18T00:37:47Z","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 matrix scaling and balancing, which are fundamental problems in scientific computing, with a long line of work on them that dates back to the 1960s. We provide algorithms for both these problems that, ignoring logarithmic factors involving the dimension of the input matrix and the size of its entries, both run in time $\\widetilde{O}\\left(m\\log \\kappa \\log^2 (1/\\epsilon)\\right)$ where $\\epsilon$ is the amount of error we are willing to tolerate. Here, $\\kappa$ represents the ratio between the largest and the smallest entries of the optimal scalings. This implies that our","authors_text":"Adrian Vladu, Aleksander Madry, Dimitris Tsipras, Michael B. Cohen","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-04-07T17:50:43Z","title":"Matrix Scaling and Balancing via Box Constrained Newton's Method and Interior Point Methods"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.02310","kind":"arxiv","version":2},"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:f93e905b7ec2749999ce9f1dd1f0a145f0f8f499b81a556b48e0b15425f7fe1c","target":"record","created_at":"2026-05-18T00:37:47Z","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":"160c28b6dfe72a275de84bfdcd5ecd295a0c6b502ae490b02f250d94a835312a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-04-07T17:50:43Z","title_canon_sha256":"23ccc1b901e53ea5c3c4d7a1d3cd292feace627e76b7e0beb158a364d075f668"},"schema_version":"1.0","source":{"id":"1704.02310","kind":"arxiv","version":2}},"canonical_sha256":"cbdda4d328d73eb0e4f07969088c758452d355e3f2618ed9eca03b4c63de70bc","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"cbdda4d328d73eb0e4f07969088c758452d355e3f2618ed9eca03b4c63de70bc","first_computed_at":"2026-05-18T00:37:47.618572Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:37:47.618572Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"h+QQOKZOZ9a7+4Fk5YBe/yewpPE/DLXbnOE8DJQ2zH224fiMDGDASWaWfbV7YeWxGXK3H6u20vd77wna0rYLCg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:37:47.619226Z","signed_message":"canonical_sha256_bytes"},"source_id":"1704.02310","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f93e905b7ec2749999ce9f1dd1f0a145f0f8f499b81a556b48e0b15425f7fe1c","sha256:fa46148e0f18888ea0f9ffc960ed65e1979cffc7a9c6b014da7d2f3ec93a15ef"],"state_sha256":"eabc9de625b31577f321dec97cb28f4470142f28901c12ceaf01da9bb5c2bc57"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LqoNrCdrP8oXTHfSY58Xk+5+xBZ1pX60rFT39pMgZhNbURMcD2/xaCwO9yXDROzy5ufkYrYmsemu6z88v5UdBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T15:48:47.316598Z","bundle_sha256":"78aa818dc280e1c960bb4180aa21dbfa77d6fa09854470305bab06994e2797ff"}}