{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:HXKJXDQSW57I5O4WWXRKOG5DXZ","short_pith_number":"pith:HXKJXDQS","schema_version":"1.0","canonical_sha256":"3dd49b8e12b77e8ebb96b5e2a71ba3be4f597f8ae5148995740268c645e1532c","source":{"kind":"arxiv","id":"1006.1312","version":2},"attestation_state":"computed","paper":{"title":"Partition and composition matrices","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Anders Claesson, Mark Dukes, Martina Kubitzke","submitted_at":"2010-06-07T17:51:24Z","abstract_excerpt":"This paper introduces two matrix analogues for set partitions. A composition matrix on a finite set X is an upper triangular matrix whose entries partition X, and for which there are no rows or columns containing only empty sets. A partition matrix is a composition matrix in which an order is placed on where entries may appear relative to one-another. We show that partition matrices are in one-to-one correspondence with inversion tables. Non-decreasing inversion tables are shown to correspond to partition matrices with a row ordering relation. Partition matrices which are s-diagonal are classi"},"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":"1006.1312","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-06-07T17:51:24Z","cross_cats_sorted":[],"title_canon_sha256":"e79fde57e10fa1c09f9eac1191d2a225f9e8256ec015056c4b781feaf92272bc","abstract_canon_sha256":"8dfed303b5679bc51d2d0f12a3e6d5cbad6b5040246c88044b24a916b8736575"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:28:45.628691Z","signature_b64":"0dP7QB64VxtVnKwxVEqYdZdAF/Xni+Do4llWBCk+cCgLzgJ+u7LtIq1sAB3VOa3VAnAFuRoEQlRiUbzXNkk3Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3dd49b8e12b77e8ebb96b5e2a71ba3be4f597f8ae5148995740268c645e1532c","last_reissued_at":"2026-05-18T04:28:45.628072Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:28:45.628072Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Partition and composition matrices","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Anders Claesson, Mark Dukes, Martina Kubitzke","submitted_at":"2010-06-07T17:51:24Z","abstract_excerpt":"This paper introduces two matrix analogues for set partitions. A composition matrix on a finite set X is an upper triangular matrix whose entries partition X, and for which there are no rows or columns containing only empty sets. A partition matrix is a composition matrix in which an order is placed on where entries may appear relative to one-another. We show that partition matrices are in one-to-one correspondence with inversion tables. Non-decreasing inversion tables are shown to correspond to partition matrices with a row ordering relation. Partition matrices which are s-diagonal are classi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1006.1312","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":"1006.1312","created_at":"2026-05-18T04:28:45.628170+00:00"},{"alias_kind":"arxiv_version","alias_value":"1006.1312v2","created_at":"2026-05-18T04:28:45.628170+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1006.1312","created_at":"2026-05-18T04:28:45.628170+00:00"},{"alias_kind":"pith_short_12","alias_value":"HXKJXDQSW57I","created_at":"2026-05-18T12:26:07.630475+00:00"},{"alias_kind":"pith_short_16","alias_value":"HXKJXDQSW57I5O4W","created_at":"2026-05-18T12:26:07.630475+00:00"},{"alias_kind":"pith_short_8","alias_value":"HXKJXDQS","created_at":"2026-05-18T12:26:07.630475+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/HXKJXDQSW57I5O4WWXRKOG5DXZ","json":"https://pith.science/pith/HXKJXDQSW57I5O4WWXRKOG5DXZ.json","graph_json":"https://pith.science/api/pith-number/HXKJXDQSW57I5O4WWXRKOG5DXZ/graph.json","events_json":"https://pith.science/api/pith-number/HXKJXDQSW57I5O4WWXRKOG5DXZ/events.json","paper":"https://pith.science/paper/HXKJXDQS"},"agent_actions":{"view_html":"https://pith.science/pith/HXKJXDQSW57I5O4WWXRKOG5DXZ","download_json":"https://pith.science/pith/HXKJXDQSW57I5O4WWXRKOG5DXZ.json","view_paper":"https://pith.science/paper/HXKJXDQS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1006.1312&json=true","fetch_graph":"https://pith.science/api/pith-number/HXKJXDQSW57I5O4WWXRKOG5DXZ/graph.json","fetch_events":"https://pith.science/api/pith-number/HXKJXDQSW57I5O4WWXRKOG5DXZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HXKJXDQSW57I5O4WWXRKOG5DXZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HXKJXDQSW57I5O4WWXRKOG5DXZ/action/storage_attestation","attest_author":"https://pith.science/pith/HXKJXDQSW57I5O4WWXRKOG5DXZ/action/author_attestation","sign_citation":"https://pith.science/pith/HXKJXDQSW57I5O4WWXRKOG5DXZ/action/citation_signature","submit_replication":"https://pith.science/pith/HXKJXDQSW57I5O4WWXRKOG5DXZ/action/replication_record"}},"created_at":"2026-05-18T04:28:45.628170+00:00","updated_at":"2026-05-18T04:28:45.628170+00:00"}