{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2002:7RU3T2SFMQ7CZENNQO4TE5DFMQ","short_pith_number":"pith:7RU3T2SF","schema_version":"1.0","canonical_sha256":"fc69b9ea45643e2c91ad83b9327465643bac7f96e6e94ee79a5551e069908310","source":{"kind":"arxiv","id":"math/0212097","version":2},"attestation_state":"computed","paper":{"title":"Maps between higher Bruhat orders and higher Stasheff-Tamari posets","license":"","headline":"","cross_cats":["math.MG"],"primary_cat":"math.CO","authors_text":"Hugh Thomas","submitted_at":"2002-12-06T01:10:53Z","abstract_excerpt":"We make explict a description in terms of convex geometry of the higher Bruhat orders B(n,d) sketched by Kapranov and Voevodsky. We give an analogous description of the higher Stasheff-Tamari poset S_1(n,d). We show that the map f sketched by Kapranov and Voevodsky from B(n,d) to S([0,n+1],d+1) coincides with the map constructed by Rambau, and is a surjection for d<=2. We construct a map analogous to f from S_1(n,d) to B(n-1,d), and show that it is always a poset embedding. We also give an explicit criterion to determine if an element of B(n-1,d) is in the image of this map."},"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":"math/0212097","kind":"arxiv","version":2},"metadata":{"license":"","primary_cat":"math.CO","submitted_at":"2002-12-06T01:10:53Z","cross_cats_sorted":["math.MG"],"title_canon_sha256":"fb5ecae683e5e9d869292c6862e838ed78f521ff17d876dde0654f4aabe894cd","abstract_canon_sha256":"7ac5e4334b297faea99346caf07153a7b9ed0f9e38eb8b7a6fa03491bfb878d6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T14:36:48.557567Z","signature_b64":"XsB+xchBSt8PoaOIEHFLBoG5mJnNwFMMARzSxb8A++GASPrntAM+aOOChJJuss/N/9hqD5R4Q2CNuwKqYu+QBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fc69b9ea45643e2c91ad83b9327465643bac7f96e6e94ee79a5551e069908310","last_reissued_at":"2026-07-04T14:36:48.557048Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T14:36:48.557048Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Maps between higher Bruhat orders and higher Stasheff-Tamari posets","license":"","headline":"","cross_cats":["math.MG"],"primary_cat":"math.CO","authors_text":"Hugh Thomas","submitted_at":"2002-12-06T01:10:53Z","abstract_excerpt":"We make explict a description in terms of convex geometry of the higher Bruhat orders B(n,d) sketched by Kapranov and Voevodsky. We give an analogous description of the higher Stasheff-Tamari poset S_1(n,d). We show that the map f sketched by Kapranov and Voevodsky from B(n,d) to S([0,n+1],d+1) coincides with the map constructed by Rambau, and is a surjection for d<=2. We construct a map analogous to f from S_1(n,d) to B(n-1,d), and show that it is always a poset embedding. We also give an explicit criterion to determine if an element of B(n-1,d) is in the image of this map."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"math/0212097","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/math/0212097/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"math/0212097","created_at":"2026-07-04T14:36:48.557106+00:00"},{"alias_kind":"arxiv_version","alias_value":"math/0212097v2","created_at":"2026-07-04T14:36:48.557106+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.math/0212097","created_at":"2026-07-04T14:36:48.557106+00:00"},{"alias_kind":"pith_short_12","alias_value":"7RU3T2SFMQ7C","created_at":"2026-07-04T14:36:48.557106+00:00"},{"alias_kind":"pith_short_16","alias_value":"7RU3T2SFMQ7CZENN","created_at":"2026-07-04T14:36:48.557106+00:00"},{"alias_kind":"pith_short_8","alias_value":"7RU3T2SF","created_at":"2026-07-04T14:36:48.557106+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2506.08858","citing_title":"Preorders on maximal chains: hyperplane arrangements, Cambrian lattices, and maximal green sequences","ref_index":2002,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/7RU3T2SFMQ7CZENNQO4TE5DFMQ","json":"https://pith.science/pith/7RU3T2SFMQ7CZENNQO4TE5DFMQ.json","graph_json":"https://pith.science/api/pith-number/7RU3T2SFMQ7CZENNQO4TE5DFMQ/graph.json","events_json":"https://pith.science/api/pith-number/7RU3T2SFMQ7CZENNQO4TE5DFMQ/events.json","paper":"https://pith.science/paper/7RU3T2SF"},"agent_actions":{"view_html":"https://pith.science/pith/7RU3T2SFMQ7CZENNQO4TE5DFMQ","download_json":"https://pith.science/pith/7RU3T2SFMQ7CZENNQO4TE5DFMQ.json","view_paper":"https://pith.science/paper/7RU3T2SF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=math/0212097&json=true","fetch_graph":"https://pith.science/api/pith-number/7RU3T2SFMQ7CZENNQO4TE5DFMQ/graph.json","fetch_events":"https://pith.science/api/pith-number/7RU3T2SFMQ7CZENNQO4TE5DFMQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7RU3T2SFMQ7CZENNQO4TE5DFMQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7RU3T2SFMQ7CZENNQO4TE5DFMQ/action/storage_attestation","attest_author":"https://pith.science/pith/7RU3T2SFMQ7CZENNQO4TE5DFMQ/action/author_attestation","sign_citation":"https://pith.science/pith/7RU3T2SFMQ7CZENNQO4TE5DFMQ/action/citation_signature","submit_replication":"https://pith.science/pith/7RU3T2SFMQ7CZENNQO4TE5DFMQ/action/replication_record"}},"created_at":"2026-07-04T14:36:48.557106+00:00","updated_at":"2026-07-04T14:36:48.557106+00:00"}