{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:UTMQKLFX2NOARN7PQOZFB2UYEB","short_pith_number":"pith:UTMQKLFX","schema_version":"1.0","canonical_sha256":"a4d9052cb7d35c08b7ef83b250ea98207b6cf0c32ee94dd4bc42f552099fdfe2","source":{"kind":"arxiv","id":"1810.02437","version":1},"attestation_state":"computed","paper":{"title":"Permutation graphs and the Abelian sandpile model, tiered trees and non-ambiguous binary trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Einar Steingrimsson, Jason P. Smith, Mark Dukes, Thomas Selig","submitted_at":"2018-10-04T21:52:22Z","abstract_excerpt":"A permutation graph is a graph whose edges are given by inversions of a permutation. We study the Abelian sandpile model (ASM) on such graphs. We exhibit a bijection between recurrent configurations of the ASM on permutation graphs and the tiered trees introduced by Dugan et al. [10]. This bijection allows certain parameters of the recurrent configurations to be read on the corresponding tree. In particular, we show that the level of a recurrent configuration can be interpreted as the external activity of the corresponding tree, so that the bijection exhibited provides a new proof of a famous "},"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":"1810.02437","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-10-04T21:52:22Z","cross_cats_sorted":[],"title_canon_sha256":"c2a52506dfedbebff177186953898042629841141c4ba65477dba5e5caae9b21","abstract_canon_sha256":"63e0e5a42fadec558c8ca5a22cbfe4e959adbd79732987b9e146b60c7b78c589"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:04:01.883906Z","signature_b64":"2eB2HdcRM0RpNH8mUIF7McWSjkSK7DMbqVzxK3bqHZ5JOsEDIFajwnw9f97m7MCBlWTUZsf/J1zIBsNSW+XeCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a4d9052cb7d35c08b7ef83b250ea98207b6cf0c32ee94dd4bc42f552099fdfe2","last_reissued_at":"2026-05-18T00:04:01.883160Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:04:01.883160Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Permutation graphs and the Abelian sandpile model, tiered trees and non-ambiguous binary trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Einar Steingrimsson, Jason P. Smith, Mark Dukes, Thomas Selig","submitted_at":"2018-10-04T21:52:22Z","abstract_excerpt":"A permutation graph is a graph whose edges are given by inversions of a permutation. We study the Abelian sandpile model (ASM) on such graphs. We exhibit a bijection between recurrent configurations of the ASM on permutation graphs and the tiered trees introduced by Dugan et al. [10]. This bijection allows certain parameters of the recurrent configurations to be read on the corresponding tree. In particular, we show that the level of a recurrent configuration can be interpreted as the external activity of the corresponding tree, so that the bijection exhibited provides a new proof of a famous "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.02437","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":"1810.02437","created_at":"2026-05-18T00:04:01.883287+00:00"},{"alias_kind":"arxiv_version","alias_value":"1810.02437v1","created_at":"2026-05-18T00:04:01.883287+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.02437","created_at":"2026-05-18T00:04:01.883287+00:00"},{"alias_kind":"pith_short_12","alias_value":"UTMQKLFX2NOA","created_at":"2026-05-18T12:32:56.356000+00:00"},{"alias_kind":"pith_short_16","alias_value":"UTMQKLFX2NOARN7P","created_at":"2026-05-18T12:32:56.356000+00:00"},{"alias_kind":"pith_short_8","alias_value":"UTMQKLFX","created_at":"2026-05-18T12:32:56.356000+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/UTMQKLFX2NOARN7PQOZFB2UYEB","json":"https://pith.science/pith/UTMQKLFX2NOARN7PQOZFB2UYEB.json","graph_json":"https://pith.science/api/pith-number/UTMQKLFX2NOARN7PQOZFB2UYEB/graph.json","events_json":"https://pith.science/api/pith-number/UTMQKLFX2NOARN7PQOZFB2UYEB/events.json","paper":"https://pith.science/paper/UTMQKLFX"},"agent_actions":{"view_html":"https://pith.science/pith/UTMQKLFX2NOARN7PQOZFB2UYEB","download_json":"https://pith.science/pith/UTMQKLFX2NOARN7PQOZFB2UYEB.json","view_paper":"https://pith.science/paper/UTMQKLFX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1810.02437&json=true","fetch_graph":"https://pith.science/api/pith-number/UTMQKLFX2NOARN7PQOZFB2UYEB/graph.json","fetch_events":"https://pith.science/api/pith-number/UTMQKLFX2NOARN7PQOZFB2UYEB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UTMQKLFX2NOARN7PQOZFB2UYEB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UTMQKLFX2NOARN7PQOZFB2UYEB/action/storage_attestation","attest_author":"https://pith.science/pith/UTMQKLFX2NOARN7PQOZFB2UYEB/action/author_attestation","sign_citation":"https://pith.science/pith/UTMQKLFX2NOARN7PQOZFB2UYEB/action/citation_signature","submit_replication":"https://pith.science/pith/UTMQKLFX2NOARN7PQOZFB2UYEB/action/replication_record"}},"created_at":"2026-05-18T00:04:01.883287+00:00","updated_at":"2026-05-18T00:04:01.883287+00:00"}