{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:MS43YXJAZFZVYXANPH5M3MRJ3W","short_pith_number":"pith:MS43YXJA","schema_version":"1.0","canonical_sha256":"64b9bc5d20c9735c5c0d79facdb229ddb837eb57b2d0bb75b14277d1a40e3a08","source":{"kind":"arxiv","id":"1405.2441","version":2},"attestation_state":"computed","paper":{"title":"Decomposing labeled interval orders as pairs of permutations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Anders Claesson, Stuart A. Hannah","submitted_at":"2014-05-10T15:14:19Z","abstract_excerpt":"We introduce ballot matrices, a signed combinatorial structure whose definition naturally follows from the generating function for labeled interval orders. A sign reversing involution on ballot matrices is defined. We show that matrices fixed under this involution are in bijection with labeled interval orders and that they decompose to a pair consisting of a permutation and an inversion table. To fully classify such pairs, results pertaining to the enumeration of permutations having a given set of ascent bottoms are given. This allows for a new formula for the number of labeled interval orders"},"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":"1405.2441","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-05-10T15:14:19Z","cross_cats_sorted":[],"title_canon_sha256":"346b05dd09cb554f90eb413e5d0203db2636e8b5693b8f961426bc94803952e8","abstract_canon_sha256":"4734424d9dafd2ef8dacb64b892f9f6d10fb8870e9d103183f63392147d766ab"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:39:40.536299Z","signature_b64":"MgDdyzVa+HPg19kjIajs+sYvoRGsaamk63FAtjRzR7TIczlyum1WL5OQscWxWc8jjI4d0pkCNBMcAwSuipgUAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"64b9bc5d20c9735c5c0d79facdb229ddb837eb57b2d0bb75b14277d1a40e3a08","last_reissued_at":"2026-05-18T02:39:40.535771Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:39:40.535771Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Decomposing labeled interval orders as pairs of permutations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Anders Claesson, Stuart A. Hannah","submitted_at":"2014-05-10T15:14:19Z","abstract_excerpt":"We introduce ballot matrices, a signed combinatorial structure whose definition naturally follows from the generating function for labeled interval orders. A sign reversing involution on ballot matrices is defined. We show that matrices fixed under this involution are in bijection with labeled interval orders and that they decompose to a pair consisting of a permutation and an inversion table. To fully classify such pairs, results pertaining to the enumeration of permutations having a given set of ascent bottoms are given. This allows for a new formula for the number of labeled interval orders"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1405.2441","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":"1405.2441","created_at":"2026-05-18T02:39:40.535863+00:00"},{"alias_kind":"arxiv_version","alias_value":"1405.2441v2","created_at":"2026-05-18T02:39:40.535863+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.2441","created_at":"2026-05-18T02:39:40.535863+00:00"},{"alias_kind":"pith_short_12","alias_value":"MS43YXJAZFZV","created_at":"2026-05-18T12:28:38.356838+00:00"},{"alias_kind":"pith_short_16","alias_value":"MS43YXJAZFZVYXAN","created_at":"2026-05-18T12:28:38.356838+00:00"},{"alias_kind":"pith_short_8","alias_value":"MS43YXJA","created_at":"2026-05-18T12:28:38.356838+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/MS43YXJAZFZVYXANPH5M3MRJ3W","json":"https://pith.science/pith/MS43YXJAZFZVYXANPH5M3MRJ3W.json","graph_json":"https://pith.science/api/pith-number/MS43YXJAZFZVYXANPH5M3MRJ3W/graph.json","events_json":"https://pith.science/api/pith-number/MS43YXJAZFZVYXANPH5M3MRJ3W/events.json","paper":"https://pith.science/paper/MS43YXJA"},"agent_actions":{"view_html":"https://pith.science/pith/MS43YXJAZFZVYXANPH5M3MRJ3W","download_json":"https://pith.science/pith/MS43YXJAZFZVYXANPH5M3MRJ3W.json","view_paper":"https://pith.science/paper/MS43YXJA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1405.2441&json=true","fetch_graph":"https://pith.science/api/pith-number/MS43YXJAZFZVYXANPH5M3MRJ3W/graph.json","fetch_events":"https://pith.science/api/pith-number/MS43YXJAZFZVYXANPH5M3MRJ3W/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MS43YXJAZFZVYXANPH5M3MRJ3W/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MS43YXJAZFZVYXANPH5M3MRJ3W/action/storage_attestation","attest_author":"https://pith.science/pith/MS43YXJAZFZVYXANPH5M3MRJ3W/action/author_attestation","sign_citation":"https://pith.science/pith/MS43YXJAZFZVYXANPH5M3MRJ3W/action/citation_signature","submit_replication":"https://pith.science/pith/MS43YXJAZFZVYXANPH5M3MRJ3W/action/replication_record"}},"created_at":"2026-05-18T02:39:40.535863+00:00","updated_at":"2026-05-18T02:39:40.535863+00:00"}