{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:TE3NPRYPTKODVYSX64ARVLGCFI","short_pith_number":"pith:TE3NPRYP","schema_version":"1.0","canonical_sha256":"9936d7c70f9a9c3ae257f7011aacc22a01635123d085a7560ffdb4caf0e928d8","source":{"kind":"arxiv","id":"1012.5265","version":2},"attestation_state":"computed","paper":{"title":"Poset pinball, highest forms, and (n-2,2) Springer varieties","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.AT","math.CO"],"primary_cat":"math.AG","authors_text":"Barry Dewitt, Megumi Harada","submitted_at":"2010-12-23T17:55:25Z","abstract_excerpt":"We study type $A$ nilpotent Hessenberg varieties equipped with a natural $S^1$-action using techniques introduced by Tymoczko, Harada-Tymoczko, and Bayegan-Harada, with a particular emphasis on a special class of nilpotent Springer varieties corresponding to the partition $\\lambda= (n-2,2)$ for $n \\geq 4$. First we define the adjacent-pair matrix corresponding to any filling of a Young diagram with $n$ boxes with the alphabet $\\{1,2,\\ldots,n\\}$. Using the adjacent-pair matrix we make more explicit and also extend some statements concerning highest forms of linear operators in previous work of "},"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":"1012.5265","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.AG","submitted_at":"2010-12-23T17:55:25Z","cross_cats_sorted":["math.AT","math.CO"],"title_canon_sha256":"6b9a91a0b72b9955b5e9293ad46e3bca28479581c83fab970819a858e8bfa0e8","abstract_canon_sha256":"a3e2474cee76c187c30a940c0cd2c83e09380a7e71e83597d3b1e9325ae252d6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:31:59.796700Z","signature_b64":"7Jky/300EUv8HGouU8bjA2lbpYFXb4QIhUUQkwoB18jbO0tOaJKLALVvrLeqAC3CbriZ8MxRbkpZbm12jIMSDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9936d7c70f9a9c3ae257f7011aacc22a01635123d085a7560ffdb4caf0e928d8","last_reissued_at":"2026-05-18T04:31:59.796188Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:31:59.796188Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Poset pinball, highest forms, and (n-2,2) Springer varieties","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.AT","math.CO"],"primary_cat":"math.AG","authors_text":"Barry Dewitt, Megumi Harada","submitted_at":"2010-12-23T17:55:25Z","abstract_excerpt":"We study type $A$ nilpotent Hessenberg varieties equipped with a natural $S^1$-action using techniques introduced by Tymoczko, Harada-Tymoczko, and Bayegan-Harada, with a particular emphasis on a special class of nilpotent Springer varieties corresponding to the partition $\\lambda= (n-2,2)$ for $n \\geq 4$. First we define the adjacent-pair matrix corresponding to any filling of a Young diagram with $n$ boxes with the alphabet $\\{1,2,\\ldots,n\\}$. Using the adjacent-pair matrix we make more explicit and also extend some statements concerning highest forms of linear operators in previous work of "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1012.5265","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":"1012.5265","created_at":"2026-05-18T04:31:59.796261+00:00"},{"alias_kind":"arxiv_version","alias_value":"1012.5265v2","created_at":"2026-05-18T04:31:59.796261+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1012.5265","created_at":"2026-05-18T04:31:59.796261+00:00"},{"alias_kind":"pith_short_12","alias_value":"TE3NPRYPTKOD","created_at":"2026-05-18T12:26:13.927090+00:00"},{"alias_kind":"pith_short_16","alias_value":"TE3NPRYPTKODVYSX","created_at":"2026-05-18T12:26:13.927090+00:00"},{"alias_kind":"pith_short_8","alias_value":"TE3NPRYP","created_at":"2026-05-18T12:26:13.927090+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/TE3NPRYPTKODVYSX64ARVLGCFI","json":"https://pith.science/pith/TE3NPRYPTKODVYSX64ARVLGCFI.json","graph_json":"https://pith.science/api/pith-number/TE3NPRYPTKODVYSX64ARVLGCFI/graph.json","events_json":"https://pith.science/api/pith-number/TE3NPRYPTKODVYSX64ARVLGCFI/events.json","paper":"https://pith.science/paper/TE3NPRYP"},"agent_actions":{"view_html":"https://pith.science/pith/TE3NPRYPTKODVYSX64ARVLGCFI","download_json":"https://pith.science/pith/TE3NPRYPTKODVYSX64ARVLGCFI.json","view_paper":"https://pith.science/paper/TE3NPRYP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1012.5265&json=true","fetch_graph":"https://pith.science/api/pith-number/TE3NPRYPTKODVYSX64ARVLGCFI/graph.json","fetch_events":"https://pith.science/api/pith-number/TE3NPRYPTKODVYSX64ARVLGCFI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TE3NPRYPTKODVYSX64ARVLGCFI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TE3NPRYPTKODVYSX64ARVLGCFI/action/storage_attestation","attest_author":"https://pith.science/pith/TE3NPRYPTKODVYSX64ARVLGCFI/action/author_attestation","sign_citation":"https://pith.science/pith/TE3NPRYPTKODVYSX64ARVLGCFI/action/citation_signature","submit_replication":"https://pith.science/pith/TE3NPRYPTKODVYSX64ARVLGCFI/action/replication_record"}},"created_at":"2026-05-18T04:31:59.796261+00:00","updated_at":"2026-05-18T04:31:59.796261+00:00"}