{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:AMP7YVB6K5UYF3VPOKO4NCN6P2","short_pith_number":"pith:AMP7YVB6","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"},"canonical_sha256":"031ffc543e576982eeaf729dc689be7ea35192cc9e26ff29ad254c24c9ecb67a","source":{"kind":"arxiv","id":"1902.08455","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1902.08455","created_at":"2026-05-17T23:52:57Z"},{"alias_kind":"arxiv_version","alias_value":"1902.08455v1","created_at":"2026-05-17T23:52:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.08455","created_at":"2026-05-17T23:52:57Z"},{"alias_kind":"pith_short_12","alias_value":"AMP7YVB6K5UY","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_16","alias_value":"AMP7YVB6K5UYF3VP","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_8","alias_value":"AMP7YVB6","created_at":"2026-05-18T12:33:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:AMP7YVB6K5UYF3VPOKO4NCN6P2","target":"record","payload":{"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"},"canonical_sha256":"031ffc543e576982eeaf729dc689be7ea35192cc9e26ff29ad254c24c9ecb67a","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"},"source_kind":"arxiv","source_id":"1902.08455","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-17T23:52:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Z2RReuZXodmGsOoC1bfgLurD658W0JbmQH4Yminrztteab/eGytvUdvcrNJGGzUYyPpiXwqMt4t6CfdnJwmIDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T06:06:08.434148Z"},"content_sha256":"a45e0725e6a79a537a4ad6fc18fa01dc004eadf2d403eb1ad03b89affe0b27bd","schema_version":"1.0","event_id":"sha256:a45e0725e6a79a537a4ad6fc18fa01dc004eadf2d403eb1ad03b89affe0b27bd"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:AMP7YVB6K5UYF3VPOKO4NCN6P2","target":"graph","payload":{"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"},"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-17T23:52:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"d28N4F/4R13PooSrsiZL7hpvBBL5KHV5irsN+Hgs7APJ9R4rD37I51b+AXC0NhNl3FbIxqOyrJBesOH0fkYhAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T06:06:08.434859Z"},"content_sha256":"79797ccb8bec6100e5a19d7731f047a0b4cb6c7605a47030dcd0b55408413715","schema_version":"1.0","event_id":"sha256:79797ccb8bec6100e5a19d7731f047a0b4cb6c7605a47030dcd0b55408413715"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/AMP7YVB6K5UYF3VPOKO4NCN6P2/bundle.json","state_url":"https://pith.science/pith/AMP7YVB6K5UYF3VPOKO4NCN6P2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/AMP7YVB6K5UYF3VPOKO4NCN6P2/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-05-26T06:06:08Z","links":{"resolver":"https://pith.science/pith/AMP7YVB6K5UYF3VPOKO4NCN6P2","bundle":"https://pith.science/pith/AMP7YVB6K5UYF3VPOKO4NCN6P2/bundle.json","state":"https://pith.science/pith/AMP7YVB6K5UYF3VPOKO4NCN6P2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/AMP7YVB6K5UYF3VPOKO4NCN6P2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:AMP7YVB6K5UYF3VPOKO4NCN6P2","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":"d3252719988a1e723fee13060232ba15b312374c7e3e0399bcb59b8b9248ff6b","cross_cats_sorted":["cs.SI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-02-22T12:11:33Z","title_canon_sha256":"07f4396db571a815625cf843051da2bb6b7e46e6d5879dd5fd1c0011ff5beacc"},"schema_version":"1.0","source":{"id":"1902.08455","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1902.08455","created_at":"2026-05-17T23:52:57Z"},{"alias_kind":"arxiv_version","alias_value":"1902.08455v1","created_at":"2026-05-17T23:52:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.08455","created_at":"2026-05-17T23:52:57Z"},{"alias_kind":"pith_short_12","alias_value":"AMP7YVB6K5UY","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_16","alias_value":"AMP7YVB6K5UYF3VP","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_8","alias_value":"AMP7YVB6","created_at":"2026-05-18T12:33:12Z"}],"graph_snapshots":[{"event_id":"sha256:79797ccb8bec6100e5a19d7731f047a0b4cb6c7605a47030dcd0b55408413715","target":"graph","created_at":"2026-05-17T23:52:57Z","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":"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","authors_text":"Juho Lauri, Sourav Dutta","cross_cats":["cs.SI"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-02-22T12:11:33Z","title":"Fine-grained Search Space Classification for Hard Enumeration Variants of Subset Problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.08455","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:a45e0725e6a79a537a4ad6fc18fa01dc004eadf2d403eb1ad03b89affe0b27bd","target":"record","created_at":"2026-05-17T23:52:57Z","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":"d3252719988a1e723fee13060232ba15b312374c7e3e0399bcb59b8b9248ff6b","cross_cats_sorted":["cs.SI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-02-22T12:11:33Z","title_canon_sha256":"07f4396db571a815625cf843051da2bb6b7e46e6d5879dd5fd1c0011ff5beacc"},"schema_version":"1.0","source":{"id":"1902.08455","kind":"arxiv","version":1}},"canonical_sha256":"031ffc543e576982eeaf729dc689be7ea35192cc9e26ff29ad254c24c9ecb67a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"031ffc543e576982eeaf729dc689be7ea35192cc9e26ff29ad254c24c9ecb67a","first_computed_at":"2026-05-17T23:52:57.170504Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:52:57.170504Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"7Q/dabX1JTiq7koFFZIQ/jXSHCgo5n+YyHSlJ8ApQ95GzR51Ii4DNHYGUF0SSr5Bi+9dH03OpLuNZdxrbv+KBQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:52:57.171189Z","signed_message":"canonical_sha256_bytes"},"source_id":"1902.08455","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a45e0725e6a79a537a4ad6fc18fa01dc004eadf2d403eb1ad03b89affe0b27bd","sha256:79797ccb8bec6100e5a19d7731f047a0b4cb6c7605a47030dcd0b55408413715"],"state_sha256":"cda33644600ff6464234a545973822b5561e6883366ad7e34d631dc1ecb87b04"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"g8e1OlG8u2nDrjvGdFsPnJC3LPvEQ35SVoA33d9eWsdRjVmLQnRHbcVDpma1IcIes3K6J40Q09rFY4beuH1qAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T06:06:08.438451Z","bundle_sha256":"7923bd4630ada1f36b5c4c0190075d2a30a2e52bb953360b67e9b77891f40b8f"}}