{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:6VXJBFOKVMYCSIMQYGENO2QJDC","short_pith_number":"pith:6VXJBFOK","schema_version":"1.0","canonical_sha256":"f56e9095caab30292190c188d76a0918b4255e96c79ecc9dcd9ec9d769dbb900","source":{"kind":"arxiv","id":"1109.1216","version":1},"attestation_state":"computed","paper":{"title":"Combinatorial representations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Maximilien Gadouleau, Peter J. Cameron, S{\\o}ren Riis","submitted_at":"2011-09-06T15:49:10Z","abstract_excerpt":"This paper introduces combinatorial representations, which generalise the notion of linear representations of matroids. We show that any family of subsets of the same cardinality has a combinatorial representation via matrices. We then prove that any graph is representable over all alphabets of size larger than some number depending on the graph. We also provide a characterisation of families representable over a given alphabet. Then, we associate a rank function and a rank operator to any representation which help us determine some criteria for the functions used in a representation. While li"},"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":"1109.1216","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-09-06T15:49:10Z","cross_cats_sorted":[],"title_canon_sha256":"d6da4fa86acfdb1ef89d375d658a02de82c52100286e3860df22ed87e418363e","abstract_canon_sha256":"f9a7ef0706d5461bbdb3a5c4dba0d6b5b37fbc6a4910ad2303779159cc4446c7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:14:05.140577Z","signature_b64":"O4ekIT7zWBx71DCYosvpKif+D3Ye1ggctLwc0b7FPVU15M0ySukjMmm9QauSmpypZxyaRRNj7Y2boUX3kyBxBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f56e9095caab30292190c188d76a0918b4255e96c79ecc9dcd9ec9d769dbb900","last_reissued_at":"2026-05-18T04:14:05.139976Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:14:05.139976Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Combinatorial representations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Maximilien Gadouleau, Peter J. Cameron, S{\\o}ren Riis","submitted_at":"2011-09-06T15:49:10Z","abstract_excerpt":"This paper introduces combinatorial representations, which generalise the notion of linear representations of matroids. We show that any family of subsets of the same cardinality has a combinatorial representation via matrices. We then prove that any graph is representable over all alphabets of size larger than some number depending on the graph. We also provide a characterisation of families representable over a given alphabet. Then, we associate a rank function and a rank operator to any representation which help us determine some criteria for the functions used in a representation. While li"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1109.1216","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":"1109.1216","created_at":"2026-05-18T04:14:05.140057+00:00"},{"alias_kind":"arxiv_version","alias_value":"1109.1216v1","created_at":"2026-05-18T04:14:05.140057+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1109.1216","created_at":"2026-05-18T04:14:05.140057+00:00"},{"alias_kind":"pith_short_12","alias_value":"6VXJBFOKVMYC","created_at":"2026-05-18T12:26:22.705136+00:00"},{"alias_kind":"pith_short_16","alias_value":"6VXJBFOKVMYCSIMQ","created_at":"2026-05-18T12:26:22.705136+00:00"},{"alias_kind":"pith_short_8","alias_value":"6VXJBFOK","created_at":"2026-05-18T12:26:22.705136+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/6VXJBFOKVMYCSIMQYGENO2QJDC","json":"https://pith.science/pith/6VXJBFOKVMYCSIMQYGENO2QJDC.json","graph_json":"https://pith.science/api/pith-number/6VXJBFOKVMYCSIMQYGENO2QJDC/graph.json","events_json":"https://pith.science/api/pith-number/6VXJBFOKVMYCSIMQYGENO2QJDC/events.json","paper":"https://pith.science/paper/6VXJBFOK"},"agent_actions":{"view_html":"https://pith.science/pith/6VXJBFOKVMYCSIMQYGENO2QJDC","download_json":"https://pith.science/pith/6VXJBFOKVMYCSIMQYGENO2QJDC.json","view_paper":"https://pith.science/paper/6VXJBFOK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1109.1216&json=true","fetch_graph":"https://pith.science/api/pith-number/6VXJBFOKVMYCSIMQYGENO2QJDC/graph.json","fetch_events":"https://pith.science/api/pith-number/6VXJBFOKVMYCSIMQYGENO2QJDC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6VXJBFOKVMYCSIMQYGENO2QJDC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6VXJBFOKVMYCSIMQYGENO2QJDC/action/storage_attestation","attest_author":"https://pith.science/pith/6VXJBFOKVMYCSIMQYGENO2QJDC/action/author_attestation","sign_citation":"https://pith.science/pith/6VXJBFOKVMYCSIMQYGENO2QJDC/action/citation_signature","submit_replication":"https://pith.science/pith/6VXJBFOKVMYCSIMQYGENO2QJDC/action/replication_record"}},"created_at":"2026-05-18T04:14:05.140057+00:00","updated_at":"2026-05-18T04:14:05.140057+00:00"}