{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:J7UDH63B5F2ZT7LR5U3X57DHIK","short_pith_number":"pith:J7UDH63B","schema_version":"1.0","canonical_sha256":"4fe833fb61e97599fd71ed377efc6742adf78e60ffeca949a2ef0c7ed738541c","source":{"kind":"arxiv","id":"1706.08721","version":2},"attestation_state":"computed","paper":{"title":"Typical Approximation Performance for Maximum Coverage Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.stat-mech","cs.DS"],"primary_cat":"cond-mat.dis-nn","authors_text":"Koji Hukushima, Satoshi Takabe, Takanori Maehara","submitted_at":"2017-06-27T08:32:13Z","abstract_excerpt":"This study investigated typical performance of approximation algorithms known as belief propagation, greedy algorithm, and linear-programming relaxation for maximum coverage problems on sparse biregular random graphs. After using the cavity method for a corresponding hard-core lattice--gas model, results show that two distinct thresholds of replica-symmetry and its breaking exist in the typical performance threshold of belief propagation. In the low-density region, the superiority of three algorithms in terms of a typical performance threshold is obtained by some theoretical analyses. Although"},"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":"1706.08721","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.dis-nn","submitted_at":"2017-06-27T08:32:13Z","cross_cats_sorted":["cond-mat.stat-mech","cs.DS"],"title_canon_sha256":"56a469f7e3c181fc4a08dea5dc1c837af8deaa615a31e3403770820c4ff0aa9e","abstract_canon_sha256":"e8e58ef53886fc97aa42e20598283fd2fa6091e381c7723ba61acf68e8d79189"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:22:39.779229Z","signature_b64":"Ex60S+qfMKitPJ0p9YZ/kCruWhYrUFNrffl2iEHjKnOC5kjytOWO6jqh5rUZWi3avMEFKicxfl5LCHiVXRJMDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4fe833fb61e97599fd71ed377efc6742adf78e60ffeca949a2ef0c7ed738541c","last_reissued_at":"2026-05-18T00:22:39.778786Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:22:39.778786Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Typical Approximation Performance for Maximum Coverage Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.stat-mech","cs.DS"],"primary_cat":"cond-mat.dis-nn","authors_text":"Koji Hukushima, Satoshi Takabe, Takanori Maehara","submitted_at":"2017-06-27T08:32:13Z","abstract_excerpt":"This study investigated typical performance of approximation algorithms known as belief propagation, greedy algorithm, and linear-programming relaxation for maximum coverage problems on sparse biregular random graphs. After using the cavity method for a corresponding hard-core lattice--gas model, results show that two distinct thresholds of replica-symmetry and its breaking exist in the typical performance threshold of belief propagation. In the low-density region, the superiority of three algorithms in terms of a typical performance threshold is obtained by some theoretical analyses. Although"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.08721","kind":"arxiv","version":2},"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":"1706.08721","created_at":"2026-05-18T00:22:39.778842+00:00"},{"alias_kind":"arxiv_version","alias_value":"1706.08721v2","created_at":"2026-05-18T00:22:39.778842+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.08721","created_at":"2026-05-18T00:22:39.778842+00:00"},{"alias_kind":"pith_short_12","alias_value":"J7UDH63B5F2Z","created_at":"2026-05-18T12:31:21.493067+00:00"},{"alias_kind":"pith_short_16","alias_value":"J7UDH63B5F2ZT7LR","created_at":"2026-05-18T12:31:21.493067+00:00"},{"alias_kind":"pith_short_8","alias_value":"J7UDH63B","created_at":"2026-05-18T12:31:21.493067+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/J7UDH63B5F2ZT7LR5U3X57DHIK","json":"https://pith.science/pith/J7UDH63B5F2ZT7LR5U3X57DHIK.json","graph_json":"https://pith.science/api/pith-number/J7UDH63B5F2ZT7LR5U3X57DHIK/graph.json","events_json":"https://pith.science/api/pith-number/J7UDH63B5F2ZT7LR5U3X57DHIK/events.json","paper":"https://pith.science/paper/J7UDH63B"},"agent_actions":{"view_html":"https://pith.science/pith/J7UDH63B5F2ZT7LR5U3X57DHIK","download_json":"https://pith.science/pith/J7UDH63B5F2ZT7LR5U3X57DHIK.json","view_paper":"https://pith.science/paper/J7UDH63B","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1706.08721&json=true","fetch_graph":"https://pith.science/api/pith-number/J7UDH63B5F2ZT7LR5U3X57DHIK/graph.json","fetch_events":"https://pith.science/api/pith-number/J7UDH63B5F2ZT7LR5U3X57DHIK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/J7UDH63B5F2ZT7LR5U3X57DHIK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/J7UDH63B5F2ZT7LR5U3X57DHIK/action/storage_attestation","attest_author":"https://pith.science/pith/J7UDH63B5F2ZT7LR5U3X57DHIK/action/author_attestation","sign_citation":"https://pith.science/pith/J7UDH63B5F2ZT7LR5U3X57DHIK/action/citation_signature","submit_replication":"https://pith.science/pith/J7UDH63B5F2ZT7LR5U3X57DHIK/action/replication_record"}},"created_at":"2026-05-18T00:22:39.778842+00:00","updated_at":"2026-05-18T00:22:39.778842+00:00"}