{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:6VWCBFWE3E6FWCNEMCKYIMS5RA","short_pith_number":"pith:6VWCBFWE","schema_version":"1.0","canonical_sha256":"f56c2096c4d93c5b09a4609584325d8825f0689e33a5c10387fdaffe5a5cd9b5","source":{"kind":"arxiv","id":"1805.07642","version":1},"attestation_state":"computed","paper":{"title":"On testing substitutability","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["econ.EM"],"primary_cat":"cs.DS","authors_text":"Cosmina Croitoru, Kurt Mehlhorn","submitted_at":"2018-05-19T19:09:27Z","abstract_excerpt":"The papers~\\cite{hatfimmokomi11} and~\\cite{azizbrilharr13} propose algorithms for testing whether the choice function induced by a (strict) preference list of length $N$ over a universe $U$ is substitutable. The running time of these algorithms is $O(|U|^3\\cdot N^3)$, respectively $O(|U|^2\\cdot N^3)$. In this note we present an algorithm with running time $O(|U|^2\\cdot N^2)$. Note that $N$ may be exponential in the size $|U|$ of the universe."},"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":"1805.07642","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2018-05-19T19:09:27Z","cross_cats_sorted":["econ.EM"],"title_canon_sha256":"bb521b3c468ae5bd94daf5d824740f890ff7211163b53efb89d57c879510224d","abstract_canon_sha256":"6f2bcc89b5eb042e5d2a23cf9807212f3deebbead7c00330550ec538e488bab1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:15:32.960400Z","signature_b64":"tUZ7D54lWninG3Fsj1pY9DnwW4AeZZ7issWUyPOiDLyquMBeL0rcLWD57T3XNLfHXwHjAzpGz8S7YGM6BvDiCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f56c2096c4d93c5b09a4609584325d8825f0689e33a5c10387fdaffe5a5cd9b5","last_reissued_at":"2026-05-18T00:15:32.959739Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:15:32.959739Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On testing substitutability","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["econ.EM"],"primary_cat":"cs.DS","authors_text":"Cosmina Croitoru, Kurt Mehlhorn","submitted_at":"2018-05-19T19:09:27Z","abstract_excerpt":"The papers~\\cite{hatfimmokomi11} and~\\cite{azizbrilharr13} propose algorithms for testing whether the choice function induced by a (strict) preference list of length $N$ over a universe $U$ is substitutable. The running time of these algorithms is $O(|U|^3\\cdot N^3)$, respectively $O(|U|^2\\cdot N^3)$. In this note we present an algorithm with running time $O(|U|^2\\cdot N^2)$. Note that $N$ may be exponential in the size $|U|$ of the universe."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.07642","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":"1805.07642","created_at":"2026-05-18T00:15:32.959862+00:00"},{"alias_kind":"arxiv_version","alias_value":"1805.07642v1","created_at":"2026-05-18T00:15:32.959862+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.07642","created_at":"2026-05-18T00:15:32.959862+00:00"},{"alias_kind":"pith_short_12","alias_value":"6VWCBFWE3E6F","created_at":"2026-05-18T12:32:11.075285+00:00"},{"alias_kind":"pith_short_16","alias_value":"6VWCBFWE3E6FWCNE","created_at":"2026-05-18T12:32:11.075285+00:00"},{"alias_kind":"pith_short_8","alias_value":"6VWCBFWE","created_at":"2026-05-18T12:32:11.075285+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/6VWCBFWE3E6FWCNEMCKYIMS5RA","json":"https://pith.science/pith/6VWCBFWE3E6FWCNEMCKYIMS5RA.json","graph_json":"https://pith.science/api/pith-number/6VWCBFWE3E6FWCNEMCKYIMS5RA/graph.json","events_json":"https://pith.science/api/pith-number/6VWCBFWE3E6FWCNEMCKYIMS5RA/events.json","paper":"https://pith.science/paper/6VWCBFWE"},"agent_actions":{"view_html":"https://pith.science/pith/6VWCBFWE3E6FWCNEMCKYIMS5RA","download_json":"https://pith.science/pith/6VWCBFWE3E6FWCNEMCKYIMS5RA.json","view_paper":"https://pith.science/paper/6VWCBFWE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1805.07642&json=true","fetch_graph":"https://pith.science/api/pith-number/6VWCBFWE3E6FWCNEMCKYIMS5RA/graph.json","fetch_events":"https://pith.science/api/pith-number/6VWCBFWE3E6FWCNEMCKYIMS5RA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6VWCBFWE3E6FWCNEMCKYIMS5RA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6VWCBFWE3E6FWCNEMCKYIMS5RA/action/storage_attestation","attest_author":"https://pith.science/pith/6VWCBFWE3E6FWCNEMCKYIMS5RA/action/author_attestation","sign_citation":"https://pith.science/pith/6VWCBFWE3E6FWCNEMCKYIMS5RA/action/citation_signature","submit_replication":"https://pith.science/pith/6VWCBFWE3E6FWCNEMCKYIMS5RA/action/replication_record"}},"created_at":"2026-05-18T00:15:32.959862+00:00","updated_at":"2026-05-18T00:15:32.959862+00:00"}