{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:AMP7YVB6K5UYF3VPOKO4NCN6P2","short_pith_number":"pith:AMP7YVB6","schema_version":"1.0","canonical_sha256":"031ffc543e576982eeaf729dc689be7ea35192cc9e26ff29ad254c24c9ecb67a","source":{"kind":"arxiv","id":"1902.08455","version":1},"attestation_state":"computed","paper":{"title":"Fine-grained Search Space Classification for Hard Enumeration Variants of Subset Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SI"],"primary_cat":"cs.LG","authors_text":"Juho Lauri, Sourav Dutta","submitted_at":"2019-02-22T12:11:33Z","abstract_excerpt":"We propose a simple, powerful, and flexible machine learning framework for (i) reducing the search space of computationally difficult enumeration variants of subset problems and (ii) augmenting existing state-of-the-art solvers with informative cues arising from the input distribution. We instantiate our framework for the problem of listing all maximum cliques in a graph, a central problem in network analysis, data mining, and computational biology. We demonstrate the practicality of our approach on real-world networks with millions of vertices and edges by not only retaining all optimal solut"},"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":"1902.08455","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-02-22T12:11:33Z","cross_cats_sorted":["cs.SI"],"title_canon_sha256":"07f4396db571a815625cf843051da2bb6b7e46e6d5879dd5fd1c0011ff5beacc","abstract_canon_sha256":"d3252719988a1e723fee13060232ba15b312374c7e3e0399bcb59b8b9248ff6b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:52:57.171189Z","signature_b64":"7Q/dabX1JTiq7koFFZIQ/jXSHCgo5n+YyHSlJ8ApQ95GzR51Ii4DNHYGUF0SSr5Bi+9dH03OpLuNZdxrbv+KBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"031ffc543e576982eeaf729dc689be7ea35192cc9e26ff29ad254c24c9ecb67a","last_reissued_at":"2026-05-17T23:52:57.170504Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:52:57.170504Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fine-grained Search Space Classification for Hard Enumeration Variants of Subset Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SI"],"primary_cat":"cs.LG","authors_text":"Juho Lauri, Sourav Dutta","submitted_at":"2019-02-22T12:11:33Z","abstract_excerpt":"We propose a simple, powerful, and flexible machine learning framework for (i) reducing the search space of computationally difficult enumeration variants of subset problems and (ii) augmenting existing state-of-the-art solvers with informative cues arising from the input distribution. We instantiate our framework for the problem of listing all maximum cliques in a graph, a central problem in network analysis, data mining, and computational biology. We demonstrate the practicality of our approach on real-world networks with millions of vertices and edges by not only retaining all optimal solut"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.08455","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":"1902.08455","created_at":"2026-05-17T23:52:57.170611+00:00"},{"alias_kind":"arxiv_version","alias_value":"1902.08455v1","created_at":"2026-05-17T23:52:57.170611+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.08455","created_at":"2026-05-17T23:52:57.170611+00:00"},{"alias_kind":"pith_short_12","alias_value":"AMP7YVB6K5UY","created_at":"2026-05-18T12:33:12.712433+00:00"},{"alias_kind":"pith_short_16","alias_value":"AMP7YVB6K5UYF3VP","created_at":"2026-05-18T12:33:12.712433+00:00"},{"alias_kind":"pith_short_8","alias_value":"AMP7YVB6","created_at":"2026-05-18T12:33:12.712433+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/AMP7YVB6K5UYF3VPOKO4NCN6P2","json":"https://pith.science/pith/AMP7YVB6K5UYF3VPOKO4NCN6P2.json","graph_json":"https://pith.science/api/pith-number/AMP7YVB6K5UYF3VPOKO4NCN6P2/graph.json","events_json":"https://pith.science/api/pith-number/AMP7YVB6K5UYF3VPOKO4NCN6P2/events.json","paper":"https://pith.science/paper/AMP7YVB6"},"agent_actions":{"view_html":"https://pith.science/pith/AMP7YVB6K5UYF3VPOKO4NCN6P2","download_json":"https://pith.science/pith/AMP7YVB6K5UYF3VPOKO4NCN6P2.json","view_paper":"https://pith.science/paper/AMP7YVB6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1902.08455&json=true","fetch_graph":"https://pith.science/api/pith-number/AMP7YVB6K5UYF3VPOKO4NCN6P2/graph.json","fetch_events":"https://pith.science/api/pith-number/AMP7YVB6K5UYF3VPOKO4NCN6P2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AMP7YVB6K5UYF3VPOKO4NCN6P2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AMP7YVB6K5UYF3VPOKO4NCN6P2/action/storage_attestation","attest_author":"https://pith.science/pith/AMP7YVB6K5UYF3VPOKO4NCN6P2/action/author_attestation","sign_citation":"https://pith.science/pith/AMP7YVB6K5UYF3VPOKO4NCN6P2/action/citation_signature","submit_replication":"https://pith.science/pith/AMP7YVB6K5UYF3VPOKO4NCN6P2/action/replication_record"}},"created_at":"2026-05-17T23:52:57.170611+00:00","updated_at":"2026-05-17T23:52:57.170611+00:00"}