{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:JV7PYHODFF752QNOEMMLL5PEGI","short_pith_number":"pith:JV7PYHOD","canonical_record":{"source":{"id":"1709.01123","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2017-09-04T19:09:57Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"7dcc3b167b05480e07000f547b4fa5c16c0226265dd265335147fdd0156fc1ba","abstract_canon_sha256":"65217cd5875677f81439e31bc454f30b6463445980200b702e02ed00e4d5ca48"},"schema_version":"1.0"},"canonical_sha256":"4d7efc1dc3297fdd41ae2318b5f5e4321ae4f23c35086a598d1b5ee190d24be4","source":{"kind":"arxiv","id":"1709.01123","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.01123","created_at":"2026-05-18T00:36:00Z"},{"alias_kind":"arxiv_version","alias_value":"1709.01123v1","created_at":"2026-05-18T00:36:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.01123","created_at":"2026-05-18T00:36:00Z"},{"alias_kind":"pith_short_12","alias_value":"JV7PYHODFF75","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_16","alias_value":"JV7PYHODFF752QNO","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_8","alias_value":"JV7PYHOD","created_at":"2026-05-18T12:31:24Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:JV7PYHODFF752QNOEMMLL5PEGI","target":"record","payload":{"canonical_record":{"source":{"id":"1709.01123","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2017-09-04T19:09:57Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"7dcc3b167b05480e07000f547b4fa5c16c0226265dd265335147fdd0156fc1ba","abstract_canon_sha256":"65217cd5875677f81439e31bc454f30b6463445980200b702e02ed00e4d5ca48"},"schema_version":"1.0"},"canonical_sha256":"4d7efc1dc3297fdd41ae2318b5f5e4321ae4f23c35086a598d1b5ee190d24be4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:36:00.861571Z","signature_b64":"5qwSR0uuf73+w4nMoCnLAS88AQfzWrv5r8idwHyFYYP8BhBCMiHQfRTKRKTWxw/ibyQ0sN5LnnJXuzTFqz6sBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4d7efc1dc3297fdd41ae2318b5f5e4321ae4f23c35086a598d1b5ee190d24be4","last_reissued_at":"2026-05-18T00:36:00.861036Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:36:00.861036Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1709.01123","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:36:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aSptZ07BzjVBghfZbU4eikwqNu0bf3oUXfgDo8Z3XHgzzXj5mGPKIlU/QcNPf9oxcJOH81hoebLybGLxFrGUBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T09:02:00.713222Z"},"content_sha256":"7b88a40d69f45eaa81e049dc8cd1571c4c84bcd895461157ff803c32aaeb5623","schema_version":"1.0","event_id":"sha256:7b88a40d69f45eaa81e049dc8cd1571c4c84bcd895461157ff803c32aaeb5623"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:JV7PYHODFF752QNOEMMLL5PEGI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"To Be Connected, or Not to Be Connected: That is the Minimum Inefficiency Subgraph Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.SI","authors_text":"David Garcia-Soriano, Francesco Bonchi, Francesco Gullo, Natali Ruchansky, Nicolas Kourtellis","submitted_at":"2017-09-04T19:09:57Z","abstract_excerpt":"We study the problem of extracting a selective connector for a given set of query vertices $Q \\subseteq V$ in a graph $G = (V,E)$. A selective connector is a subgraph of $G$ which exhibits some cohesiveness property, and contains the query vertices but does not necessarily connect them all. Relaxing the connectedness requirement allows the connector to detect multiple communities and to be tolerant to outliers. We achieve this by introducing the new measure of network inefficiency and by instantiating our search for a selective connector as the problem of finding the minimum inefficiency subgr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.01123","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:36:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MymMrUuS/RXcfhewNkVgB3nQ6HY7kIIIeMrzaXLOl1Zy8xgN2nQvdmGz7vc6vpY1a83BCsvcyXnhpVsWpeg2AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T09:02:00.713588Z"},"content_sha256":"4d0285253ba6eb19ba370f4d2a8825254d3b12f0a959160732f6a21f2e861f80","schema_version":"1.0","event_id":"sha256:4d0285253ba6eb19ba370f4d2a8825254d3b12f0a959160732f6a21f2e861f80"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JV7PYHODFF752QNOEMMLL5PEGI/bundle.json","state_url":"https://pith.science/pith/JV7PYHODFF752QNOEMMLL5PEGI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JV7PYHODFF752QNOEMMLL5PEGI/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-22T09:02:00Z","links":{"resolver":"https://pith.science/pith/JV7PYHODFF752QNOEMMLL5PEGI","bundle":"https://pith.science/pith/JV7PYHODFF752QNOEMMLL5PEGI/bundle.json","state":"https://pith.science/pith/JV7PYHODFF752QNOEMMLL5PEGI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JV7PYHODFF752QNOEMMLL5PEGI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:JV7PYHODFF752QNOEMMLL5PEGI","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":"65217cd5875677f81439e31bc454f30b6463445980200b702e02ed00e4d5ca48","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2017-09-04T19:09:57Z","title_canon_sha256":"7dcc3b167b05480e07000f547b4fa5c16c0226265dd265335147fdd0156fc1ba"},"schema_version":"1.0","source":{"id":"1709.01123","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.01123","created_at":"2026-05-18T00:36:00Z"},{"alias_kind":"arxiv_version","alias_value":"1709.01123v1","created_at":"2026-05-18T00:36:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.01123","created_at":"2026-05-18T00:36:00Z"},{"alias_kind":"pith_short_12","alias_value":"JV7PYHODFF75","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_16","alias_value":"JV7PYHODFF752QNO","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_8","alias_value":"JV7PYHOD","created_at":"2026-05-18T12:31:24Z"}],"graph_snapshots":[{"event_id":"sha256:4d0285253ba6eb19ba370f4d2a8825254d3b12f0a959160732f6a21f2e861f80","target":"graph","created_at":"2026-05-18T00:36:00Z","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 study the problem of extracting a selective connector for a given set of query vertices $Q \\subseteq V$ in a graph $G = (V,E)$. A selective connector is a subgraph of $G$ which exhibits some cohesiveness property, and contains the query vertices but does not necessarily connect them all. Relaxing the connectedness requirement allows the connector to detect multiple communities and to be tolerant to outliers. We achieve this by introducing the new measure of network inefficiency and by instantiating our search for a selective connector as the problem of finding the minimum inefficiency subgr","authors_text":"David Garcia-Soriano, Francesco Bonchi, Francesco Gullo, Natali Ruchansky, Nicolas Kourtellis","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2017-09-04T19:09:57Z","title":"To Be Connected, or Not to Be Connected: That is the Minimum Inefficiency Subgraph Problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.01123","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:7b88a40d69f45eaa81e049dc8cd1571c4c84bcd895461157ff803c32aaeb5623","target":"record","created_at":"2026-05-18T00:36:00Z","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":"65217cd5875677f81439e31bc454f30b6463445980200b702e02ed00e4d5ca48","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2017-09-04T19:09:57Z","title_canon_sha256":"7dcc3b167b05480e07000f547b4fa5c16c0226265dd265335147fdd0156fc1ba"},"schema_version":"1.0","source":{"id":"1709.01123","kind":"arxiv","version":1}},"canonical_sha256":"4d7efc1dc3297fdd41ae2318b5f5e4321ae4f23c35086a598d1b5ee190d24be4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4d7efc1dc3297fdd41ae2318b5f5e4321ae4f23c35086a598d1b5ee190d24be4","first_computed_at":"2026-05-18T00:36:00.861036Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:36:00.861036Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"5qwSR0uuf73+w4nMoCnLAS88AQfzWrv5r8idwHyFYYP8BhBCMiHQfRTKRKTWxw/ibyQ0sN5LnnJXuzTFqz6sBw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:36:00.861571Z","signed_message":"canonical_sha256_bytes"},"source_id":"1709.01123","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7b88a40d69f45eaa81e049dc8cd1571c4c84bcd895461157ff803c32aaeb5623","sha256:4d0285253ba6eb19ba370f4d2a8825254d3b12f0a959160732f6a21f2e861f80"],"state_sha256":"883e38a908223c3198364f172ad99962f644fd5b13e672ffcfbb003e8e6b5b83"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QJkjUqHgK/KwnBaEIs4HBceI7oPuDf1BAKPA1AUxZx09rlORmO7hPed9cfu2FugNgi6PYVX2TpwY3OsfukOaBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-22T09:02:00.715474Z","bundle_sha256":"74bb960efb8f1d502c58fe748919cd773dd0ae3aff91e25321731b77abe5a56e"}}