{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:5MOOSZNUP7N7YBE6QUIE4GC3H3","short_pith_number":"pith:5MOOSZNU","canonical_record":{"source":{"id":"1703.00859","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-03-02T17:21:56Z","cross_cats_sorted":[],"title_canon_sha256":"cca7327904d91eddca3aa2525c0ea36316465228cbb65ffd4ab23e7c46fb9032","abstract_canon_sha256":"21bd01f8c794490ec9c8da5f3a1dadc19a185826ca33decb4204e5eff14f8fdf"},"schema_version":"1.0"},"canonical_sha256":"eb1ce965b47fdbfc049e85104e185b3ef1773c1581d987333594eb26b29706ae","source":{"kind":"arxiv","id":"1703.00859","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1703.00859","created_at":"2026-05-18T00:48:25Z"},{"alias_kind":"arxiv_version","alias_value":"1703.00859v3","created_at":"2026-05-18T00:48:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.00859","created_at":"2026-05-18T00:48:25Z"},{"alias_kind":"pith_short_12","alias_value":"5MOOSZNUP7N7","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_16","alias_value":"5MOOSZNUP7N7YBE6","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_8","alias_value":"5MOOSZNU","created_at":"2026-05-18T12:31:00Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:5MOOSZNUP7N7YBE6QUIE4GC3H3","target":"record","payload":{"canonical_record":{"source":{"id":"1703.00859","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-03-02T17:21:56Z","cross_cats_sorted":[],"title_canon_sha256":"cca7327904d91eddca3aa2525c0ea36316465228cbb65ffd4ab23e7c46fb9032","abstract_canon_sha256":"21bd01f8c794490ec9c8da5f3a1dadc19a185826ca33decb4204e5eff14f8fdf"},"schema_version":"1.0"},"canonical_sha256":"eb1ce965b47fdbfc049e85104e185b3ef1773c1581d987333594eb26b29706ae","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:48:25.744558Z","signature_b64":"ZNSANLNiG6P1GIRMGsPgR9o/wVuQX5ZWxwm0wX+t6BCtY4fgT1hRa/WcQOdExid5vuZHSTonjF/ac+ld3GRIDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"eb1ce965b47fdbfc049e85104e185b3ef1773c1581d987333594eb26b29706ae","last_reissued_at":"2026-05-18T00:48:25.743991Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:48:25.743991Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1703.00859","source_version":3,"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:48:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pZ29g56QAGl3wS6KBl4fvqYmVYZ15L9hFieP4uhUwq7zR8oM+YlAiCO7ANVpCGWI5lyAQop1Ql6w1fMqs1kNDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-24T10:28:18.242778Z"},"content_sha256":"900108c1f5c30c9344beba54c193f6cc0cbd432f5ddb364f0bda219b5525a1c9","schema_version":"1.0","event_id":"sha256:900108c1f5c30c9344beba54c193f6cc0cbd432f5ddb364f0bda219b5525a1c9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:5MOOSZNUP7N7YBE6QUIE4GC3H3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the minimum trace norm of (0,1)-matrices","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Natalia Agudelo, Vladimir Nikiforov","submitted_at":"2017-03-02T17:21:56Z","abstract_excerpt":"The trace norm of a matrix is the sum of its singular values. This paper presents results on the minimum trace norm $\\psi_{n}\\left( m\\right) $ of $\\left( 0,1\\right) $-matrices of size $n\\times n$ with exactly $m$ ones. It is shown that:\n  (1) if $n\\geq2$ and $n<m\\leq2n,$ then $\\psi_{n}\\left( m\\right) \\leq \\sqrt{m+\\sqrt{2\\left( m-1\\right) }}$ , with equality if and only if $m$ is a prime;\n  (2) if $n\\geq4$ and $2n<m\\leq3n,$ then $\\psi_{n}\\left( m\\right) \\leq \\sqrt{m+2\\sqrt{2\\left\\lfloor m/3\\right\\rfloor }}$ , with equality if and only if $m$ is a prime or a double of a prime;\n  (3) if $3n<m\\leq"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.00859","kind":"arxiv","version":3},"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:48:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uVxwRrw7qSX+/fnIYYERwakXdST3oDBE49hcct4YEcxPhBLDU7LrEomvo1lhvIYZ13k4tuFNkxykEt8gCO70Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-24T10:28:18.243471Z"},"content_sha256":"306a3a709ac9826b67901eee1eed0b8d126b007e064015cd1d1acbda69e98196","schema_version":"1.0","event_id":"sha256:306a3a709ac9826b67901eee1eed0b8d126b007e064015cd1d1acbda69e98196"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5MOOSZNUP7N7YBE6QUIE4GC3H3/bundle.json","state_url":"https://pith.science/pith/5MOOSZNUP7N7YBE6QUIE4GC3H3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5MOOSZNUP7N7YBE6QUIE4GC3H3/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-24T10:28:18Z","links":{"resolver":"https://pith.science/pith/5MOOSZNUP7N7YBE6QUIE4GC3H3","bundle":"https://pith.science/pith/5MOOSZNUP7N7YBE6QUIE4GC3H3/bundle.json","state":"https://pith.science/pith/5MOOSZNUP7N7YBE6QUIE4GC3H3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5MOOSZNUP7N7YBE6QUIE4GC3H3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:5MOOSZNUP7N7YBE6QUIE4GC3H3","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":"21bd01f8c794490ec9c8da5f3a1dadc19a185826ca33decb4204e5eff14f8fdf","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-03-02T17:21:56Z","title_canon_sha256":"cca7327904d91eddca3aa2525c0ea36316465228cbb65ffd4ab23e7c46fb9032"},"schema_version":"1.0","source":{"id":"1703.00859","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1703.00859","created_at":"2026-05-18T00:48:25Z"},{"alias_kind":"arxiv_version","alias_value":"1703.00859v3","created_at":"2026-05-18T00:48:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.00859","created_at":"2026-05-18T00:48:25Z"},{"alias_kind":"pith_short_12","alias_value":"5MOOSZNUP7N7","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_16","alias_value":"5MOOSZNUP7N7YBE6","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_8","alias_value":"5MOOSZNU","created_at":"2026-05-18T12:31:00Z"}],"graph_snapshots":[{"event_id":"sha256:306a3a709ac9826b67901eee1eed0b8d126b007e064015cd1d1acbda69e98196","target":"graph","created_at":"2026-05-18T00:48:25Z","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 trace norm of a matrix is the sum of its singular values. This paper presents results on the minimum trace norm $\\psi_{n}\\left( m\\right) $ of $\\left( 0,1\\right) $-matrices of size $n\\times n$ with exactly $m$ ones. It is shown that:\n  (1) if $n\\geq2$ and $n<m\\leq2n,$ then $\\psi_{n}\\left( m\\right) \\leq \\sqrt{m+\\sqrt{2\\left( m-1\\right) }}$ , with equality if and only if $m$ is a prime;\n  (2) if $n\\geq4$ and $2n<m\\leq3n,$ then $\\psi_{n}\\left( m\\right) \\leq \\sqrt{m+2\\sqrt{2\\left\\lfloor m/3\\right\\rfloor }}$ , with equality if and only if $m$ is a prime or a double of a prime;\n  (3) if $3n<m\\leq","authors_text":"Natalia Agudelo, Vladimir Nikiforov","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-03-02T17:21:56Z","title":"On the minimum trace norm of (0,1)-matrices"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.00859","kind":"arxiv","version":3},"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:900108c1f5c30c9344beba54c193f6cc0cbd432f5ddb364f0bda219b5525a1c9","target":"record","created_at":"2026-05-18T00:48:25Z","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":"21bd01f8c794490ec9c8da5f3a1dadc19a185826ca33decb4204e5eff14f8fdf","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-03-02T17:21:56Z","title_canon_sha256":"cca7327904d91eddca3aa2525c0ea36316465228cbb65ffd4ab23e7c46fb9032"},"schema_version":"1.0","source":{"id":"1703.00859","kind":"arxiv","version":3}},"canonical_sha256":"eb1ce965b47fdbfc049e85104e185b3ef1773c1581d987333594eb26b29706ae","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"eb1ce965b47fdbfc049e85104e185b3ef1773c1581d987333594eb26b29706ae","first_computed_at":"2026-05-18T00:48:25.743991Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:48:25.743991Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ZNSANLNiG6P1GIRMGsPgR9o/wVuQX5ZWxwm0wX+t6BCtY4fgT1hRa/WcQOdExid5vuZHSTonjF/ac+ld3GRIDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:48:25.744558Z","signed_message":"canonical_sha256_bytes"},"source_id":"1703.00859","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:900108c1f5c30c9344beba54c193f6cc0cbd432f5ddb364f0bda219b5525a1c9","sha256:306a3a709ac9826b67901eee1eed0b8d126b007e064015cd1d1acbda69e98196"],"state_sha256":"743ec2b5a7811b59f19175d0ee04cc7fe5a180ed20b28c5ea17705d902047192"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Yemp7D9WEoDMVQ2t/3QQNvKdh/ye6uXmO5UYY79cFIaAvLBQd5INzDDa3eAdKQ4stNAZJ3DOi5dhR1lzbDdXAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-24T10:28:18.247125Z","bundle_sha256":"d0c2dbd5aac9fcfc84e092474f05e18609e59b25546c5755490ed5241a994062"}}