{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:QXZRXHLYIGJYAVKRC7RMURJQPY","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"3332f21497975f606281776696de11ca80742cfac4acf94c871c43fe8bca8592","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-03-11T03:32:01Z","title_canon_sha256":"6140fc959ac5ec43ca9d735d723232de3653fb47ccbdcfd18d668347c3d4124d"},"schema_version":"1.0","source":{"id":"1903.04113","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1903.04113","created_at":"2026-07-05T00:35:00Z"},{"alias_kind":"arxiv_version","alias_value":"1903.04113v4","created_at":"2026-07-05T00:35:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.04113","created_at":"2026-07-05T00:35:00Z"},{"alias_kind":"pith_short_12","alias_value":"QXZRXHLYIGJY","created_at":"2026-07-05T00:35:00Z"},{"alias_kind":"pith_short_16","alias_value":"QXZRXHLYIGJYAVKR","created_at":"2026-07-05T00:35:00Z"},{"alias_kind":"pith_short_8","alias_value":"QXZRXHLY","created_at":"2026-07-05T00:35:00Z"}],"graph_snapshots":[{"event_id":"sha256:9f174360d37d481d3c63e4da317aaf088aef35697956c8295d02335ba1d35cf3","target":"graph","created_at":"2026-07-05T00:35:00Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/1903.04113/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We use stack words to find a new, simple proof for the best known upper bound for the number of 3-stack sortable permutations of a given length. This is the first time that stack words are used to obtain such a result.","authors_text":"Miklos Bona","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-03-11T03:32:01Z","title":"Stack words and a bound for 3-stack sortable permutations"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.04113","kind":"arxiv","version":4},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:6ff749083c11cf9953ca65b0ca052b3b9821aa1b131d72f9afd327aa9054a9b3","target":"record","created_at":"2026-07-05T00:35:00Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"3332f21497975f606281776696de11ca80742cfac4acf94c871c43fe8bca8592","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-03-11T03:32:01Z","title_canon_sha256":"6140fc959ac5ec43ca9d735d723232de3653fb47ccbdcfd18d668347c3d4124d"},"schema_version":"1.0","source":{"id":"1903.04113","kind":"arxiv","version":4}},"canonical_sha256":"85f31b9d78419380555117e2ca45307e2bb9c34300bc0bf096bb3e37506e57bb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"85f31b9d78419380555117e2ca45307e2bb9c34300bc0bf096bb3e37506e57bb","first_computed_at":"2026-07-05T00:35:00.122356Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T00:35:00.122356Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"1OXQZT3N3pBvI+CDyoU9ym3guKF8rLWS6qLguloCeBDfULYJy9ediI1siPSm4xqEPLGenA8gVdt95qPZvkqgAQ==","signature_status":"signed_v1","signed_at":"2026-07-05T00:35:00.122755Z","signed_message":"canonical_sha256_bytes"},"source_id":"1903.04113","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6ff749083c11cf9953ca65b0ca052b3b9821aa1b131d72f9afd327aa9054a9b3","sha256:9f174360d37d481d3c63e4da317aaf088aef35697956c8295d02335ba1d35cf3"],"state_sha256":"219a3f2ad1d5e8a3ad07fa68f58ce44e6bc0878b9f2c3173eb2ea555ad91ed88"}