{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:NH4KK2DBLIP5OLXJMFGSOWSTB7","short_pith_number":"pith:NH4KK2DB","schema_version":"1.0","canonical_sha256":"69f8a568615a1fd72ee9614d275a530fd9d94ae25e417a7985e5e891b2406b01","source":{"kind":"arxiv","id":"1201.4669","version":3},"attestation_state":"computed","paper":{"title":"On maximal chains in the non-crossing partition lattice","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.GR"],"primary_cat":"math.CO","authors_text":"Ron M. Adin, Yuval Roichman","submitted_at":"2012-01-23T10:39:49Z","abstract_excerpt":"A weak order on the set of maximal chains of the non-crossing partition lattice is introduced and studied. A $0$-Hecke algebra action is used to compute the radius of the graph on these chains in which two chains are adjacent if they differ in exactly one element."},"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":"1201.4669","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-01-23T10:39:49Z","cross_cats_sorted":["math.GR"],"title_canon_sha256":"bc21f522092420ffb8829427e11b7f7ddc07e5cf81a12a82fd1fd8aa99aa0645","abstract_canon_sha256":"6af2460bb0284a7615e3aaa3a4f7e054185fb291992b2b8686ca884ac7809fa4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:03:57.049395Z","signature_b64":"73rxELJmkHtSyH9w4JYCe68habZ7IMANE0aEJL+CfStsSH30/KEwl5hSiQFfejRXZOJh4YSIjpzBWLuBtvFiDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"69f8a568615a1fd72ee9614d275a530fd9d94ae25e417a7985e5e891b2406b01","last_reissued_at":"2026-05-18T03:03:57.048676Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:03:57.048676Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On maximal chains in the non-crossing partition lattice","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.GR"],"primary_cat":"math.CO","authors_text":"Ron M. Adin, Yuval Roichman","submitted_at":"2012-01-23T10:39:49Z","abstract_excerpt":"A weak order on the set of maximal chains of the non-crossing partition lattice is introduced and studied. A $0$-Hecke algebra action is used to compute the radius of the graph on these chains in which two chains are adjacent if they differ in exactly one element."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1201.4669","kind":"arxiv","version":3},"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":"1201.4669","created_at":"2026-05-18T03:03:57.048801+00:00"},{"alias_kind":"arxiv_version","alias_value":"1201.4669v3","created_at":"2026-05-18T03:03:57.048801+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1201.4669","created_at":"2026-05-18T03:03:57.048801+00:00"},{"alias_kind":"pith_short_12","alias_value":"NH4KK2DBLIP5","created_at":"2026-05-18T12:27:16.716162+00:00"},{"alias_kind":"pith_short_16","alias_value":"NH4KK2DBLIP5OLXJ","created_at":"2026-05-18T12:27:16.716162+00:00"},{"alias_kind":"pith_short_8","alias_value":"NH4KK2DB","created_at":"2026-05-18T12:27:16.716162+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/NH4KK2DBLIP5OLXJMFGSOWSTB7","json":"https://pith.science/pith/NH4KK2DBLIP5OLXJMFGSOWSTB7.json","graph_json":"https://pith.science/api/pith-number/NH4KK2DBLIP5OLXJMFGSOWSTB7/graph.json","events_json":"https://pith.science/api/pith-number/NH4KK2DBLIP5OLXJMFGSOWSTB7/events.json","paper":"https://pith.science/paper/NH4KK2DB"},"agent_actions":{"view_html":"https://pith.science/pith/NH4KK2DBLIP5OLXJMFGSOWSTB7","download_json":"https://pith.science/pith/NH4KK2DBLIP5OLXJMFGSOWSTB7.json","view_paper":"https://pith.science/paper/NH4KK2DB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1201.4669&json=true","fetch_graph":"https://pith.science/api/pith-number/NH4KK2DBLIP5OLXJMFGSOWSTB7/graph.json","fetch_events":"https://pith.science/api/pith-number/NH4KK2DBLIP5OLXJMFGSOWSTB7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NH4KK2DBLIP5OLXJMFGSOWSTB7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NH4KK2DBLIP5OLXJMFGSOWSTB7/action/storage_attestation","attest_author":"https://pith.science/pith/NH4KK2DBLIP5OLXJMFGSOWSTB7/action/author_attestation","sign_citation":"https://pith.science/pith/NH4KK2DBLIP5OLXJMFGSOWSTB7/action/citation_signature","submit_replication":"https://pith.science/pith/NH4KK2DBLIP5OLXJMFGSOWSTB7/action/replication_record"}},"created_at":"2026-05-18T03:03:57.048801+00:00","updated_at":"2026-05-18T03:03:57.048801+00:00"}