{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:J7UDH63B5F2ZT7LR5U3X57DHIK","short_pith_number":"pith:J7UDH63B","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"},"canonical_sha256":"4fe833fb61e97599fd71ed377efc6742adf78e60ffeca949a2ef0c7ed738541c","source":{"kind":"arxiv","id":"1706.08721","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1706.08721","created_at":"2026-05-18T00:22:39Z"},{"alias_kind":"arxiv_version","alias_value":"1706.08721v2","created_at":"2026-05-18T00:22:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.08721","created_at":"2026-05-18T00:22:39Z"},{"alias_kind":"pith_short_12","alias_value":"J7UDH63B5F2Z","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_16","alias_value":"J7UDH63B5F2ZT7LR","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_8","alias_value":"J7UDH63B","created_at":"2026-05-18T12:31:21Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:J7UDH63B5F2ZT7LR5U3X57DHIK","target":"record","payload":{"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"},"canonical_sha256":"4fe833fb61e97599fd71ed377efc6742adf78e60ffeca949a2ef0c7ed738541c","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"},"source_kind":"arxiv","source_id":"1706.08721","source_version":2,"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:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gLpltin/vV/PoefHt143QB6T/ViPWdqdmX7YuncoeJM5Gm+3HXbAkS+88vb940iXZbS2PrnSxzqgk7s642m9AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T23:12:02.988913Z"},"content_sha256":"09cf24c04e8e68b793b375dded353306e781d05a41d2ca86440d7037cac42906","schema_version":"1.0","event_id":"sha256:09cf24c04e8e68b793b375dded353306e781d05a41d2ca86440d7037cac42906"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:J7UDH63B5F2ZT7LR5U3X57DHIK","target":"graph","payload":{"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"},"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:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mYGoajhRed55HI/eMNH01NoASFZhYH1mNH1rYKZGFg1D9tV8jMNmanGZdEhzbd7V4ftw8y35ZJ+kZNQaBCPrBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T23:12:02.989305Z"},"content_sha256":"c5c09ec5dc30d7e463c853230cfd7af7440c4f693c957cf9e4dfaed0239eb19b","schema_version":"1.0","event_id":"sha256:c5c09ec5dc30d7e463c853230cfd7af7440c4f693c957cf9e4dfaed0239eb19b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/J7UDH63B5F2ZT7LR5U3X57DHIK/bundle.json","state_url":"https://pith.science/pith/J7UDH63B5F2ZT7LR5U3X57DHIK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/J7UDH63B5F2ZT7LR5U3X57DHIK/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-02T23:12:02Z","links":{"resolver":"https://pith.science/pith/J7UDH63B5F2ZT7LR5U3X57DHIK","bundle":"https://pith.science/pith/J7UDH63B5F2ZT7LR5U3X57DHIK/bundle.json","state":"https://pith.science/pith/J7UDH63B5F2ZT7LR5U3X57DHIK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/J7UDH63B5F2ZT7LR5U3X57DHIK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:J7UDH63B5F2ZT7LR5U3X57DHIK","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":"e8e58ef53886fc97aa42e20598283fd2fa6091e381c7723ba61acf68e8d79189","cross_cats_sorted":["cond-mat.stat-mech","cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.dis-nn","submitted_at":"2017-06-27T08:32:13Z","title_canon_sha256":"56a469f7e3c181fc4a08dea5dc1c837af8deaa615a31e3403770820c4ff0aa9e"},"schema_version":"1.0","source":{"id":"1706.08721","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1706.08721","created_at":"2026-05-18T00:22:39Z"},{"alias_kind":"arxiv_version","alias_value":"1706.08721v2","created_at":"2026-05-18T00:22:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.08721","created_at":"2026-05-18T00:22:39Z"},{"alias_kind":"pith_short_12","alias_value":"J7UDH63B5F2Z","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_16","alias_value":"J7UDH63B5F2ZT7LR","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_8","alias_value":"J7UDH63B","created_at":"2026-05-18T12:31:21Z"}],"graph_snapshots":[{"event_id":"sha256:c5c09ec5dc30d7e463c853230cfd7af7440c4f693c957cf9e4dfaed0239eb19b","target":"graph","created_at":"2026-05-18T00:22:39Z","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":"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","authors_text":"Koji Hukushima, Satoshi Takabe, Takanori Maehara","cross_cats":["cond-mat.stat-mech","cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.dis-nn","submitted_at":"2017-06-27T08:32:13Z","title":"Typical Approximation Performance for Maximum Coverage Problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.08721","kind":"arxiv","version":2},"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:09cf24c04e8e68b793b375dded353306e781d05a41d2ca86440d7037cac42906","target":"record","created_at":"2026-05-18T00:22:39Z","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":"e8e58ef53886fc97aa42e20598283fd2fa6091e381c7723ba61acf68e8d79189","cross_cats_sorted":["cond-mat.stat-mech","cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.dis-nn","submitted_at":"2017-06-27T08:32:13Z","title_canon_sha256":"56a469f7e3c181fc4a08dea5dc1c837af8deaa615a31e3403770820c4ff0aa9e"},"schema_version":"1.0","source":{"id":"1706.08721","kind":"arxiv","version":2}},"canonical_sha256":"4fe833fb61e97599fd71ed377efc6742adf78e60ffeca949a2ef0c7ed738541c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4fe833fb61e97599fd71ed377efc6742adf78e60ffeca949a2ef0c7ed738541c","first_computed_at":"2026-05-18T00:22:39.778786Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:22:39.778786Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Ex60S+qfMKitPJ0p9YZ/kCruWhYrUFNrffl2iEHjKnOC5kjytOWO6jqh5rUZWi3avMEFKicxfl5LCHiVXRJMDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:22:39.779229Z","signed_message":"canonical_sha256_bytes"},"source_id":"1706.08721","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:09cf24c04e8e68b793b375dded353306e781d05a41d2ca86440d7037cac42906","sha256:c5c09ec5dc30d7e463c853230cfd7af7440c4f693c957cf9e4dfaed0239eb19b"],"state_sha256":"0e26c53c10c007cf3762dcc97ecdee13eea1ee484e483f2145c82f9ea0b3f8d1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jyumGwmXP4Njo8pQhGvZ7aDf/6BxMm06SJefZnORfOJti7DRwI1g1SUpPyo9sYn8uSmII0wmGMwaqtmlkXnXAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T23:12:02.991224Z","bundle_sha256":"728f03266e67f92df718bd275045c3cac9f8978b4ea1610c20445f80abd71089"}}