{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:45CDZXFKMXJYRD5YXII3ITRWTZ","short_pith_number":"pith:45CDZXFK","schema_version":"1.0","canonical_sha256":"e7443cdcaa65d3888fb8ba11b44e369e4046a35bf7fa9036786f49a538d15480","source":{"kind":"arxiv","id":"1110.0461","version":2},"attestation_state":"computed","paper":{"title":"LSM is not generated by binary functions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Colin McQuillan","submitted_at":"2011-10-03T19:58:32Z","abstract_excerpt":"The material in this note is now superseded by arXiv:1108.5288v4.\n  Bulatov et al. [1] defined the operation of (efficient) pps_\\omega-definability in order to study the computational complexity of certain approximate counting problems. They asked whether all log-supermodular functions can be defined by binary implication and unary functions in this sense. We give a negative answer to this question."},"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":"1110.0461","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2011-10-03T19:58:32Z","cross_cats_sorted":[],"title_canon_sha256":"39ee2277f1c218a95e93cb603d425b34991fde8a09ef02588956924831ab2d6f","abstract_canon_sha256":"bd9b3bca244c7f0103a885bd58b2497cf0f73b9f9c5e2680679530ba73b356c2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:52:54.816861Z","signature_b64":"eau04XrevKTpEwODNpvs+UsUvYYImXc/PwuqcZFGmqgFGiKkje+7LHXoq6ZarRqDOLCEaZMgj+ChTYjr+JV1Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e7443cdcaa65d3888fb8ba11b44e369e4046a35bf7fa9036786f49a538d15480","last_reissued_at":"2026-05-18T03:52:54.816160Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:52:54.816160Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"LSM is not generated by binary functions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Colin McQuillan","submitted_at":"2011-10-03T19:58:32Z","abstract_excerpt":"The material in this note is now superseded by arXiv:1108.5288v4.\n  Bulatov et al. [1] defined the operation of (efficient) pps_\\omega-definability in order to study the computational complexity of certain approximate counting problems. They asked whether all log-supermodular functions can be defined by binary implication and unary functions in this sense. We give a negative answer to this question."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1110.0461","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1110.0461","created_at":"2026-05-18T03:52:54.816260+00:00"},{"alias_kind":"arxiv_version","alias_value":"1110.0461v2","created_at":"2026-05-18T03:52:54.816260+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1110.0461","created_at":"2026-05-18T03:52:54.816260+00:00"},{"alias_kind":"pith_short_12","alias_value":"45CDZXFKMXJY","created_at":"2026-05-18T12:26:20.644004+00:00"},{"alias_kind":"pith_short_16","alias_value":"45CDZXFKMXJYRD5Y","created_at":"2026-05-18T12:26:20.644004+00:00"},{"alias_kind":"pith_short_8","alias_value":"45CDZXFK","created_at":"2026-05-18T12:26:20.644004+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/45CDZXFKMXJYRD5YXII3ITRWTZ","json":"https://pith.science/pith/45CDZXFKMXJYRD5YXII3ITRWTZ.json","graph_json":"https://pith.science/api/pith-number/45CDZXFKMXJYRD5YXII3ITRWTZ/graph.json","events_json":"https://pith.science/api/pith-number/45CDZXFKMXJYRD5YXII3ITRWTZ/events.json","paper":"https://pith.science/paper/45CDZXFK"},"agent_actions":{"view_html":"https://pith.science/pith/45CDZXFKMXJYRD5YXII3ITRWTZ","download_json":"https://pith.science/pith/45CDZXFKMXJYRD5YXII3ITRWTZ.json","view_paper":"https://pith.science/paper/45CDZXFK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1110.0461&json=true","fetch_graph":"https://pith.science/api/pith-number/45CDZXFKMXJYRD5YXII3ITRWTZ/graph.json","fetch_events":"https://pith.science/api/pith-number/45CDZXFKMXJYRD5YXII3ITRWTZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/45CDZXFKMXJYRD5YXII3ITRWTZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/45CDZXFKMXJYRD5YXII3ITRWTZ/action/storage_attestation","attest_author":"https://pith.science/pith/45CDZXFKMXJYRD5YXII3ITRWTZ/action/author_attestation","sign_citation":"https://pith.science/pith/45CDZXFKMXJYRD5YXII3ITRWTZ/action/citation_signature","submit_replication":"https://pith.science/pith/45CDZXFKMXJYRD5YXII3ITRWTZ/action/replication_record"}},"created_at":"2026-05-18T03:52:54.816260+00:00","updated_at":"2026-05-18T03:52:54.816260+00:00"}