{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:WGW7FPHFZS6P52GFOKYBAF3WAU","short_pith_number":"pith:WGW7FPHF","schema_version":"1.0","canonical_sha256":"b1adf2bce5ccbcfee8c572b0101776050e9c5cd50a91c55f4c50030c1bfd8418","source":{"kind":"arxiv","id":"1011.5870","version":1},"attestation_state":"computed","paper":{"title":"On the t-Term Rank of a Matrix","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Kathleen P. Kiernan, Michael W. Schroeder, Richard A. Brualdi, Seth A. Meyer","submitted_at":"2010-11-26T20:34:29Z","abstract_excerpt":"For t a positive integer, the t-term rank of a (0,1)-matrix A is defined to be the largest number of 1s in A with at most one 1 in each column and at most t 1s in each row. Thus the 1-term rank is the ordinary term rank. We generalize some basic results for the term rank to the t-term rank, including a formula for the maximum term rank over a nonempty class of (0,1)-matrices with the the same row sum and column sum vectors. We also show the surprising result that in such a class there exists a matrix which realizes all of the maximum terms ranks between 1 and t."},"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":"1011.5870","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-11-26T20:34:29Z","cross_cats_sorted":[],"title_canon_sha256":"87fb2554f2b99e4ab5749d92b1d4a5bc9c80ac92eb7a829c926b271d9d5f9739","abstract_canon_sha256":"aca68f596a57a3183e21ba0252b986f6a4fb5f89cd262b4f93ef13088dbc7748"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:34:38.367182Z","signature_b64":"V+fywepvqEXuQbOIxXeuF92hvIinBsYNh4/rUbhEbuPN19HFIxPZA7xFvsd0hUhPiRNCmgzAp3Hk61MAma+kCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b1adf2bce5ccbcfee8c572b0101776050e9c5cd50a91c55f4c50030c1bfd8418","last_reissued_at":"2026-05-18T04:34:38.366418Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:34:38.366418Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the t-Term Rank of a Matrix","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Kathleen P. Kiernan, Michael W. Schroeder, Richard A. Brualdi, Seth A. Meyer","submitted_at":"2010-11-26T20:34:29Z","abstract_excerpt":"For t a positive integer, the t-term rank of a (0,1)-matrix A is defined to be the largest number of 1s in A with at most one 1 in each column and at most t 1s in each row. Thus the 1-term rank is the ordinary term rank. We generalize some basic results for the term rank to the t-term rank, including a formula for the maximum term rank over a nonempty class of (0,1)-matrices with the the same row sum and column sum vectors. We also show the surprising result that in such a class there exists a matrix which realizes all of the maximum terms ranks between 1 and t."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1011.5870","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1011.5870","created_at":"2026-05-18T04:34:38.366541+00:00"},{"alias_kind":"arxiv_version","alias_value":"1011.5870v1","created_at":"2026-05-18T04:34:38.366541+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1011.5870","created_at":"2026-05-18T04:34:38.366541+00:00"},{"alias_kind":"pith_short_12","alias_value":"WGW7FPHFZS6P","created_at":"2026-05-18T12:26:15.391820+00:00"},{"alias_kind":"pith_short_16","alias_value":"WGW7FPHFZS6P52GF","created_at":"2026-05-18T12:26:15.391820+00:00"},{"alias_kind":"pith_short_8","alias_value":"WGW7FPHF","created_at":"2026-05-18T12:26:15.391820+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/WGW7FPHFZS6P52GFOKYBAF3WAU","json":"https://pith.science/pith/WGW7FPHFZS6P52GFOKYBAF3WAU.json","graph_json":"https://pith.science/api/pith-number/WGW7FPHFZS6P52GFOKYBAF3WAU/graph.json","events_json":"https://pith.science/api/pith-number/WGW7FPHFZS6P52GFOKYBAF3WAU/events.json","paper":"https://pith.science/paper/WGW7FPHF"},"agent_actions":{"view_html":"https://pith.science/pith/WGW7FPHFZS6P52GFOKYBAF3WAU","download_json":"https://pith.science/pith/WGW7FPHFZS6P52GFOKYBAF3WAU.json","view_paper":"https://pith.science/paper/WGW7FPHF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1011.5870&json=true","fetch_graph":"https://pith.science/api/pith-number/WGW7FPHFZS6P52GFOKYBAF3WAU/graph.json","fetch_events":"https://pith.science/api/pith-number/WGW7FPHFZS6P52GFOKYBAF3WAU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WGW7FPHFZS6P52GFOKYBAF3WAU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WGW7FPHFZS6P52GFOKYBAF3WAU/action/storage_attestation","attest_author":"https://pith.science/pith/WGW7FPHFZS6P52GFOKYBAF3WAU/action/author_attestation","sign_citation":"https://pith.science/pith/WGW7FPHFZS6P52GFOKYBAF3WAU/action/citation_signature","submit_replication":"https://pith.science/pith/WGW7FPHFZS6P52GFOKYBAF3WAU/action/replication_record"}},"created_at":"2026-05-18T04:34:38.366541+00:00","updated_at":"2026-05-18T04:34:38.366541+00:00"}