{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:7FRJZXZX7VGKH3IHUZPLWCUND2","short_pith_number":"pith:7FRJZXZX","canonical_record":{"source":{"id":"1802.02350","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.dis-nn","submitted_at":"2018-02-07T08:34:28Z","cross_cats_sorted":["cond-mat.stat-mech","cs.DS"],"title_canon_sha256":"521064eb336bd5859fed62ae2d43b40740750f22a05cc67251723b2c471f945e","abstract_canon_sha256":"5647977a6c65483abba6d4905e2415f115c1248bf26376a6af11598410bbb0ca"},"schema_version":"1.0"},"canonical_sha256":"f9629cdf37fd4ca3ed07a65ebb0a8d1ebcd2f49b3dac05bbd2c0808100fc3dfd","source":{"kind":"arxiv","id":"1802.02350","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.02350","created_at":"2026-05-18T00:24:08Z"},{"alias_kind":"arxiv_version","alias_value":"1802.02350v1","created_at":"2026-05-18T00:24:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.02350","created_at":"2026-05-18T00:24:08Z"},{"alias_kind":"pith_short_12","alias_value":"7FRJZXZX7VGK","created_at":"2026-05-18T12:32:11Z"},{"alias_kind":"pith_short_16","alias_value":"7FRJZXZX7VGKH3IH","created_at":"2026-05-18T12:32:11Z"},{"alias_kind":"pith_short_8","alias_value":"7FRJZXZX","created_at":"2026-05-18T12:32:11Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:7FRJZXZX7VGKH3IHUZPLWCUND2","target":"record","payload":{"canonical_record":{"source":{"id":"1802.02350","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.dis-nn","submitted_at":"2018-02-07T08:34:28Z","cross_cats_sorted":["cond-mat.stat-mech","cs.DS"],"title_canon_sha256":"521064eb336bd5859fed62ae2d43b40740750f22a05cc67251723b2c471f945e","abstract_canon_sha256":"5647977a6c65483abba6d4905e2415f115c1248bf26376a6af11598410bbb0ca"},"schema_version":"1.0"},"canonical_sha256":"f9629cdf37fd4ca3ed07a65ebb0a8d1ebcd2f49b3dac05bbd2c0808100fc3dfd","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:24:08.527174Z","signature_b64":"PYHcjWyt/hdanbBQW17u68z6/TY38ax3aLV1SXx6s0fg7aIoIGvGdpwdE5WqmXCINU6gZRkTGxbdWpZ4mVF5DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f9629cdf37fd4ca3ed07a65ebb0a8d1ebcd2f49b3dac05bbd2c0808100fc3dfd","last_reissued_at":"2026-05-18T00:24:08.526470Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:24:08.526470Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1802.02350","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:24:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kN8PP7LlRFMxpfPH5xMqAFuCh/kLWjS7U3u4LCUcrr4gDeh4mU/7WZLq4lYeV7D1uKG2zrQ7DzyEFTxVU7S4Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T20:24:33.717394Z"},"content_sha256":"b217e78134defb881ebf2dd7fbc125f2771a563182d4d3f779bd2988ef4883b0","schema_version":"1.0","event_id":"sha256:b217e78134defb881ebf2dd7fbc125f2771a563182d4d3f779bd2988ef4883b0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:7FRJZXZX7VGKH3IHUZPLWCUND2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Large-deviation Properties of Linear-programming Computational Hardness of the Vertex Cover 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":"Alexander K. Hartmann, Koji Hukushima, Satoshi Takabe","submitted_at":"2018-02-07T08:34:28Z","abstract_excerpt":"The distribution of the computational cost of linear-programming (LP) relaxation for vertex cover problems on Erdos-Renyi random graphs is evaluated by using the rare-event sampling method. As a large-deviation property, differences of the distribution for \"easy\" and \"hard\" problems are found reflecting the hardness of approximation by LP relaxation. In particular, by evaluating the total variation distance between conditional distributions with respect to the hardness, it is suggested that those distributions are almost indistinguishable in the replica symmetric (RS) phase while they asymptot"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.02350","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:24:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LCpki9k6i3fzgnGCA/pcVVxxaP1LPKocKVZYW2HOecou0u6lKTyto+VyIPJ8dDy47RCaZapAZLW5yjfeM8TICg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T20:24:33.717762Z"},"content_sha256":"fba1206a209d41e50d42d2d31973a6df56558e7bb65e6585fd6ff6c4b23f3b2b","schema_version":"1.0","event_id":"sha256:fba1206a209d41e50d42d2d31973a6df56558e7bb65e6585fd6ff6c4b23f3b2b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7FRJZXZX7VGKH3IHUZPLWCUND2/bundle.json","state_url":"https://pith.science/pith/7FRJZXZX7VGKH3IHUZPLWCUND2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7FRJZXZX7VGKH3IHUZPLWCUND2/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-02T20:24:33Z","links":{"resolver":"https://pith.science/pith/7FRJZXZX7VGKH3IHUZPLWCUND2","bundle":"https://pith.science/pith/7FRJZXZX7VGKH3IHUZPLWCUND2/bundle.json","state":"https://pith.science/pith/7FRJZXZX7VGKH3IHUZPLWCUND2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7FRJZXZX7VGKH3IHUZPLWCUND2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:7FRJZXZX7VGKH3IHUZPLWCUND2","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":"5647977a6c65483abba6d4905e2415f115c1248bf26376a6af11598410bbb0ca","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":"2018-02-07T08:34:28Z","title_canon_sha256":"521064eb336bd5859fed62ae2d43b40740750f22a05cc67251723b2c471f945e"},"schema_version":"1.0","source":{"id":"1802.02350","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.02350","created_at":"2026-05-18T00:24:08Z"},{"alias_kind":"arxiv_version","alias_value":"1802.02350v1","created_at":"2026-05-18T00:24:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.02350","created_at":"2026-05-18T00:24:08Z"},{"alias_kind":"pith_short_12","alias_value":"7FRJZXZX7VGK","created_at":"2026-05-18T12:32:11Z"},{"alias_kind":"pith_short_16","alias_value":"7FRJZXZX7VGKH3IH","created_at":"2026-05-18T12:32:11Z"},{"alias_kind":"pith_short_8","alias_value":"7FRJZXZX","created_at":"2026-05-18T12:32:11Z"}],"graph_snapshots":[{"event_id":"sha256:fba1206a209d41e50d42d2d31973a6df56558e7bb65e6585fd6ff6c4b23f3b2b","target":"graph","created_at":"2026-05-18T00:24:08Z","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":"The distribution of the computational cost of linear-programming (LP) relaxation for vertex cover problems on Erdos-Renyi random graphs is evaluated by using the rare-event sampling method. As a large-deviation property, differences of the distribution for \"easy\" and \"hard\" problems are found reflecting the hardness of approximation by LP relaxation. In particular, by evaluating the total variation distance between conditional distributions with respect to the hardness, it is suggested that those distributions are almost indistinguishable in the replica symmetric (RS) phase while they asymptot","authors_text":"Alexander K. Hartmann, Koji Hukushima, Satoshi Takabe","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":"2018-02-07T08:34:28Z","title":"Large-deviation Properties of Linear-programming Computational Hardness of the Vertex Cover Problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.02350","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:b217e78134defb881ebf2dd7fbc125f2771a563182d4d3f779bd2988ef4883b0","target":"record","created_at":"2026-05-18T00:24:08Z","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":"5647977a6c65483abba6d4905e2415f115c1248bf26376a6af11598410bbb0ca","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":"2018-02-07T08:34:28Z","title_canon_sha256":"521064eb336bd5859fed62ae2d43b40740750f22a05cc67251723b2c471f945e"},"schema_version":"1.0","source":{"id":"1802.02350","kind":"arxiv","version":1}},"canonical_sha256":"f9629cdf37fd4ca3ed07a65ebb0a8d1ebcd2f49b3dac05bbd2c0808100fc3dfd","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f9629cdf37fd4ca3ed07a65ebb0a8d1ebcd2f49b3dac05bbd2c0808100fc3dfd","first_computed_at":"2026-05-18T00:24:08.526470Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:24:08.526470Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"PYHcjWyt/hdanbBQW17u68z6/TY38ax3aLV1SXx6s0fg7aIoIGvGdpwdE5WqmXCINU6gZRkTGxbdWpZ4mVF5DQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:24:08.527174Z","signed_message":"canonical_sha256_bytes"},"source_id":"1802.02350","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b217e78134defb881ebf2dd7fbc125f2771a563182d4d3f779bd2988ef4883b0","sha256:fba1206a209d41e50d42d2d31973a6df56558e7bb65e6585fd6ff6c4b23f3b2b"],"state_sha256":"6a105636100a6b46383c3950ecf17de7ccba092057037e774c80807fb9a87184"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nsiTbqED+xJWo2iKMNwRHo47PrleoWTQMZyt3e7K4NnBg5Yec9+rUGRY6AeLAE59HWD4CzVH/gQc7g+cp76sDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T20:24:33.719825Z","bundle_sha256":"deab288cd2ae08211b94dcd42f58ac487ecf63ae2ddda67ff195c12a9cb37b9b"}}