{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:C2LTUPESNARIURG7LLJCWOQM7H","short_pith_number":"pith:C2LTUPES","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"},"canonical_sha256":"16973a3c9268228a44df5ad22b3a0cf9cc374ab86c114c625e40f08836e6d515","source":{"kind":"arxiv","id":"1508.01753","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1508.01753","created_at":"2026-05-18T01:35:38Z"},{"alias_kind":"arxiv_version","alias_value":"1508.01753v1","created_at":"2026-05-18T01:35:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1508.01753","created_at":"2026-05-18T01:35:38Z"},{"alias_kind":"pith_short_12","alias_value":"C2LTUPESNARI","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_16","alias_value":"C2LTUPESNARIURG7","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_8","alias_value":"C2LTUPES","created_at":"2026-05-18T12:29:14Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:C2LTUPESNARIURG7LLJCWOQM7H","target":"record","payload":{"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"},"canonical_sha256":"16973a3c9268228a44df5ad22b3a0cf9cc374ab86c114c625e40f08836e6d515","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"},"source_kind":"arxiv","source_id":"1508.01753","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:35:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PAQYv/d2IpQmdCnhuTbUqdLnDT8UahE6enevdGeWyH2qVLCoY/+i2mZOJ6VAyy0NSIDpSeSQZ5RrdvLDDlRwDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T05:45:20.735170Z"},"content_sha256":"e4c609c15403ad43d1b35baffeabbb2aca2a6428264076986b0b4383dd6a91ae","schema_version":"1.0","event_id":"sha256:e4c609c15403ad43d1b35baffeabbb2aca2a6428264076986b0b4383dd6a91ae"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:C2LTUPESNARIURG7LLJCWOQM7H","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:35:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cSVZemKS5/e3phjrtvkH99kytTWgvhkGmxmfFbA/PVb6aW0iy5/zaTiSx+4+swbL7+/VxRY6NWJwp8xD2aj6Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T05:45:20.735544Z"},"content_sha256":"a6eb45d6a0d963bd75c3197c7f760642a7125d2a425b3abc3936843abbbd1886","schema_version":"1.0","event_id":"sha256:a6eb45d6a0d963bd75c3197c7f760642a7125d2a425b3abc3936843abbbd1886"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/C2LTUPESNARIURG7LLJCWOQM7H/bundle.json","state_url":"https://pith.science/pith/C2LTUPESNARIURG7LLJCWOQM7H/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/C2LTUPESNARIURG7LLJCWOQM7H/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-01T05:45:20Z","links":{"resolver":"https://pith.science/pith/C2LTUPESNARIURG7LLJCWOQM7H","bundle":"https://pith.science/pith/C2LTUPESNARIURG7LLJCWOQM7H/bundle.json","state":"https://pith.science/pith/C2LTUPESNARIURG7LLJCWOQM7H/state.json","well_known_bundle":"https://pith.science/.well-known/pith/C2LTUPESNARIURG7LLJCWOQM7H/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:C2LTUPESNARIURG7LLJCWOQM7H","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"b84aa740195b845d668f59d0ed4e9adddb16758ac578954cb9ca6e6e60ddfeba","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-08-07T16:33:54Z","title_canon_sha256":"f6beb7e8354f47237670d1aa8c9fd4ff12cdc53cdcbed4b428160b936d3376c1"},"schema_version":"1.0","source":{"id":"1508.01753","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1508.01753","created_at":"2026-05-18T01:35:38Z"},{"alias_kind":"arxiv_version","alias_value":"1508.01753v1","created_at":"2026-05-18T01:35:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1508.01753","created_at":"2026-05-18T01:35:38Z"},{"alias_kind":"pith_short_12","alias_value":"C2LTUPESNARI","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_16","alias_value":"C2LTUPESNARIURG7","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_8","alias_value":"C2LTUPES","created_at":"2026-05-18T12:29:14Z"}],"graph_snapshots":[{"event_id":"sha256:a6eb45d6a0d963bd75c3197c7f760642a7125d2a425b3abc3936843abbbd1886","target":"graph","created_at":"2026-05-18T01:35:38Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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-","authors_text":"David Gregg, Martin Marinov, Nicholas Nash","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-08-07T16:33:54Z","title":"Practical Algorithms for Finding Extremal Sets"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1508.01753","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:e4c609c15403ad43d1b35baffeabbb2aca2a6428264076986b0b4383dd6a91ae","target":"record","created_at":"2026-05-18T01:35:38Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"b84aa740195b845d668f59d0ed4e9adddb16758ac578954cb9ca6e6e60ddfeba","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-08-07T16:33:54Z","title_canon_sha256":"f6beb7e8354f47237670d1aa8c9fd4ff12cdc53cdcbed4b428160b936d3376c1"},"schema_version":"1.0","source":{"id":"1508.01753","kind":"arxiv","version":1}},"canonical_sha256":"16973a3c9268228a44df5ad22b3a0cf9cc374ab86c114c625e40f08836e6d515","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"16973a3c9268228a44df5ad22b3a0cf9cc374ab86c114c625e40f08836e6d515","first_computed_at":"2026-05-18T01:35:38.842081Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:35:38.842081Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"THkAmIcBCURaIsrGSNjoz9g0zwZGLIvrQifjwF30uHHJ34CYd98/sBbs40g4xcVAEL3MAH3IXg+Nh1rA+58UCg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:35:38.842802Z","signed_message":"canonical_sha256_bytes"},"source_id":"1508.01753","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e4c609c15403ad43d1b35baffeabbb2aca2a6428264076986b0b4383dd6a91ae","sha256:a6eb45d6a0d963bd75c3197c7f760642a7125d2a425b3abc3936843abbbd1886"],"state_sha256":"744136c6338c2734c6d229f90a35e10ad16761eb35f301a3624d207bcd4f1bd5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"f1SPEjO0aQwSkufkePF5KoAHW2w9sq/DYXX2TILtIPCVnngN4/P6p++N/VFL9j8nq2IpK8OtxDLQDftsn8NaAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T05:45:20.737740Z","bundle_sha256":"2c42a6851b470d323849f69ef7fb815b10d66090b4de92f10a5285421a5985ba"}}