{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:C2LTUPESNARIURG7LLJCWOQM7H","short_pith_number":"pith:C2LTUPES","schema_version":"1.0","canonical_sha256":"16973a3c9268228a44df5ad22b3a0cf9cc374ab86c114c625e40f08836e6d515","source":{"kind":"arxiv","id":"1508.01753","version":1},"attestation_state":"computed","paper":{"title":"Practical Algorithms for Finding Extremal Sets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"David Gregg, Martin Marinov, Nicholas Nash","submitted_at":"2015-08-07T16:33:54Z","abstract_excerpt":"The minimal sets within a collection of sets are defined as the ones which do not have a proper subset within the collection, and the maximal sets are the ones which do not have a proper superset within the collection. Identifying extremal sets is a fundamental problem with a wide-range of applications in SAT solvers, data-mining and social network analysis. In this paper, we present two novel improvements of the high-quality extremal set identification algorithm, \\textit{AMS-Lex}, described by Bayardo and Panda. The first technique uses memoization to improve the execution time of the single-"},"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":"1508.01753","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-08-07T16:33:54Z","cross_cats_sorted":[],"title_canon_sha256":"f6beb7e8354f47237670d1aa8c9fd4ff12cdc53cdcbed4b428160b936d3376c1","abstract_canon_sha256":"b84aa740195b845d668f59d0ed4e9adddb16758ac578954cb9ca6e6e60ddfeba"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:35:38.842802Z","signature_b64":"THkAmIcBCURaIsrGSNjoz9g0zwZGLIvrQifjwF30uHHJ34CYd98/sBbs40g4xcVAEL3MAH3IXg+Nh1rA+58UCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"16973a3c9268228a44df5ad22b3a0cf9cc374ab86c114c625e40f08836e6d515","last_reissued_at":"2026-05-18T01:35:38.842081Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:35:38.842081Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Practical Algorithms for Finding Extremal Sets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"David Gregg, Martin Marinov, Nicholas Nash","submitted_at":"2015-08-07T16:33:54Z","abstract_excerpt":"The minimal sets within a collection of sets are defined as the ones which do not have a proper subset within the collection, and the maximal sets are the ones which do not have a proper superset within the collection. Identifying extremal sets is a fundamental problem with a wide-range of applications in SAT solvers, data-mining and social network analysis. In this paper, we present two novel improvements of the high-quality extremal set identification algorithm, \\textit{AMS-Lex}, described by Bayardo and Panda. The first technique uses memoization to improve the execution time of the single-"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1508.01753","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":"1508.01753","created_at":"2026-05-18T01:35:38.842201+00:00"},{"alias_kind":"arxiv_version","alias_value":"1508.01753v1","created_at":"2026-05-18T01:35:38.842201+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1508.01753","created_at":"2026-05-18T01:35:38.842201+00:00"},{"alias_kind":"pith_short_12","alias_value":"C2LTUPESNARI","created_at":"2026-05-18T12:29:14.074870+00:00"},{"alias_kind":"pith_short_16","alias_value":"C2LTUPESNARIURG7","created_at":"2026-05-18T12:29:14.074870+00:00"},{"alias_kind":"pith_short_8","alias_value":"C2LTUPES","created_at":"2026-05-18T12:29:14.074870+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/C2LTUPESNARIURG7LLJCWOQM7H","json":"https://pith.science/pith/C2LTUPESNARIURG7LLJCWOQM7H.json","graph_json":"https://pith.science/api/pith-number/C2LTUPESNARIURG7LLJCWOQM7H/graph.json","events_json":"https://pith.science/api/pith-number/C2LTUPESNARIURG7LLJCWOQM7H/events.json","paper":"https://pith.science/paper/C2LTUPES"},"agent_actions":{"view_html":"https://pith.science/pith/C2LTUPESNARIURG7LLJCWOQM7H","download_json":"https://pith.science/pith/C2LTUPESNARIURG7LLJCWOQM7H.json","view_paper":"https://pith.science/paper/C2LTUPES","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1508.01753&json=true","fetch_graph":"https://pith.science/api/pith-number/C2LTUPESNARIURG7LLJCWOQM7H/graph.json","fetch_events":"https://pith.science/api/pith-number/C2LTUPESNARIURG7LLJCWOQM7H/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/C2LTUPESNARIURG7LLJCWOQM7H/action/timestamp_anchor","attest_storage":"https://pith.science/pith/C2LTUPESNARIURG7LLJCWOQM7H/action/storage_attestation","attest_author":"https://pith.science/pith/C2LTUPESNARIURG7LLJCWOQM7H/action/author_attestation","sign_citation":"https://pith.science/pith/C2LTUPESNARIURG7LLJCWOQM7H/action/citation_signature","submit_replication":"https://pith.science/pith/C2LTUPESNARIURG7LLJCWOQM7H/action/replication_record"}},"created_at":"2026-05-18T01:35:38.842201+00:00","updated_at":"2026-05-18T01:35:38.842201+00:00"}