{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:2DECJCJUYTXX64M6WS2BTQ4EZM","short_pith_number":"pith:2DECJCJU","schema_version":"1.0","canonical_sha256":"d0c8248934c4ef7f719eb4b419c384cb0a50033223dc637f32800018830484e8","source":{"kind":"arxiv","id":"2211.04601","version":4},"attestation_state":"computed","paper":{"title":"On Instance-Optimal Algorithms for a Generalization of Nuts and Bolts and Generalized Sorting","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Mayank Goswami, Riko Jacob","submitted_at":"2022-11-08T22:52:12Z","abstract_excerpt":"We generalize the classical nuts and bolts problem to a setting where the input is a collection of $n$ nuts and $m$ bolts, and there is no promise of any matching pairs. It is not allowed to compare a nut directly with a nut or a bolt directly with a bolt, and the goal is to perform the fewest nut-bolt comparisons to discover the partial order between the nuts and bolts. We term this problem \\emph{bipartite sorting}.\n  We show that instances of bipartite sorting of the same size exhibit a wide range of complexity, and propose to perform a fine-grained analysis for this problem. We rule out str"},"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":"2211.04601","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2022-11-08T22:52:12Z","cross_cats_sorted":[],"title_canon_sha256":"ba131453251b234591d681a2fbb414787e8c7779e2d1fe04d2ba33b73a2adf5f","abstract_canon_sha256":"8b453cd620bbe9c7fd05c70670e3a404dc3b059427d0bb8b8a7bdd29e019ef80"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:43:48.996408Z","signature_b64":"2Pv6UfZdoLDsGk1e8jP4vJvENH2kZV9tMXyhA5Az//Ymzz+cRm/q4t2aKLzXYPeH0CtlsU8rv9xx55UVY9tQAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d0c8248934c4ef7f719eb4b419c384cb0a50033223dc637f32800018830484e8","last_reissued_at":"2026-07-05T08:43:48.995970Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:43:48.995970Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On Instance-Optimal Algorithms for a Generalization of Nuts and Bolts and Generalized Sorting","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Mayank Goswami, Riko Jacob","submitted_at":"2022-11-08T22:52:12Z","abstract_excerpt":"We generalize the classical nuts and bolts problem to a setting where the input is a collection of $n$ nuts and $m$ bolts, and there is no promise of any matching pairs. It is not allowed to compare a nut directly with a nut or a bolt directly with a bolt, and the goal is to perform the fewest nut-bolt comparisons to discover the partial order between the nuts and bolts. We term this problem \\emph{bipartite sorting}.\n  We show that instances of bipartite sorting of the same size exhibit a wide range of complexity, and propose to perform a fine-grained analysis for this problem. We rule out str"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2211.04601","kind":"arxiv","version":4},"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/2211.04601/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":"2211.04601","created_at":"2026-07-05T08:43:48.996030+00:00"},{"alias_kind":"arxiv_version","alias_value":"2211.04601v4","created_at":"2026-07-05T08:43:48.996030+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2211.04601","created_at":"2026-07-05T08:43:48.996030+00:00"},{"alias_kind":"pith_short_12","alias_value":"2DECJCJUYTXX","created_at":"2026-07-05T08:43:48.996030+00:00"},{"alias_kind":"pith_short_16","alias_value":"2DECJCJUYTXX64M6","created_at":"2026-07-05T08:43:48.996030+00:00"},{"alias_kind":"pith_short_8","alias_value":"2DECJCJU","created_at":"2026-07-05T08:43:48.996030+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2507.03151","citing_title":"Complexity of learning matchings and half graphs via edge queries","ref_index":16,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/2DECJCJUYTXX64M6WS2BTQ4EZM","json":"https://pith.science/pith/2DECJCJUYTXX64M6WS2BTQ4EZM.json","graph_json":"https://pith.science/api/pith-number/2DECJCJUYTXX64M6WS2BTQ4EZM/graph.json","events_json":"https://pith.science/api/pith-number/2DECJCJUYTXX64M6WS2BTQ4EZM/events.json","paper":"https://pith.science/paper/2DECJCJU"},"agent_actions":{"view_html":"https://pith.science/pith/2DECJCJUYTXX64M6WS2BTQ4EZM","download_json":"https://pith.science/pith/2DECJCJUYTXX64M6WS2BTQ4EZM.json","view_paper":"https://pith.science/paper/2DECJCJU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2211.04601&json=true","fetch_graph":"https://pith.science/api/pith-number/2DECJCJUYTXX64M6WS2BTQ4EZM/graph.json","fetch_events":"https://pith.science/api/pith-number/2DECJCJUYTXX64M6WS2BTQ4EZM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2DECJCJUYTXX64M6WS2BTQ4EZM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2DECJCJUYTXX64M6WS2BTQ4EZM/action/storage_attestation","attest_author":"https://pith.science/pith/2DECJCJUYTXX64M6WS2BTQ4EZM/action/author_attestation","sign_citation":"https://pith.science/pith/2DECJCJUYTXX64M6WS2BTQ4EZM/action/citation_signature","submit_replication":"https://pith.science/pith/2DECJCJUYTXX64M6WS2BTQ4EZM/action/replication_record"}},"created_at":"2026-07-05T08:43:48.996030+00:00","updated_at":"2026-07-05T08:43:48.996030+00:00"}