{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:NDZE6PP5AD6YGZXR3OMQKSJKRS","short_pith_number":"pith:NDZE6PP5","canonical_record":{"source":{"id":"1802.10386","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-02-28T12:46:53Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"80b86ad04d7a5c7bd3eb79e887cbd72a01ac14461428fe2c68d430facd13775f","abstract_canon_sha256":"1299b25d5740fa8012fae51bad2983899f197288c7dd99092a0ce9bba935daeb"},"schema_version":"1.0"},"canonical_sha256":"68f24f3dfd00fd8366f1db9905492a8ca988ea1d30712b0c8690916fc5f700b2","source":{"kind":"arxiv","id":"1802.10386","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.10386","created_at":"2026-05-18T00:22:17Z"},{"alias_kind":"arxiv_version","alias_value":"1802.10386v1","created_at":"2026-05-18T00:22:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.10386","created_at":"2026-05-18T00:22:17Z"},{"alias_kind":"pith_short_12","alias_value":"NDZE6PP5AD6Y","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_16","alias_value":"NDZE6PP5AD6YGZXR","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_8","alias_value":"NDZE6PP5","created_at":"2026-05-18T12:32:40Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:NDZE6PP5AD6YGZXR3OMQKSJKRS","target":"record","payload":{"canonical_record":{"source":{"id":"1802.10386","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-02-28T12:46:53Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"80b86ad04d7a5c7bd3eb79e887cbd72a01ac14461428fe2c68d430facd13775f","abstract_canon_sha256":"1299b25d5740fa8012fae51bad2983899f197288c7dd99092a0ce9bba935daeb"},"schema_version":"1.0"},"canonical_sha256":"68f24f3dfd00fd8366f1db9905492a8ca988ea1d30712b0c8690916fc5f700b2","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:22:17.280945Z","signature_b64":"SktoRK7yNOfrnH2opY8I4hq8wYKjJAJqlCvmEzz+ppVWiBLKwoT2kKBQNV2VQbdVL4NwKDOlsysoM3v4MVAABg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"68f24f3dfd00fd8366f1db9905492a8ca988ea1d30712b0c8690916fc5f700b2","last_reissued_at":"2026-05-18T00:22:17.280368Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:22:17.280368Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1802.10386","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:22:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MtAySes148Uwh0xYabwMch1MhsemRQZaR4gQhfQfrg8BU6mk7mCtrEokh/llM3//DshqmZq/vxVr07PhBtwDCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T13:02:56.411443Z"},"content_sha256":"85d35e110004a706c7636939dfd775f028466be3437a58b1fc39cb6c6ad93260","schema_version":"1.0","event_id":"sha256:85d35e110004a706c7636939dfd775f028466be3437a58b1fc39cb6c6ad93260"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:NDZE6PP5AD6YGZXR3OMQKSJKRS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Parameterized Aspects of Strong Subgraph Closure","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.DS","authors_text":"Athanasios L. Konstantinidis, Charis Papadopoulos, Paloma T. Lima, Petr A. Golovach, Pinar Heggernes","submitted_at":"2018-02-28T12:46:53Z","abstract_excerpt":"Motivated by the role of triadic closures in social networks, and the importance of finding a maximum subgraph avoiding a fixed pattern, we introduce and initiate the parameterized study of the Strong F-closure problem, where F is a fixed graph. This is a generalization of Strong Triadic Closure, whereas it is a relaxation of F-free Edge Deletion. In Strong F-closure, we want to select a maximum number of edges of the input graph G, and mark them as strong edges, in the following way: whenever a subset of the strong edges forms a subgraph isomorphic to F, then the corresponding induced subgrap"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.10386","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:22:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SjRQQ06MRQqbhLk7SkNJMWmrLMnJ8nP4WLxEzWluhr77zhzgnD08VKrkuDanJxS94lQWGvwNQF30T/kaFSkcBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T13:02:56.411789Z"},"content_sha256":"51d6f511e44a986761dbe745ac52602c80eeadec2aac08136cc79b2533581cde","schema_version":"1.0","event_id":"sha256:51d6f511e44a986761dbe745ac52602c80eeadec2aac08136cc79b2533581cde"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NDZE6PP5AD6YGZXR3OMQKSJKRS/bundle.json","state_url":"https://pith.science/pith/NDZE6PP5AD6YGZXR3OMQKSJKRS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NDZE6PP5AD6YGZXR3OMQKSJKRS/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-28T13:02:56Z","links":{"resolver":"https://pith.science/pith/NDZE6PP5AD6YGZXR3OMQKSJKRS","bundle":"https://pith.science/pith/NDZE6PP5AD6YGZXR3OMQKSJKRS/bundle.json","state":"https://pith.science/pith/NDZE6PP5AD6YGZXR3OMQKSJKRS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NDZE6PP5AD6YGZXR3OMQKSJKRS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:NDZE6PP5AD6YGZXR3OMQKSJKRS","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":"1299b25d5740fa8012fae51bad2983899f197288c7dd99092a0ce9bba935daeb","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-02-28T12:46:53Z","title_canon_sha256":"80b86ad04d7a5c7bd3eb79e887cbd72a01ac14461428fe2c68d430facd13775f"},"schema_version":"1.0","source":{"id":"1802.10386","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.10386","created_at":"2026-05-18T00:22:17Z"},{"alias_kind":"arxiv_version","alias_value":"1802.10386v1","created_at":"2026-05-18T00:22:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.10386","created_at":"2026-05-18T00:22:17Z"},{"alias_kind":"pith_short_12","alias_value":"NDZE6PP5AD6Y","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_16","alias_value":"NDZE6PP5AD6YGZXR","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_8","alias_value":"NDZE6PP5","created_at":"2026-05-18T12:32:40Z"}],"graph_snapshots":[{"event_id":"sha256:51d6f511e44a986761dbe745ac52602c80eeadec2aac08136cc79b2533581cde","target":"graph","created_at":"2026-05-18T00:22:17Z","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":"Motivated by the role of triadic closures in social networks, and the importance of finding a maximum subgraph avoiding a fixed pattern, we introduce and initiate the parameterized study of the Strong F-closure problem, where F is a fixed graph. This is a generalization of Strong Triadic Closure, whereas it is a relaxation of F-free Edge Deletion. In Strong F-closure, we want to select a maximum number of edges of the input graph G, and mark them as strong edges, in the following way: whenever a subset of the strong edges forms a subgraph isomorphic to F, then the corresponding induced subgrap","authors_text":"Athanasios L. Konstantinidis, Charis Papadopoulos, Paloma T. Lima, Petr A. Golovach, Pinar Heggernes","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-02-28T12:46:53Z","title":"Parameterized Aspects of Strong Subgraph Closure"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.10386","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:85d35e110004a706c7636939dfd775f028466be3437a58b1fc39cb6c6ad93260","target":"record","created_at":"2026-05-18T00:22:17Z","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":"1299b25d5740fa8012fae51bad2983899f197288c7dd99092a0ce9bba935daeb","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-02-28T12:46:53Z","title_canon_sha256":"80b86ad04d7a5c7bd3eb79e887cbd72a01ac14461428fe2c68d430facd13775f"},"schema_version":"1.0","source":{"id":"1802.10386","kind":"arxiv","version":1}},"canonical_sha256":"68f24f3dfd00fd8366f1db9905492a8ca988ea1d30712b0c8690916fc5f700b2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"68f24f3dfd00fd8366f1db9905492a8ca988ea1d30712b0c8690916fc5f700b2","first_computed_at":"2026-05-18T00:22:17.280368Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:22:17.280368Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"SktoRK7yNOfrnH2opY8I4hq8wYKjJAJqlCvmEzz+ppVWiBLKwoT2kKBQNV2VQbdVL4NwKDOlsysoM3v4MVAABg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:22:17.280945Z","signed_message":"canonical_sha256_bytes"},"source_id":"1802.10386","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:85d35e110004a706c7636939dfd775f028466be3437a58b1fc39cb6c6ad93260","sha256:51d6f511e44a986761dbe745ac52602c80eeadec2aac08136cc79b2533581cde"],"state_sha256":"5f49411ac763a87aed05bec5f2da6626147740407c82e1ec63eb06c9e2211a77"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qNgddgd8IdNkz6+KKGZEHXltlKGd/E3kvIyG5J82uOykCGyIvpJ8p4qc0p+3+jV6zqD5314vF1Daq4zVHYi6Bg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T13:02:56.413782Z","bundle_sha256":"c757389b74c70d016fcd1f2cd29ce6cfe140bd39028407e757b289273429b5a8"}}