{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:3BETKLL2Q4M7PVGGVB2IXNSXQF","short_pith_number":"pith:3BETKLL2","canonical_record":{"source":{"id":"2007.12077","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2020-07-23T15:41:43Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"bab125429400b9ea0d23b14ef8f938447ccc3100216f232e2d7dfef9ef8834cb","abstract_canon_sha256":"c7637ac55e5f300419b1a88c9cebe2e0641993d61db4e1fd67a2138f08753a29"},"schema_version":"1.0"},"canonical_sha256":"d849352d7a8719f7d4c6a8748bb65781596e16c75f112594e25423c205148dc2","source":{"kind":"arxiv","id":"2007.12077","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2007.12077","created_at":"2026-07-05T01:21:43Z"},{"alias_kind":"arxiv_version","alias_value":"2007.12077v1","created_at":"2026-07-05T01:21:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2007.12077","created_at":"2026-07-05T01:21:43Z"},{"alias_kind":"pith_short_12","alias_value":"3BETKLL2Q4M7","created_at":"2026-07-05T01:21:43Z"},{"alias_kind":"pith_short_16","alias_value":"3BETKLL2Q4M7PVGG","created_at":"2026-07-05T01:21:43Z"},{"alias_kind":"pith_short_8","alias_value":"3BETKLL2","created_at":"2026-07-05T01:21:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:3BETKLL2Q4M7PVGGVB2IXNSXQF","target":"record","payload":{"canonical_record":{"source":{"id":"2007.12077","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2020-07-23T15:41:43Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"bab125429400b9ea0d23b14ef8f938447ccc3100216f232e2d7dfef9ef8834cb","abstract_canon_sha256":"c7637ac55e5f300419b1a88c9cebe2e0641993d61db4e1fd67a2138f08753a29"},"schema_version":"1.0"},"canonical_sha256":"d849352d7a8719f7d4c6a8748bb65781596e16c75f112594e25423c205148dc2","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:21:43.440679Z","signature_b64":"mUPpbsXG25rGUah/0FJksjj0T7//OiFoDMin+dU+3kZoxo88yI6PT4SHiWkg+zRUedcWvGMGkRaK9bu8Nq1JDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d849352d7a8719f7d4c6a8748bb65781596e16c75f112594e25423c205148dc2","last_reissued_at":"2026-07-05T01:21:43.440325Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:21:43.440325Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2007.12077","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-07-05T01:21:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IBdnf82qRCsc1cMk2J20xGfN+NmCx5P1bwztLJwayYHBPZ8PED2BrSKd8VWiCpUf/hDi8Zit286WLP+DSW7vCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T07:47:40.994943Z"},"content_sha256":"0eb3c638dc65c223b1e5c4bb41d85c3c92659846b2f00fa64e974f5d727a9a6b","schema_version":"1.0","event_id":"sha256:0eb3c638dc65c223b1e5c4bb41d85c3c92659846b2f00fa64e974f5d727a9a6b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:3BETKLL2Q4M7PVGGVB2IXNSXQF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Detecting and Enumerating Small Induced Subgraphs in $c$-Closed Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.DS","authors_text":"Andr\\'e Nichterlein, Tomohiro Koana","submitted_at":"2020-07-23T15:41:43Z","abstract_excerpt":"Fox et al. [SIAM J. Comp. 2020] introduced a new parameter, called $c$-closure, for a parameterized study of clique enumeration problems. A graph $G$ is $c$-closed if every pair of vertices with at least $c$ common neighbors is adjacent. The $c$-closure of $G$ is the smallest $c$ such that $G$ is $c$-closed. We systematically explore the impact of $c$-closure on the computational complexity of detecting and enumerating small induced subgraphs. More precisely, for each graph $H$ on three or four vertices, we investigate parameterized polynomial-time algorithms for detecting $H$ and for enumerat"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2007.12077","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2007.12077/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T01:21:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sWU8Jp+GDfwDFPRaqH5YKOMIRttcCvdfb+Zf7AwtmTh+MnRnEKsJQgkdo8y4IudsNg/2dcaj1+tczzlXBXfMCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T07:47:40.995354Z"},"content_sha256":"bd23f4ebe9928045aab0533e99cd8bbf8a1398bbfd83dcb81f1fbdf8bdba0afe","schema_version":"1.0","event_id":"sha256:bd23f4ebe9928045aab0533e99cd8bbf8a1398bbfd83dcb81f1fbdf8bdba0afe"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3BETKLL2Q4M7PVGGVB2IXNSXQF/bundle.json","state_url":"https://pith.science/pith/3BETKLL2Q4M7PVGGVB2IXNSXQF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3BETKLL2Q4M7PVGGVB2IXNSXQF/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-07-07T07:47:40Z","links":{"resolver":"https://pith.science/pith/3BETKLL2Q4M7PVGGVB2IXNSXQF","bundle":"https://pith.science/pith/3BETKLL2Q4M7PVGGVB2IXNSXQF/bundle.json","state":"https://pith.science/pith/3BETKLL2Q4M7PVGGVB2IXNSXQF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3BETKLL2Q4M7PVGGVB2IXNSXQF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:3BETKLL2Q4M7PVGGVB2IXNSXQF","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":"c7637ac55e5f300419b1a88c9cebe2e0641993d61db4e1fd67a2138f08753a29","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2020-07-23T15:41:43Z","title_canon_sha256":"bab125429400b9ea0d23b14ef8f938447ccc3100216f232e2d7dfef9ef8834cb"},"schema_version":"1.0","source":{"id":"2007.12077","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2007.12077","created_at":"2026-07-05T01:21:43Z"},{"alias_kind":"arxiv_version","alias_value":"2007.12077v1","created_at":"2026-07-05T01:21:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2007.12077","created_at":"2026-07-05T01:21:43Z"},{"alias_kind":"pith_short_12","alias_value":"3BETKLL2Q4M7","created_at":"2026-07-05T01:21:43Z"},{"alias_kind":"pith_short_16","alias_value":"3BETKLL2Q4M7PVGG","created_at":"2026-07-05T01:21:43Z"},{"alias_kind":"pith_short_8","alias_value":"3BETKLL2","created_at":"2026-07-05T01:21:43Z"}],"graph_snapshots":[{"event_id":"sha256:bd23f4ebe9928045aab0533e99cd8bbf8a1398bbfd83dcb81f1fbdf8bdba0afe","target":"graph","created_at":"2026-07-05T01:21:43Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2007.12077/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Fox et al. [SIAM J. Comp. 2020] introduced a new parameter, called $c$-closure, for a parameterized study of clique enumeration problems. A graph $G$ is $c$-closed if every pair of vertices with at least $c$ common neighbors is adjacent. The $c$-closure of $G$ is the smallest $c$ such that $G$ is $c$-closed. We systematically explore the impact of $c$-closure on the computational complexity of detecting and enumerating small induced subgraphs. More precisely, for each graph $H$ on three or four vertices, we investigate parameterized polynomial-time algorithms for detecting $H$ and for enumerat","authors_text":"Andr\\'e Nichterlein, Tomohiro Koana","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2020-07-23T15:41:43Z","title":"Detecting and Enumerating Small Induced Subgraphs in $c$-Closed Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2007.12077","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:0eb3c638dc65c223b1e5c4bb41d85c3c92659846b2f00fa64e974f5d727a9a6b","target":"record","created_at":"2026-07-05T01:21:43Z","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":"c7637ac55e5f300419b1a88c9cebe2e0641993d61db4e1fd67a2138f08753a29","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2020-07-23T15:41:43Z","title_canon_sha256":"bab125429400b9ea0d23b14ef8f938447ccc3100216f232e2d7dfef9ef8834cb"},"schema_version":"1.0","source":{"id":"2007.12077","kind":"arxiv","version":1}},"canonical_sha256":"d849352d7a8719f7d4c6a8748bb65781596e16c75f112594e25423c205148dc2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d849352d7a8719f7d4c6a8748bb65781596e16c75f112594e25423c205148dc2","first_computed_at":"2026-07-05T01:21:43.440325Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T01:21:43.440325Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"mUPpbsXG25rGUah/0FJksjj0T7//OiFoDMin+dU+3kZoxo88yI6PT4SHiWkg+zRUedcWvGMGkRaK9bu8Nq1JDQ==","signature_status":"signed_v1","signed_at":"2026-07-05T01:21:43.440679Z","signed_message":"canonical_sha256_bytes"},"source_id":"2007.12077","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0eb3c638dc65c223b1e5c4bb41d85c3c92659846b2f00fa64e974f5d727a9a6b","sha256:bd23f4ebe9928045aab0533e99cd8bbf8a1398bbfd83dcb81f1fbdf8bdba0afe"],"state_sha256":"0c606a7822c26018335cbeca6ea0cb3b259b78443eb51f6aa18faf927357bb43"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"P8C9U9XFPrxjElkTpasAv4AvLXRPef+bAN8+2GAJSQPB5NV/9E5H6iZXjF0q1a0pJF2mCnhhB7KjzgIAFRILCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-07T07:47:40.997361Z","bundle_sha256":"725084f59a0f9d15df288c407593e85c5634ecaaaa11016fea57ff5b3b8fc1b2"}}