{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:OIKEUO3AZAP3CMOEKK4WVXOSV7","short_pith_number":"pith:OIKEUO3A","canonical_record":{"source":{"id":"1801.08709","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2018-01-26T08:24:16Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"4d28cf9d362e451977a0fa39304e27649976a26bc3df554065f997246f1a1265","abstract_canon_sha256":"f35df183d9ccc47ca1c25c5aa94c8749f7d356e36a1d66317c216634f0240585"},"schema_version":"1.0"},"canonical_sha256":"72144a3b60c81fb131c452b96addd2afe479af27ae1731331e6191494d2a0f3e","source":{"kind":"arxiv","id":"1801.08709","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1801.08709","created_at":"2026-05-18T00:16:19Z"},{"alias_kind":"arxiv_version","alias_value":"1801.08709v2","created_at":"2026-05-18T00:16:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.08709","created_at":"2026-05-18T00:16:19Z"},{"alias_kind":"pith_short_12","alias_value":"OIKEUO3AZAP3","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_16","alias_value":"OIKEUO3AZAP3CMOE","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_8","alias_value":"OIKEUO3A","created_at":"2026-05-18T12:32:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:OIKEUO3AZAP3CMOEKK4WVXOSV7","target":"record","payload":{"canonical_record":{"source":{"id":"1801.08709","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2018-01-26T08:24:16Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"4d28cf9d362e451977a0fa39304e27649976a26bc3df554065f997246f1a1265","abstract_canon_sha256":"f35df183d9ccc47ca1c25c5aa94c8749f7d356e36a1d66317c216634f0240585"},"schema_version":"1.0"},"canonical_sha256":"72144a3b60c81fb131c452b96addd2afe479af27ae1731331e6191494d2a0f3e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:16:19.240193Z","signature_b64":"kFLWqGlQInLG2kiD0aNeZIY7l6Mt2DzW9Gukjq4KJs1DWVbf4CRibLXaZwSzvXDDYUoMtaK7vtsanIrNZR4pCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"72144a3b60c81fb131c452b96addd2afe479af27ae1731331e6191494d2a0f3e","last_reissued_at":"2026-05-18T00:16:19.239529Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:16:19.239529Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1801.08709","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:16:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ElD4/BXnY7GPDU5dnCW9xg7wc2+3zy+c15q8sS5jNZIk8EpefAiUTI/2m7V6XrOHuVs+KRiRJehIix4AobO4Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T07:54:00.556232Z"},"content_sha256":"bf0d67a8d2564b0c72ef50639516285156ac5a346e4a94e77357dcc1fe673704","schema_version":"1.0","event_id":"sha256:bf0d67a8d2564b0c72ef50639516285156ac5a346e4a94e77357dcc1fe673704"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:OIKEUO3AZAP3CMOEKK4WVXOSV7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Adaptive Lower Bound for Testing Monotonicity on the Line","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CC","authors_text":"Aleksandrs Belovs","submitted_at":"2018-01-26T08:24:16Z","abstract_excerpt":"In the property testing model, the task is to distinguish objects possessing some property from the objects that are far from it. One of such properties is monotonicity, when the objects are functions from one poset to another. This is an active area of research. In this paper we study query complexity of $\\epsilon$-testing monotonicity of a function $f\\colon [n]\\to[r]$. All our lower bounds are for adaptive two-sided testers.\n  * We prove a nearly tight lower bound for this problem in terms of $r$. The bound is $\\Omega(\\frac{\\log r}{\\log \\log r})$ when $\\epsilon = 1/2$. No previous satisfacto"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.08709","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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:16:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YcJzEGRFkyOF8VHO6A3Cbmi8T+oZRQqf765PP3ICIsLeV0a9Ya7wAvnWRbSy0MWN3Bty66IRC5xnWTtL72xNBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T07:54:00.556940Z"},"content_sha256":"5bfc410e592e55a209ebe555cd1658daffb32a81c94df833b5f97245c201d222","schema_version":"1.0","event_id":"sha256:5bfc410e592e55a209ebe555cd1658daffb32a81c94df833b5f97245c201d222"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OIKEUO3AZAP3CMOEKK4WVXOSV7/bundle.json","state_url":"https://pith.science/pith/OIKEUO3AZAP3CMOEKK4WVXOSV7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OIKEUO3AZAP3CMOEKK4WVXOSV7/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-09T07:54:00Z","links":{"resolver":"https://pith.science/pith/OIKEUO3AZAP3CMOEKK4WVXOSV7","bundle":"https://pith.science/pith/OIKEUO3AZAP3CMOEKK4WVXOSV7/bundle.json","state":"https://pith.science/pith/OIKEUO3AZAP3CMOEKK4WVXOSV7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OIKEUO3AZAP3CMOEKK4WVXOSV7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:OIKEUO3AZAP3CMOEKK4WVXOSV7","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":"f35df183d9ccc47ca1c25c5aa94c8749f7d356e36a1d66317c216634f0240585","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2018-01-26T08:24:16Z","title_canon_sha256":"4d28cf9d362e451977a0fa39304e27649976a26bc3df554065f997246f1a1265"},"schema_version":"1.0","source":{"id":"1801.08709","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1801.08709","created_at":"2026-05-18T00:16:19Z"},{"alias_kind":"arxiv_version","alias_value":"1801.08709v2","created_at":"2026-05-18T00:16:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.08709","created_at":"2026-05-18T00:16:19Z"},{"alias_kind":"pith_short_12","alias_value":"OIKEUO3AZAP3","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_16","alias_value":"OIKEUO3AZAP3CMOE","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_8","alias_value":"OIKEUO3A","created_at":"2026-05-18T12:32:43Z"}],"graph_snapshots":[{"event_id":"sha256:5bfc410e592e55a209ebe555cd1658daffb32a81c94df833b5f97245c201d222","target":"graph","created_at":"2026-05-18T00:16:19Z","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"},"paper":{"abstract_excerpt":"In the property testing model, the task is to distinguish objects possessing some property from the objects that are far from it. One of such properties is monotonicity, when the objects are functions from one poset to another. This is an active area of research. In this paper we study query complexity of $\\epsilon$-testing monotonicity of a function $f\\colon [n]\\to[r]$. All our lower bounds are for adaptive two-sided testers.\n  * We prove a nearly tight lower bound for this problem in terms of $r$. The bound is $\\Omega(\\frac{\\log r}{\\log \\log r})$ when $\\epsilon = 1/2$. No previous satisfacto","authors_text":"Aleksandrs Belovs","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2018-01-26T08:24:16Z","title":"Adaptive Lower Bound for Testing Monotonicity on the Line"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.08709","kind":"arxiv","version":2},"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:bf0d67a8d2564b0c72ef50639516285156ac5a346e4a94e77357dcc1fe673704","target":"record","created_at":"2026-05-18T00:16:19Z","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":"f35df183d9ccc47ca1c25c5aa94c8749f7d356e36a1d66317c216634f0240585","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2018-01-26T08:24:16Z","title_canon_sha256":"4d28cf9d362e451977a0fa39304e27649976a26bc3df554065f997246f1a1265"},"schema_version":"1.0","source":{"id":"1801.08709","kind":"arxiv","version":2}},"canonical_sha256":"72144a3b60c81fb131c452b96addd2afe479af27ae1731331e6191494d2a0f3e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"72144a3b60c81fb131c452b96addd2afe479af27ae1731331e6191494d2a0f3e","first_computed_at":"2026-05-18T00:16:19.239529Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:16:19.239529Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"kFLWqGlQInLG2kiD0aNeZIY7l6Mt2DzW9Gukjq4KJs1DWVbf4CRibLXaZwSzvXDDYUoMtaK7vtsanIrNZR4pCg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:16:19.240193Z","signed_message":"canonical_sha256_bytes"},"source_id":"1801.08709","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bf0d67a8d2564b0c72ef50639516285156ac5a346e4a94e77357dcc1fe673704","sha256:5bfc410e592e55a209ebe555cd1658daffb32a81c94df833b5f97245c201d222"],"state_sha256":"3c2247783ba0db39a0687b60dba907f0b217f9f54f8c443ef94010465d6062c4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"15i6fYf0gZFDCwKPVNgPqr5q7ANiGoB/t8dFiG9S13yCThMeq522UexXHAKrX/crN4u3MZ38GilwJ/Y9ZPIYCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T07:54:00.561061Z","bundle_sha256":"d9d727e44dab3bfc4fb84e0cb1c80fff8d4c0585df6ae2a96b2c98cd20df6a96"}}