{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:YDWPTGKOMA6IFE3GJJJ7NFL57S","short_pith_number":"pith:YDWPTGKO","canonical_record":{"source":{"id":"1803.03659","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2018-03-09T19:13:00Z","cross_cats_sorted":[],"title_canon_sha256":"e07d5e8276cfe7fa66e961da86535698a8f1020f0da569e99460519105fbcae2","abstract_canon_sha256":"88222c9e261a1aea78321705068181e65ba2a8322230d1747aa3199d5a46f496"},"schema_version":"1.0"},"canonical_sha256":"c0ecf9994e603c8293664a53f6957dfc90d19ce497981b0518a8647ec86d23f8","source":{"kind":"arxiv","id":"1803.03659","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.03659","created_at":"2026-05-18T00:21:38Z"},{"alias_kind":"arxiv_version","alias_value":"1803.03659v1","created_at":"2026-05-18T00:21:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.03659","created_at":"2026-05-18T00:21:38Z"},{"alias_kind":"pith_short_12","alias_value":"YDWPTGKOMA6I","created_at":"2026-05-18T12:33:04Z"},{"alias_kind":"pith_short_16","alias_value":"YDWPTGKOMA6IFE3G","created_at":"2026-05-18T12:33:04Z"},{"alias_kind":"pith_short_8","alias_value":"YDWPTGKO","created_at":"2026-05-18T12:33:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:YDWPTGKOMA6IFE3GJJJ7NFL57S","target":"record","payload":{"canonical_record":{"source":{"id":"1803.03659","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2018-03-09T19:13:00Z","cross_cats_sorted":[],"title_canon_sha256":"e07d5e8276cfe7fa66e961da86535698a8f1020f0da569e99460519105fbcae2","abstract_canon_sha256":"88222c9e261a1aea78321705068181e65ba2a8322230d1747aa3199d5a46f496"},"schema_version":"1.0"},"canonical_sha256":"c0ecf9994e603c8293664a53f6957dfc90d19ce497981b0518a8647ec86d23f8","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:21:38.590461Z","signature_b64":"5BmXFa2LSWbRF/Sa4fXGlA6AHXpyQT4PWSjzzCyFLBOOglEj1PiZKqrprvOu2dS2RWzmP4j6Vb8AACfiJdmSBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c0ecf9994e603c8293664a53f6957dfc90d19ce497981b0518a8647ec86d23f8","last_reissued_at":"2026-05-18T00:21:38.589763Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:21:38.589763Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1803.03659","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-18T00:21:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pGY+oBoxDi598LAVZvMIn1Erz05DtTRp0buUyqRD+YmF8ZQaTYcnzM6qMjDJ004KWFZHAGM1gtHK9azFqgnfBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T12:51:45.345669Z"},"content_sha256":"c45cd4c056c5d2a0509442ed0d0da2ffad8fea79e27f5a4dd1eb1a13ee63b259","schema_version":"1.0","event_id":"sha256:c45cd4c056c5d2a0509442ed0d0da2ffad8fea79e27f5a4dd1eb1a13ee63b259"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:YDWPTGKOMA6IFE3GJJJ7NFL57S","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Listing Maximal Subgraphs in Strongly Accessible Set Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Alessio Conte, Andrea Marino, Luca Versari, Roberto Grossi","submitted_at":"2018-03-09T19:13:00Z","abstract_excerpt":"Algorithms for listing the subgraphs satisfying a given property (e.g.,being a clique, a cut, a cycle, etc.) fall within the general framework of set systems. A set system (U, F) uses a ground set U (e.g., the network nodes) and an indicator F, subset of 2^U, of which subsets of U have the required property. For the problem of listing all sets in F maximal under inclusion, the ambitious goal is to cover a large class of set systems, preserving at the same time the efficiency of the enumeration. Among the existing algorithms, the best-known ones list the maximal subsets in time proportional to "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.03659","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-18T00:21:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VyxfjXASFfDgCyAZNgCb/xVq/0/+x5t5Y3EYm8NMKI+0t9vvYQftstg+UgKF5hkYkPvLiGm6YMOvkiKQ9HqEBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T12:51:45.346014Z"},"content_sha256":"b567e8ff4ca8d733433047ef310a7f71f464fb7f9c12121c2f347d971c24a769","schema_version":"1.0","event_id":"sha256:b567e8ff4ca8d733433047ef310a7f71f464fb7f9c12121c2f347d971c24a769"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YDWPTGKOMA6IFE3GJJJ7NFL57S/bundle.json","state_url":"https://pith.science/pith/YDWPTGKOMA6IFE3GJJJ7NFL57S/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YDWPTGKOMA6IFE3GJJJ7NFL57S/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-03T12:51:45Z","links":{"resolver":"https://pith.science/pith/YDWPTGKOMA6IFE3GJJJ7NFL57S","bundle":"https://pith.science/pith/YDWPTGKOMA6IFE3GJJJ7NFL57S/bundle.json","state":"https://pith.science/pith/YDWPTGKOMA6IFE3GJJJ7NFL57S/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YDWPTGKOMA6IFE3GJJJ7NFL57S/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:YDWPTGKOMA6IFE3GJJJ7NFL57S","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":"88222c9e261a1aea78321705068181e65ba2a8322230d1747aa3199d5a46f496","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2018-03-09T19:13:00Z","title_canon_sha256":"e07d5e8276cfe7fa66e961da86535698a8f1020f0da569e99460519105fbcae2"},"schema_version":"1.0","source":{"id":"1803.03659","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.03659","created_at":"2026-05-18T00:21:38Z"},{"alias_kind":"arxiv_version","alias_value":"1803.03659v1","created_at":"2026-05-18T00:21:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.03659","created_at":"2026-05-18T00:21:38Z"},{"alias_kind":"pith_short_12","alias_value":"YDWPTGKOMA6I","created_at":"2026-05-18T12:33:04Z"},{"alias_kind":"pith_short_16","alias_value":"YDWPTGKOMA6IFE3G","created_at":"2026-05-18T12:33:04Z"},{"alias_kind":"pith_short_8","alias_value":"YDWPTGKO","created_at":"2026-05-18T12:33:04Z"}],"graph_snapshots":[{"event_id":"sha256:b567e8ff4ca8d733433047ef310a7f71f464fb7f9c12121c2f347d971c24a769","target":"graph","created_at":"2026-05-18T00:21: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":"Algorithms for listing the subgraphs satisfying a given property (e.g.,being a clique, a cut, a cycle, etc.) fall within the general framework of set systems. A set system (U, F) uses a ground set U (e.g., the network nodes) and an indicator F, subset of 2^U, of which subsets of U have the required property. For the problem of listing all sets in F maximal under inclusion, the ambitious goal is to cover a large class of set systems, preserving at the same time the efficiency of the enumeration. Among the existing algorithms, the best-known ones list the maximal subsets in time proportional to ","authors_text":"Alessio Conte, Andrea Marino, Luca Versari, Roberto Grossi","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2018-03-09T19:13:00Z","title":"Listing Maximal Subgraphs in Strongly Accessible Set Systems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.03659","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:c45cd4c056c5d2a0509442ed0d0da2ffad8fea79e27f5a4dd1eb1a13ee63b259","target":"record","created_at":"2026-05-18T00:21: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":"88222c9e261a1aea78321705068181e65ba2a8322230d1747aa3199d5a46f496","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2018-03-09T19:13:00Z","title_canon_sha256":"e07d5e8276cfe7fa66e961da86535698a8f1020f0da569e99460519105fbcae2"},"schema_version":"1.0","source":{"id":"1803.03659","kind":"arxiv","version":1}},"canonical_sha256":"c0ecf9994e603c8293664a53f6957dfc90d19ce497981b0518a8647ec86d23f8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c0ecf9994e603c8293664a53f6957dfc90d19ce497981b0518a8647ec86d23f8","first_computed_at":"2026-05-18T00:21:38.589763Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:21:38.589763Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"5BmXFa2LSWbRF/Sa4fXGlA6AHXpyQT4PWSjzzCyFLBOOglEj1PiZKqrprvOu2dS2RWzmP4j6Vb8AACfiJdmSBw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:21:38.590461Z","signed_message":"canonical_sha256_bytes"},"source_id":"1803.03659","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c45cd4c056c5d2a0509442ed0d0da2ffad8fea79e27f5a4dd1eb1a13ee63b259","sha256:b567e8ff4ca8d733433047ef310a7f71f464fb7f9c12121c2f347d971c24a769"],"state_sha256":"f4376479f379dc64a3fc429e8ab87599c02be431cd2ace1454bcc9c9cb16cedb"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lFdk6vZUd0+TLXONlfT1UpcGFoAkLni3rdlim+HLtO4is4TEdZNN/ErFlIjADn5f4G+KQ1MBiADj99ArYBBODQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T12:51:45.347946Z","bundle_sha256":"728d05314e78e536d0ee6bdc2fb99df46b661e3f43a5ffc2a757d5098d9fa32a"}}