{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:MPPXQQH6TS6J2ZRB6EPUJBFGBX","short_pith_number":"pith:MPPXQQH6","schema_version":"1.0","canonical_sha256":"63df7840fe9cbc9d6621f11f4484a60dcaf28d55907cdc7714efa36517e05e05","source":{"kind":"arxiv","id":"1507.01180","version":1},"attestation_state":"computed","paper":{"title":"Depth in classical Coexter groups","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Alexander Woo, Eli Bagno, Mordechai Novick, Riccardo Biagioli","submitted_at":"2015-07-05T08:53:40Z","abstract_excerpt":"The depth statistic was defined by Petersen and Tenner for an element of an arbitrary Coxeter group in terms of factorizations of the element into a product of reflections. It can also be defined as the minimal cost, given certain prescribed edge weights, for a path in the Bruhat graph from the identity to an element. We present algorithms for calculating the depth of an element of a classical Coxeter group that yield simple formulas for this statistic. We use our algorithms to characterize elements having depth equal to length. These are the short-braid-avoiding elements. We also give a chara"},"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":"1507.01180","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-07-05T08:53:40Z","cross_cats_sorted":[],"title_canon_sha256":"a3b7f075146ee7622ae4151f7a7601d87c241469b9a8270105a0a2cf2982b856","abstract_canon_sha256":"2eb785a6e0ea300b96f2dc3e96223e4dcc14ef6bb7eefab80dbc5c6f7689f5f3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:52:58.988780Z","signature_b64":"pupbD+u4eXQ7LlrjMcBZaLm92b7ebfaE1DCp2bULOm37kst+c6CScHceSMG28Lw5EoS2WW5O6rSwB2iu0FleDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"63df7840fe9cbc9d6621f11f4484a60dcaf28d55907cdc7714efa36517e05e05","last_reissued_at":"2026-05-18T00:52:58.988351Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:52:58.988351Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Depth in classical Coexter groups","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Alexander Woo, Eli Bagno, Mordechai Novick, Riccardo Biagioli","submitted_at":"2015-07-05T08:53:40Z","abstract_excerpt":"The depth statistic was defined by Petersen and Tenner for an element of an arbitrary Coxeter group in terms of factorizations of the element into a product of reflections. It can also be defined as the minimal cost, given certain prescribed edge weights, for a path in the Bruhat graph from the identity to an element. We present algorithms for calculating the depth of an element of a classical Coxeter group that yield simple formulas for this statistic. We use our algorithms to characterize elements having depth equal to length. These are the short-braid-avoiding elements. We also give a chara"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.01180","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":"1507.01180","created_at":"2026-05-18T00:52:58.988434+00:00"},{"alias_kind":"arxiv_version","alias_value":"1507.01180v1","created_at":"2026-05-18T00:52:58.988434+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.01180","created_at":"2026-05-18T00:52:58.988434+00:00"},{"alias_kind":"pith_short_12","alias_value":"MPPXQQH6TS6J","created_at":"2026-05-18T12:29:32.376354+00:00"},{"alias_kind":"pith_short_16","alias_value":"MPPXQQH6TS6J2ZRB","created_at":"2026-05-18T12:29:32.376354+00:00"},{"alias_kind":"pith_short_8","alias_value":"MPPXQQH6","created_at":"2026-05-18T12:29:32.376354+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/MPPXQQH6TS6J2ZRB6EPUJBFGBX","json":"https://pith.science/pith/MPPXQQH6TS6J2ZRB6EPUJBFGBX.json","graph_json":"https://pith.science/api/pith-number/MPPXQQH6TS6J2ZRB6EPUJBFGBX/graph.json","events_json":"https://pith.science/api/pith-number/MPPXQQH6TS6J2ZRB6EPUJBFGBX/events.json","paper":"https://pith.science/paper/MPPXQQH6"},"agent_actions":{"view_html":"https://pith.science/pith/MPPXQQH6TS6J2ZRB6EPUJBFGBX","download_json":"https://pith.science/pith/MPPXQQH6TS6J2ZRB6EPUJBFGBX.json","view_paper":"https://pith.science/paper/MPPXQQH6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1507.01180&json=true","fetch_graph":"https://pith.science/api/pith-number/MPPXQQH6TS6J2ZRB6EPUJBFGBX/graph.json","fetch_events":"https://pith.science/api/pith-number/MPPXQQH6TS6J2ZRB6EPUJBFGBX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MPPXQQH6TS6J2ZRB6EPUJBFGBX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MPPXQQH6TS6J2ZRB6EPUJBFGBX/action/storage_attestation","attest_author":"https://pith.science/pith/MPPXQQH6TS6J2ZRB6EPUJBFGBX/action/author_attestation","sign_citation":"https://pith.science/pith/MPPXQQH6TS6J2ZRB6EPUJBFGBX/action/citation_signature","submit_replication":"https://pith.science/pith/MPPXQQH6TS6J2ZRB6EPUJBFGBX/action/replication_record"}},"created_at":"2026-05-18T00:52:58.988434+00:00","updated_at":"2026-05-18T00:52:58.988434+00:00"}