{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:MM3UC5ZWJH7EXZ6VEAUBNIOFMM","short_pith_number":"pith:MM3UC5ZW","schema_version":"1.0","canonical_sha256":"633741773649fe4be7d5202816a1c56334cf3d987875115b58f455419d6e5207","source":{"kind":"arxiv","id":"1212.6756","version":1},"attestation_state":"computed","paper":{"title":"Pairwise Suitable Family of Permutations and Boxicity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Deepak Rajendraprasad, L. Sunil Chandran, Manu Basavaraju, Rogers Mathew","submitted_at":"2012-12-30T17:52:44Z","abstract_excerpt":"A family F of permutations of the vertices of a hypergraph H is called \"pairwise suitable\" for H if, for every pair of disjoint edges in H, there exists a permutation in F in which all the vertices in one edge precede those in the other. The cardinality of a smallest such family of permutations for H is called the \"separation dimension\" of H and is denoted by \\pi(H). Equivalently, \\pi(H) is the smallest natural number k so that the vertices of H can be embedded in R^k such that any two disjoint edges of H can be separated by a hyperplane normal to one of the axes. We show that the separation d"},"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":"1212.6756","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-12-30T17:52:44Z","cross_cats_sorted":[],"title_canon_sha256":"36a3a45a17a605884cbaacb99ee1ba00d033a7f18f9cc84e8c1be7e804b8a511","abstract_canon_sha256":"e68ba93e6c94d2f23974f46df25c7634a40891492ddb7a0a0389d65ea8547a0d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:37:31.005874Z","signature_b64":"AM1NqDc3xLX1WhoqmiQeoO1/jFlVpNBj3r4EbCBOrSSjWPV7CnYB+rI3GdmxoS0P0HrxUNkOhAxzbUrQrHqDBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"633741773649fe4be7d5202816a1c56334cf3d987875115b58f455419d6e5207","last_reissued_at":"2026-05-18T03:37:31.005192Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:37:31.005192Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Pairwise Suitable Family of Permutations and Boxicity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Deepak Rajendraprasad, L. Sunil Chandran, Manu Basavaraju, Rogers Mathew","submitted_at":"2012-12-30T17:52:44Z","abstract_excerpt":"A family F of permutations of the vertices of a hypergraph H is called \"pairwise suitable\" for H if, for every pair of disjoint edges in H, there exists a permutation in F in which all the vertices in one edge precede those in the other. The cardinality of a smallest such family of permutations for H is called the \"separation dimension\" of H and is denoted by \\pi(H). Equivalently, \\pi(H) is the smallest natural number k so that the vertices of H can be embedded in R^k such that any two disjoint edges of H can be separated by a hyperplane normal to one of the axes. We show that the separation d"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1212.6756","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":"1212.6756","created_at":"2026-05-18T03:37:31.005299+00:00"},{"alias_kind":"arxiv_version","alias_value":"1212.6756v1","created_at":"2026-05-18T03:37:31.005299+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1212.6756","created_at":"2026-05-18T03:37:31.005299+00:00"},{"alias_kind":"pith_short_12","alias_value":"MM3UC5ZWJH7E","created_at":"2026-05-18T12:27:14.488303+00:00"},{"alias_kind":"pith_short_16","alias_value":"MM3UC5ZWJH7EXZ6V","created_at":"2026-05-18T12:27:14.488303+00:00"},{"alias_kind":"pith_short_8","alias_value":"MM3UC5ZW","created_at":"2026-05-18T12:27:14.488303+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/MM3UC5ZWJH7EXZ6VEAUBNIOFMM","json":"https://pith.science/pith/MM3UC5ZWJH7EXZ6VEAUBNIOFMM.json","graph_json":"https://pith.science/api/pith-number/MM3UC5ZWJH7EXZ6VEAUBNIOFMM/graph.json","events_json":"https://pith.science/api/pith-number/MM3UC5ZWJH7EXZ6VEAUBNIOFMM/events.json","paper":"https://pith.science/paper/MM3UC5ZW"},"agent_actions":{"view_html":"https://pith.science/pith/MM3UC5ZWJH7EXZ6VEAUBNIOFMM","download_json":"https://pith.science/pith/MM3UC5ZWJH7EXZ6VEAUBNIOFMM.json","view_paper":"https://pith.science/paper/MM3UC5ZW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1212.6756&json=true","fetch_graph":"https://pith.science/api/pith-number/MM3UC5ZWJH7EXZ6VEAUBNIOFMM/graph.json","fetch_events":"https://pith.science/api/pith-number/MM3UC5ZWJH7EXZ6VEAUBNIOFMM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MM3UC5ZWJH7EXZ6VEAUBNIOFMM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MM3UC5ZWJH7EXZ6VEAUBNIOFMM/action/storage_attestation","attest_author":"https://pith.science/pith/MM3UC5ZWJH7EXZ6VEAUBNIOFMM/action/author_attestation","sign_citation":"https://pith.science/pith/MM3UC5ZWJH7EXZ6VEAUBNIOFMM/action/citation_signature","submit_replication":"https://pith.science/pith/MM3UC5ZWJH7EXZ6VEAUBNIOFMM/action/replication_record"}},"created_at":"2026-05-18T03:37:31.005299+00:00","updated_at":"2026-05-18T03:37:31.005299+00:00"}