{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:AUVI4RBAFAI4RYW74JE5O447IO","short_pith_number":"pith:AUVI4RBA","schema_version":"1.0","canonical_sha256":"052a8e44202811c8e2dfe249d7739f43b24dc3447ff60dabba4f4aa08607e33d","source":{"kind":"arxiv","id":"1608.07038","version":2},"attestation_state":"computed","paper":{"title":"The (minimum) rank of typical fooling set matrices","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Dirk Oliver Theis, Mozhgan Pourmoradnasseri","submitted_at":"2016-08-25T07:33:37Z","abstract_excerpt":"A fooling-set matrix has nonzero diagonal, but at least one in every pair of diagonally opposite entries is 0. Dietzfelbinger et al. '96 proved that the rank of such a matrix is at least $\\sqrt n$. It is known that the bound is tight (up to a multiplicative constant).\n  We ask for the \"typical\" minimum rank of a fooling-set matrix: For a fooling-set zero-nonzero pattern chosen at random, is the minimum rank of a matrix with that zero-nonzero pattern over a field $\\mathbb F$ closer to its lower bound $\\sqrt{n}$ or to its upper bound $n$? We study random patterns with a given density $p$, and pr"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1608.07038","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2016-08-25T07:33:37Z","cross_cats_sorted":[],"title_canon_sha256":"36c640c0d8cb870cc47c79e24e0688e0a1e5686dc6e8307af83bcc333228918b","abstract_canon_sha256":"1fbb4c923a2191c697b52ff142934c31f57b8a4d5f7bd29515d58d0154a6b5e1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:55:57.715293Z","signature_b64":"5cbOatl3g34tB/ZcpeUsYVGCu4Wv2C0yB+rWMYRL5USh5Hunm+V4cDk+wvmZN2RhAj416W5ULszFUmQKuzEBDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"052a8e44202811c8e2dfe249d7739f43b24dc3447ff60dabba4f4aa08607e33d","last_reissued_at":"2026-05-18T00:55:57.714747Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:55:57.714747Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The (minimum) rank of typical fooling set matrices","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Dirk Oliver Theis, Mozhgan Pourmoradnasseri","submitted_at":"2016-08-25T07:33:37Z","abstract_excerpt":"A fooling-set matrix has nonzero diagonal, but at least one in every pair of diagonally opposite entries is 0. Dietzfelbinger et al. '96 proved that the rank of such a matrix is at least $\\sqrt n$. It is known that the bound is tight (up to a multiplicative constant).\n  We ask for the \"typical\" minimum rank of a fooling-set matrix: For a fooling-set zero-nonzero pattern chosen at random, is the minimum rank of a matrix with that zero-nonzero pattern over a field $\\mathbb F$ closer to its lower bound $\\sqrt{n}$ or to its upper bound $n$? We study random patterns with a given density $p$, and pr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.07038","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1608.07038","created_at":"2026-05-18T00:55:57.714824+00:00"},{"alias_kind":"arxiv_version","alias_value":"1608.07038v2","created_at":"2026-05-18T00:55:57.714824+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.07038","created_at":"2026-05-18T00:55:57.714824+00:00"},{"alias_kind":"pith_short_12","alias_value":"AUVI4RBAFAI4","created_at":"2026-05-18T12:30:07.202191+00:00"},{"alias_kind":"pith_short_16","alias_value":"AUVI4RBAFAI4RYW7","created_at":"2026-05-18T12:30:07.202191+00:00"},{"alias_kind":"pith_short_8","alias_value":"AUVI4RBA","created_at":"2026-05-18T12:30:07.202191+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/AUVI4RBAFAI4RYW74JE5O447IO","json":"https://pith.science/pith/AUVI4RBAFAI4RYW74JE5O447IO.json","graph_json":"https://pith.science/api/pith-number/AUVI4RBAFAI4RYW74JE5O447IO/graph.json","events_json":"https://pith.science/api/pith-number/AUVI4RBAFAI4RYW74JE5O447IO/events.json","paper":"https://pith.science/paper/AUVI4RBA"},"agent_actions":{"view_html":"https://pith.science/pith/AUVI4RBAFAI4RYW74JE5O447IO","download_json":"https://pith.science/pith/AUVI4RBAFAI4RYW74JE5O447IO.json","view_paper":"https://pith.science/paper/AUVI4RBA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1608.07038&json=true","fetch_graph":"https://pith.science/api/pith-number/AUVI4RBAFAI4RYW74JE5O447IO/graph.json","fetch_events":"https://pith.science/api/pith-number/AUVI4RBAFAI4RYW74JE5O447IO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AUVI4RBAFAI4RYW74JE5O447IO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AUVI4RBAFAI4RYW74JE5O447IO/action/storage_attestation","attest_author":"https://pith.science/pith/AUVI4RBAFAI4RYW74JE5O447IO/action/author_attestation","sign_citation":"https://pith.science/pith/AUVI4RBAFAI4RYW74JE5O447IO/action/citation_signature","submit_replication":"https://pith.science/pith/AUVI4RBAFAI4RYW74JE5O447IO/action/replication_record"}},"created_at":"2026-05-18T00:55:57.714824+00:00","updated_at":"2026-05-18T00:55:57.714824+00:00"}