{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:WYIW6GWZJMQBHMBI3JOTTIADJX","short_pith_number":"pith:WYIW6GWZ","schema_version":"1.0","canonical_sha256":"b6116f1ad94b2013b028da5d39a0034dd901a70fd5e71277eb2b1bfc36ac8fe2","source":{"kind":"arxiv","id":"2009.13887","version":1},"attestation_state":"computed","paper":{"title":"Longest k-monotone chains","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.PR"],"primary_cat":"math.MG","authors_text":"Gergely Ambrus","submitted_at":"2020-09-29T09:25:13Z","abstract_excerpt":"We study higher order convexity properties of random point sets in the unit square. Given $n$ uniform i.i.d random points, we derive asymptotic estimates for the maximal number of them which are in $k$-monotone position, subject to mild boundary conditions. Besides determining the order of magnitude of the expectation, we also prove strong concentration estimates. We provide a general framework that includes the previously studied cases of $k=1$ (longest increasing sequences) and $k=2$ (longest convex chains)."},"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":"2009.13887","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.MG","submitted_at":"2020-09-29T09:25:13Z","cross_cats_sorted":["math.PR"],"title_canon_sha256":"291aa17c1cccce36ca93f913d87aaac9950e825865a7790aced036e86c866ffc","abstract_canon_sha256":"1aec98437e84c9ff0108a37a99ca4d21107f9019c33b10bc171c696dd6c575c1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:38:46.078956Z","signature_b64":"b3pLacneKBkNaXgebeNKJNY43KtMbUdT3A5GBaUZcTv2guPY3MO6Edsyki9tUVUVslnvduG4xCQQcvgHqURxDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b6116f1ad94b2013b028da5d39a0034dd901a70fd5e71277eb2b1bfc36ac8fe2","last_reissued_at":"2026-07-05T01:38:46.078616Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:38:46.078616Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Longest k-monotone chains","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.PR"],"primary_cat":"math.MG","authors_text":"Gergely Ambrus","submitted_at":"2020-09-29T09:25:13Z","abstract_excerpt":"We study higher order convexity properties of random point sets in the unit square. Given $n$ uniform i.i.d random points, we derive asymptotic estimates for the maximal number of them which are in $k$-monotone position, subject to mild boundary conditions. Besides determining the order of magnitude of the expectation, we also prove strong concentration estimates. We provide a general framework that includes the previously studied cases of $k=1$ (longest increasing sequences) and $k=2$ (longest convex chains)."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2009.13887","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2009.13887/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2009.13887","created_at":"2026-07-05T01:38:46.078671+00:00"},{"alias_kind":"arxiv_version","alias_value":"2009.13887v1","created_at":"2026-07-05T01:38:46.078671+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2009.13887","created_at":"2026-07-05T01:38:46.078671+00:00"},{"alias_kind":"pith_short_12","alias_value":"WYIW6GWZJMQB","created_at":"2026-07-05T01:38:46.078671+00:00"},{"alias_kind":"pith_short_16","alias_value":"WYIW6GWZJMQBHMBI","created_at":"2026-07-05T01:38:46.078671+00:00"},{"alias_kind":"pith_short_8","alias_value":"WYIW6GWZ","created_at":"2026-07-05T01:38:46.078671+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2608.09105","citing_title":"Longest convex chains with i.i.d. points","ref_index":3,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/WYIW6GWZJMQBHMBI3JOTTIADJX","json":"https://pith.science/pith/WYIW6GWZJMQBHMBI3JOTTIADJX.json","graph_json":"https://pith.science/api/pith-number/WYIW6GWZJMQBHMBI3JOTTIADJX/graph.json","events_json":"https://pith.science/api/pith-number/WYIW6GWZJMQBHMBI3JOTTIADJX/events.json","paper":"https://pith.science/paper/WYIW6GWZ"},"agent_actions":{"view_html":"https://pith.science/pith/WYIW6GWZJMQBHMBI3JOTTIADJX","download_json":"https://pith.science/pith/WYIW6GWZJMQBHMBI3JOTTIADJX.json","view_paper":"https://pith.science/paper/WYIW6GWZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2009.13887&json=true","fetch_graph":"https://pith.science/api/pith-number/WYIW6GWZJMQBHMBI3JOTTIADJX/graph.json","fetch_events":"https://pith.science/api/pith-number/WYIW6GWZJMQBHMBI3JOTTIADJX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WYIW6GWZJMQBHMBI3JOTTIADJX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WYIW6GWZJMQBHMBI3JOTTIADJX/action/storage_attestation","attest_author":"https://pith.science/pith/WYIW6GWZJMQBHMBI3JOTTIADJX/action/author_attestation","sign_citation":"https://pith.science/pith/WYIW6GWZJMQBHMBI3JOTTIADJX/action/citation_signature","submit_replication":"https://pith.science/pith/WYIW6GWZJMQBHMBI3JOTTIADJX/action/replication_record"}},"created_at":"2026-07-05T01:38:46.078671+00:00","updated_at":"2026-07-05T01:38:46.078671+00:00"}