{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:WGW7FPHFZS6P52GFOKYBAF3WAU","short_pith_number":"pith:WGW7FPHF","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"},"canonical_sha256":"b1adf2bce5ccbcfee8c572b0101776050e9c5cd50a91c55f4c50030c1bfd8418","source":{"kind":"arxiv","id":"1011.5870","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1011.5870","created_at":"2026-05-18T04:34:38Z"},{"alias_kind":"arxiv_version","alias_value":"1011.5870v1","created_at":"2026-05-18T04:34:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1011.5870","created_at":"2026-05-18T04:34:38Z"},{"alias_kind":"pith_short_12","alias_value":"WGW7FPHFZS6P","created_at":"2026-05-18T12:26:15Z"},{"alias_kind":"pith_short_16","alias_value":"WGW7FPHFZS6P52GF","created_at":"2026-05-18T12:26:15Z"},{"alias_kind":"pith_short_8","alias_value":"WGW7FPHF","created_at":"2026-05-18T12:26:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:WGW7FPHFZS6P52GFOKYBAF3WAU","target":"record","payload":{"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"},"canonical_sha256":"b1adf2bce5ccbcfee8c572b0101776050e9c5cd50a91c55f4c50030c1bfd8418","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"},"source_kind":"arxiv","source_id":"1011.5870","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-18T04:34:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kkZD0zdvOykTJlyejBsqnB8Ay6IbWoXKqm/uB18dz3GvRvM8qpq5voEd6uHQc05rAvRkYrcYJJdx/FPVDfRmBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T04:07:35.725576Z"},"content_sha256":"4110c78faf89f130118b735046a3a208a631b062864d0051e9566ce4a0bc1410","schema_version":"1.0","event_id":"sha256:4110c78faf89f130118b735046a3a208a631b062864d0051e9566ce4a0bc1410"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:WGW7FPHFZS6P52GFOKYBAF3WAU","target":"graph","payload":{"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"},"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-18T04:34:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iwFWdk9F0zstdLIs8M5UdC3Zll1Wqo0cqaUvpUgQ6vaknm2g5HdirVLPWsR2xl33aOFZ9ZO67FUwvE57qYicCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T04:07:35.725927Z"},"content_sha256":"f59c10b5927c6b44d613557c65e4f329b1c174427f2356d61aa2a7d703ef606a","schema_version":"1.0","event_id":"sha256:f59c10b5927c6b44d613557c65e4f329b1c174427f2356d61aa2a7d703ef606a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WGW7FPHFZS6P52GFOKYBAF3WAU/bundle.json","state_url":"https://pith.science/pith/WGW7FPHFZS6P52GFOKYBAF3WAU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WGW7FPHFZS6P52GFOKYBAF3WAU/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-28T04:07:35Z","links":{"resolver":"https://pith.science/pith/WGW7FPHFZS6P52GFOKYBAF3WAU","bundle":"https://pith.science/pith/WGW7FPHFZS6P52GFOKYBAF3WAU/bundle.json","state":"https://pith.science/pith/WGW7FPHFZS6P52GFOKYBAF3WAU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WGW7FPHFZS6P52GFOKYBAF3WAU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:WGW7FPHFZS6P52GFOKYBAF3WAU","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":"aca68f596a57a3183e21ba0252b986f6a4fb5f89cd262b4f93ef13088dbc7748","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-11-26T20:34:29Z","title_canon_sha256":"87fb2554f2b99e4ab5749d92b1d4a5bc9c80ac92eb7a829c926b271d9d5f9739"},"schema_version":"1.0","source":{"id":"1011.5870","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1011.5870","created_at":"2026-05-18T04:34:38Z"},{"alias_kind":"arxiv_version","alias_value":"1011.5870v1","created_at":"2026-05-18T04:34:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1011.5870","created_at":"2026-05-18T04:34:38Z"},{"alias_kind":"pith_short_12","alias_value":"WGW7FPHFZS6P","created_at":"2026-05-18T12:26:15Z"},{"alias_kind":"pith_short_16","alias_value":"WGW7FPHFZS6P52GF","created_at":"2026-05-18T12:26:15Z"},{"alias_kind":"pith_short_8","alias_value":"WGW7FPHF","created_at":"2026-05-18T12:26:15Z"}],"graph_snapshots":[{"event_id":"sha256:f59c10b5927c6b44d613557c65e4f329b1c174427f2356d61aa2a7d703ef606a","target":"graph","created_at":"2026-05-18T04:34:38Z","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":"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.","authors_text":"Kathleen P. Kiernan, Michael W. Schroeder, Richard A. Brualdi, Seth A. Meyer","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-11-26T20:34:29Z","title":"On the t-Term Rank of a Matrix"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1011.5870","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:4110c78faf89f130118b735046a3a208a631b062864d0051e9566ce4a0bc1410","target":"record","created_at":"2026-05-18T04:34:38Z","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":"aca68f596a57a3183e21ba0252b986f6a4fb5f89cd262b4f93ef13088dbc7748","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-11-26T20:34:29Z","title_canon_sha256":"87fb2554f2b99e4ab5749d92b1d4a5bc9c80ac92eb7a829c926b271d9d5f9739"},"schema_version":"1.0","source":{"id":"1011.5870","kind":"arxiv","version":1}},"canonical_sha256":"b1adf2bce5ccbcfee8c572b0101776050e9c5cd50a91c55f4c50030c1bfd8418","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b1adf2bce5ccbcfee8c572b0101776050e9c5cd50a91c55f4c50030c1bfd8418","first_computed_at":"2026-05-18T04:34:38.366418Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:34:38.366418Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"V+fywepvqEXuQbOIxXeuF92hvIinBsYNh4/rUbhEbuPN19HFIxPZA7xFvsd0hUhPiRNCmgzAp3Hk61MAma+kCA==","signature_status":"signed_v1","signed_at":"2026-05-18T04:34:38.367182Z","signed_message":"canonical_sha256_bytes"},"source_id":"1011.5870","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4110c78faf89f130118b735046a3a208a631b062864d0051e9566ce4a0bc1410","sha256:f59c10b5927c6b44d613557c65e4f329b1c174427f2356d61aa2a7d703ef606a"],"state_sha256":"58906c7eb43b48fa6488f407e841a5d035472886ce81e0000fc4f99dc2887391"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ADNqIWcecp4rd18hefGCoCnAIFqE7RtT3i/ZzX4YVi1KkR9bwg+vlcZr/KAhsXRN5R+FIv/c82pOP0tbdZpeBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T04:07:35.727894Z","bundle_sha256":"0e84beea100b665a9508bc9d006e4b13f03d5d511f60d47cdbafa6ca7fae61d8"}}