{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:UWX4RPCKX345LSSJMXOLJY33HE","short_pith_number":"pith:UWX4RPCK","schema_version":"1.0","canonical_sha256":"a5afc8bc4abef9d5ca4965dcb4e37b39076a97b19094d134e4cad9e828546b12","source":{"kind":"arxiv","id":"1107.2443","version":1},"attestation_state":"computed","paper":{"title":"On the Approximability and Hardness of Minimum Topic Connected Overlay and Its Special Instances","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC","cs.SI"],"primary_cat":"cs.DS","authors_text":"Horotaka Ono, Jun Hosoda, Juraj Hromkovic, Koichi Wada, Monika Steinova, Taisuke Izumi","submitted_at":"2011-07-13T00:51:53Z","abstract_excerpt":"In the context of designing a scalable overlay network to support decentralized topic-based pub/sub communication, the Minimum Topic-Connected Overlay problem (Min-TCO in short) has been investigated: Given a set of t topics and a collection of n users together with the lists of topics they are interested in, the aim is to connect these users to a network by a minimum number of edges such that every graph induced by users interested in a common topic is connected. It is known that Min-TCO is NP-hard and approximable within O(log t) in polynomial time. In this paper, we further investigate the "},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1107.2443","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-07-13T00:51:53Z","cross_cats_sorted":["cs.DC","cs.SI"],"title_canon_sha256":"577b3f5e58a7d6680a329a9be9a7f7758e7ffa8db2bcf8f1f78c9b08e5475002","abstract_canon_sha256":"8ce79aa86a63fce91e9f65f54e479d07b4ffac2b8a7e1cf03b47258514608ed0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:56:57.796294Z","signature_b64":"mi+ZLHb647rkcYEbeDQs3eCGFbY4hgypwyWvKvqhXDQ/6Vo+fyz3YhiCLTb9zbVr2hBuO5Pg7AJe34n8r/PMDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a5afc8bc4abef9d5ca4965dcb4e37b39076a97b19094d134e4cad9e828546b12","last_reissued_at":"2026-05-18T00:56:57.795592Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:56:57.795592Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the Approximability and Hardness of Minimum Topic Connected Overlay and Its Special Instances","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC","cs.SI"],"primary_cat":"cs.DS","authors_text":"Horotaka Ono, Jun Hosoda, Juraj Hromkovic, Koichi Wada, Monika Steinova, Taisuke Izumi","submitted_at":"2011-07-13T00:51:53Z","abstract_excerpt":"In the context of designing a scalable overlay network to support decentralized topic-based pub/sub communication, the Minimum Topic-Connected Overlay problem (Min-TCO in short) has been investigated: Given a set of t topics and a collection of n users together with the lists of topics they are interested in, the aim is to connect these users to a network by a minimum number of edges such that every graph induced by users interested in a common topic is connected. It is known that Min-TCO is NP-hard and approximable within O(log t) in polynomial time. In this paper, we further investigate the "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1107.2443","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1107.2443","created_at":"2026-05-18T00:56:57.795819+00:00"},{"alias_kind":"arxiv_version","alias_value":"1107.2443v1","created_at":"2026-05-18T00:56:57.795819+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1107.2443","created_at":"2026-05-18T00:56:57.795819+00:00"},{"alias_kind":"pith_short_12","alias_value":"UWX4RPCKX345","created_at":"2026-05-18T12:26:42.757692+00:00"},{"alias_kind":"pith_short_16","alias_value":"UWX4RPCKX345LSSJ","created_at":"2026-05-18T12:26:42.757692+00:00"},{"alias_kind":"pith_short_8","alias_value":"UWX4RPCK","created_at":"2026-05-18T12:26:42.757692+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/UWX4RPCKX345LSSJMXOLJY33HE","json":"https://pith.science/pith/UWX4RPCKX345LSSJMXOLJY33HE.json","graph_json":"https://pith.science/api/pith-number/UWX4RPCKX345LSSJMXOLJY33HE/graph.json","events_json":"https://pith.science/api/pith-number/UWX4RPCKX345LSSJMXOLJY33HE/events.json","paper":"https://pith.science/paper/UWX4RPCK"},"agent_actions":{"view_html":"https://pith.science/pith/UWX4RPCKX345LSSJMXOLJY33HE","download_json":"https://pith.science/pith/UWX4RPCKX345LSSJMXOLJY33HE.json","view_paper":"https://pith.science/paper/UWX4RPCK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1107.2443&json=true","fetch_graph":"https://pith.science/api/pith-number/UWX4RPCKX345LSSJMXOLJY33HE/graph.json","fetch_events":"https://pith.science/api/pith-number/UWX4RPCKX345LSSJMXOLJY33HE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UWX4RPCKX345LSSJMXOLJY33HE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UWX4RPCKX345LSSJMXOLJY33HE/action/storage_attestation","attest_author":"https://pith.science/pith/UWX4RPCKX345LSSJMXOLJY33HE/action/author_attestation","sign_citation":"https://pith.science/pith/UWX4RPCKX345LSSJMXOLJY33HE/action/citation_signature","submit_replication":"https://pith.science/pith/UWX4RPCKX345LSSJMXOLJY33HE/action/replication_record"}},"created_at":"2026-05-18T00:56:57.795819+00:00","updated_at":"2026-05-18T00:56:57.795819+00:00"}