{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:67CCX3GI5S4ASFREOSHSQRLVZF","short_pith_number":"pith:67CCX3GI","schema_version":"1.0","canonical_sha256":"f7c42becc8ecb8091624748f284575c969e5c5786c77e1b3904ac31873d69fc8","source":{"kind":"arxiv","id":"1507.05955","version":1},"attestation_state":"computed","paper":{"title":"Sorting using non-binary comparisons","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"math.CO","authors_text":"Gabor Meszaros, Richard A. B. Johnson","submitted_at":"2015-07-21T19:59:57Z","abstract_excerpt":"In this paper we investigate the problem of sorting a set of $n$ coins, each with distinct but unknown weights, using an unusual scale. The classical version of this problem, which has been well-studied, gives the user a binary scale, enabling them to determine which is the lighter/heavier of any two objects. We generalise this, considering a scale that accepts $k$ coins as input and returns the $t^{\\text{th}}$ lightest, for a fixed $k$ and $t$. We consider this in both an on-line and off-line setting, and exhibit algorithms in both settings that are best-possible in terms of the order of the "},"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":"1507.05955","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-07-21T19:59:57Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"aa39967d6a919c0deecd9be375b60dd24e8632a74879bab96ede4905db302671","abstract_canon_sha256":"58c8bdfc6996fd7982e03c3d4ab2d40512b26f38e7544ba0d699f1c6a9e378a6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:36:32.056870Z","signature_b64":"9dQ3w4rAneozp6ZaXH0rAzQ4N9OnpFgeFriDDj/Oc9jmljfiW388KYFlAOWElRKDI2zvAvGblegHNjZPtNzYBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f7c42becc8ecb8091624748f284575c969e5c5786c77e1b3904ac31873d69fc8","last_reissued_at":"2026-05-18T01:36:32.056372Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:36:32.056372Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Sorting using non-binary comparisons","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"math.CO","authors_text":"Gabor Meszaros, Richard A. B. Johnson","submitted_at":"2015-07-21T19:59:57Z","abstract_excerpt":"In this paper we investigate the problem of sorting a set of $n$ coins, each with distinct but unknown weights, using an unusual scale. The classical version of this problem, which has been well-studied, gives the user a binary scale, enabling them to determine which is the lighter/heavier of any two objects. We generalise this, considering a scale that accepts $k$ coins as input and returns the $t^{\\text{th}}$ lightest, for a fixed $k$ and $t$. We consider this in both an on-line and off-line setting, and exhibit algorithms in both settings that are best-possible in terms of the order of the "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.05955","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":"1507.05955","created_at":"2026-05-18T01:36:32.056458+00:00"},{"alias_kind":"arxiv_version","alias_value":"1507.05955v1","created_at":"2026-05-18T01:36:32.056458+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.05955","created_at":"2026-05-18T01:36:32.056458+00:00"},{"alias_kind":"pith_short_12","alias_value":"67CCX3GI5S4A","created_at":"2026-05-18T12:29:07.941421+00:00"},{"alias_kind":"pith_short_16","alias_value":"67CCX3GI5S4ASFRE","created_at":"2026-05-18T12:29:07.941421+00:00"},{"alias_kind":"pith_short_8","alias_value":"67CCX3GI","created_at":"2026-05-18T12:29:07.941421+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/67CCX3GI5S4ASFREOSHSQRLVZF","json":"https://pith.science/pith/67CCX3GI5S4ASFREOSHSQRLVZF.json","graph_json":"https://pith.science/api/pith-number/67CCX3GI5S4ASFREOSHSQRLVZF/graph.json","events_json":"https://pith.science/api/pith-number/67CCX3GI5S4ASFREOSHSQRLVZF/events.json","paper":"https://pith.science/paper/67CCX3GI"},"agent_actions":{"view_html":"https://pith.science/pith/67CCX3GI5S4ASFREOSHSQRLVZF","download_json":"https://pith.science/pith/67CCX3GI5S4ASFREOSHSQRLVZF.json","view_paper":"https://pith.science/paper/67CCX3GI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1507.05955&json=true","fetch_graph":"https://pith.science/api/pith-number/67CCX3GI5S4ASFREOSHSQRLVZF/graph.json","fetch_events":"https://pith.science/api/pith-number/67CCX3GI5S4ASFREOSHSQRLVZF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/67CCX3GI5S4ASFREOSHSQRLVZF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/67CCX3GI5S4ASFREOSHSQRLVZF/action/storage_attestation","attest_author":"https://pith.science/pith/67CCX3GI5S4ASFREOSHSQRLVZF/action/author_attestation","sign_citation":"https://pith.science/pith/67CCX3GI5S4ASFREOSHSQRLVZF/action/citation_signature","submit_replication":"https://pith.science/pith/67CCX3GI5S4ASFREOSHSQRLVZF/action/replication_record"}},"created_at":"2026-05-18T01:36:32.056458+00:00","updated_at":"2026-05-18T01:36:32.056458+00:00"}