{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:NAMBBZVVCKF2WEOUSIGPYHCQIL","short_pith_number":"pith:NAMBBZVV","schema_version":"1.0","canonical_sha256":"681810e6b5128bab11d4920cfc1c5042fc0fa14f2ae51b4f9f8e76ce854a7030","source":{"kind":"arxiv","id":"1406.5207","version":1},"attestation_state":"computed","paper":{"title":"On the longest k-alternating subsequence","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Igor Pak, Robin Pemantle","submitted_at":"2014-06-19T20:34:21Z","abstract_excerpt":"We show that the longest k-alternating substring of a random permutation has length asymptotic to 2 (n-k) / 3."},"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":"1406.5207","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-06-19T20:34:21Z","cross_cats_sorted":[],"title_canon_sha256":"248fccb882cd97e75cc70c4036a499bbcfeaa940ca732c0fa3b3baf72239cb0c","abstract_canon_sha256":"9bc2c43d84035255886ad9d22ce8bd71f9826d46d7c7a25243c0e13ce2791ca7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:49:19.689331Z","signature_b64":"h0JZvkaGIyYMvuH61T2cQpFYueMLvpwiINcMroeOZ0KmgzLWfudZ7PTY2FIw+7JN1C1kDh4TWFsX69dG+jI+Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"681810e6b5128bab11d4920cfc1c5042fc0fa14f2ae51b4f9f8e76ce854a7030","last_reissued_at":"2026-05-18T02:49:19.688638Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:49:19.688638Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the longest k-alternating subsequence","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Igor Pak, Robin Pemantle","submitted_at":"2014-06-19T20:34:21Z","abstract_excerpt":"We show that the longest k-alternating substring of a random permutation has length asymptotic to 2 (n-k) / 3."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1406.5207","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":"1406.5207","created_at":"2026-05-18T02:49:19.688744+00:00"},{"alias_kind":"arxiv_version","alias_value":"1406.5207v1","created_at":"2026-05-18T02:49:19.688744+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1406.5207","created_at":"2026-05-18T02:49:19.688744+00:00"},{"alias_kind":"pith_short_12","alias_value":"NAMBBZVVCKF2","created_at":"2026-05-18T12:28:41.024544+00:00"},{"alias_kind":"pith_short_16","alias_value":"NAMBBZVVCKF2WEOU","created_at":"2026-05-18T12:28:41.024544+00:00"},{"alias_kind":"pith_short_8","alias_value":"NAMBBZVV","created_at":"2026-05-18T12:28:41.024544+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/NAMBBZVVCKF2WEOUSIGPYHCQIL","json":"https://pith.science/pith/NAMBBZVVCKF2WEOUSIGPYHCQIL.json","graph_json":"https://pith.science/api/pith-number/NAMBBZVVCKF2WEOUSIGPYHCQIL/graph.json","events_json":"https://pith.science/api/pith-number/NAMBBZVVCKF2WEOUSIGPYHCQIL/events.json","paper":"https://pith.science/paper/NAMBBZVV"},"agent_actions":{"view_html":"https://pith.science/pith/NAMBBZVVCKF2WEOUSIGPYHCQIL","download_json":"https://pith.science/pith/NAMBBZVVCKF2WEOUSIGPYHCQIL.json","view_paper":"https://pith.science/paper/NAMBBZVV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1406.5207&json=true","fetch_graph":"https://pith.science/api/pith-number/NAMBBZVVCKF2WEOUSIGPYHCQIL/graph.json","fetch_events":"https://pith.science/api/pith-number/NAMBBZVVCKF2WEOUSIGPYHCQIL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NAMBBZVVCKF2WEOUSIGPYHCQIL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NAMBBZVVCKF2WEOUSIGPYHCQIL/action/storage_attestation","attest_author":"https://pith.science/pith/NAMBBZVVCKF2WEOUSIGPYHCQIL/action/author_attestation","sign_citation":"https://pith.science/pith/NAMBBZVVCKF2WEOUSIGPYHCQIL/action/citation_signature","submit_replication":"https://pith.science/pith/NAMBBZVVCKF2WEOUSIGPYHCQIL/action/replication_record"}},"created_at":"2026-05-18T02:49:19.688744+00:00","updated_at":"2026-05-18T02:49:19.688744+00:00"}