{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:PUE6RXCBPVTXD3DZ7P3DI5GLTB","short_pith_number":"pith:PUE6RXCB","canonical_record":{"source":{"id":"1605.00897","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.dis-nn","submitted_at":"2016-05-03T13:29:30Z","cross_cats_sorted":["physics.soc-ph"],"title_canon_sha256":"e71e2cd8499f51ab2037dc659042cf44ecf47dd5b2c61e7075ab97dddc0eadf1","abstract_canon_sha256":"09bc366b823b45947d8f3c6fbc323332c1c50ef8e551bdbccd1283c304a47151"},"schema_version":"1.0"},"canonical_sha256":"7d09e8dc417d6771ec79fbf63474cb985ccb9a582f7104b61dad7bf29526b06f","source":{"kind":"arxiv","id":"1605.00897","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.00897","created_at":"2026-07-05T01:15:04Z"},{"alias_kind":"arxiv_version","alias_value":"1605.00897v2","created_at":"2026-07-05T01:15:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.00897","created_at":"2026-07-05T01:15:04Z"},{"alias_kind":"pith_short_12","alias_value":"PUE6RXCBPVTX","created_at":"2026-07-05T01:15:04Z"},{"alias_kind":"pith_short_16","alias_value":"PUE6RXCBPVTXD3DZ","created_at":"2026-07-05T01:15:04Z"},{"alias_kind":"pith_short_8","alias_value":"PUE6RXCB","created_at":"2026-07-05T01:15:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:PUE6RXCBPVTXD3DZ7P3DI5GLTB","target":"record","payload":{"canonical_record":{"source":{"id":"1605.00897","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.dis-nn","submitted_at":"2016-05-03T13:29:30Z","cross_cats_sorted":["physics.soc-ph"],"title_canon_sha256":"e71e2cd8499f51ab2037dc659042cf44ecf47dd5b2c61e7075ab97dddc0eadf1","abstract_canon_sha256":"09bc366b823b45947d8f3c6fbc323332c1c50ef8e551bdbccd1283c304a47151"},"schema_version":"1.0"},"canonical_sha256":"7d09e8dc417d6771ec79fbf63474cb985ccb9a582f7104b61dad7bf29526b06f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:15:04.428924Z","signature_b64":"R/uFZ+u6pGKhe+nBXuA9S0qx2BC5QzpZmSbSBw3FUMLXmusfL3WDx4P1u1ygEDoPYo55ayONRajTg91L4n2rDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7d09e8dc417d6771ec79fbf63474cb985ccb9a582f7104b61dad7bf29526b06f","last_reissued_at":"2026-07-05T01:15:04.428511Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:15:04.428511Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1605.00897","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-07-05T01:15:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WFPYbMXYzfYf516EdLgaV/eBrddHmtZa08/6Xrk21zjsGuyEsTGLG11yoQiqYuzuw0yn+AutmpVcV2+hBB5/AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T18:30:25.320820Z"},"content_sha256":"511c7602ef1cc3a9c848bae299548b0565af5579b96d3bc8454fb93b1c9b5414","schema_version":"1.0","event_id":"sha256:511c7602ef1cc3a9c848bae299548b0565af5579b96d3bc8454fb93b1c9b5414"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:PUE6RXCBPVTXD3DZ7P3DI5GLTB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Covering Problems and Core Percolations on Hypergraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["physics.soc-ph"],"primary_cat":"cond-mat.dis-nn","authors_text":"Bruno Coelho Coutinho, Hai-Jun Zhou, Yang-Yu Liu","submitted_at":"2016-05-03T13:29:30Z","abstract_excerpt":"Covering problems are classical computational problems concerning whether a certain combinatorial structure 'covers' another. For example, the minimum vertex covering problem aims to find the smallest set of vertices in a graph so that each edge is incident to at least one vertex in that set. Interestingly, the computational complexity of the minimum vertex covering problem in graphs is closely related to the core percolation problem, where the core is a special subgraph obtained by the greedy leaf removal procedure. Here, by generalizing the greedy leaf removal procedure in graphs to hypergra"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.00897","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1605.00897/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T01:15:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7wWYvBtteOJzT2ggAd4v6aJkp44s5jUr+9ldSdGxh7RpiPZj313P+ZJEvBBFC2RBSMQU8HAWjJsxa1cxFseMAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T18:30:25.321691Z"},"content_sha256":"ae78cca18df10cccf6ed7d706bca3f9014922b9d656e8c2f4c3d46d9dee86f61","schema_version":"1.0","event_id":"sha256:ae78cca18df10cccf6ed7d706bca3f9014922b9d656e8c2f4c3d46d9dee86f61"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PUE6RXCBPVTXD3DZ7P3DI5GLTB/bundle.json","state_url":"https://pith.science/pith/PUE6RXCBPVTXD3DZ7P3DI5GLTB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PUE6RXCBPVTXD3DZ7P3DI5GLTB/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-08-16T18:30:25Z","links":{"resolver":"https://pith.science/pith/PUE6RXCBPVTXD3DZ7P3DI5GLTB","bundle":"https://pith.science/pith/PUE6RXCBPVTXD3DZ7P3DI5GLTB/bundle.json","state":"https://pith.science/pith/PUE6RXCBPVTXD3DZ7P3DI5GLTB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PUE6RXCBPVTXD3DZ7P3DI5GLTB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:PUE6RXCBPVTXD3DZ7P3DI5GLTB","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":"09bc366b823b45947d8f3c6fbc323332c1c50ef8e551bdbccd1283c304a47151","cross_cats_sorted":["physics.soc-ph"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.dis-nn","submitted_at":"2016-05-03T13:29:30Z","title_canon_sha256":"e71e2cd8499f51ab2037dc659042cf44ecf47dd5b2c61e7075ab97dddc0eadf1"},"schema_version":"1.0","source":{"id":"1605.00897","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.00897","created_at":"2026-07-05T01:15:04Z"},{"alias_kind":"arxiv_version","alias_value":"1605.00897v2","created_at":"2026-07-05T01:15:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.00897","created_at":"2026-07-05T01:15:04Z"},{"alias_kind":"pith_short_12","alias_value":"PUE6RXCBPVTX","created_at":"2026-07-05T01:15:04Z"},{"alias_kind":"pith_short_16","alias_value":"PUE6RXCBPVTXD3DZ","created_at":"2026-07-05T01:15:04Z"},{"alias_kind":"pith_short_8","alias_value":"PUE6RXCB","created_at":"2026-07-05T01:15:04Z"}],"graph_snapshots":[{"event_id":"sha256:ae78cca18df10cccf6ed7d706bca3f9014922b9d656e8c2f4c3d46d9dee86f61","target":"graph","created_at":"2026-07-05T01:15:04Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/1605.00897/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Covering problems are classical computational problems concerning whether a certain combinatorial structure 'covers' another. For example, the minimum vertex covering problem aims to find the smallest set of vertices in a graph so that each edge is incident to at least one vertex in that set. Interestingly, the computational complexity of the minimum vertex covering problem in graphs is closely related to the core percolation problem, where the core is a special subgraph obtained by the greedy leaf removal procedure. Here, by generalizing the greedy leaf removal procedure in graphs to hypergra","authors_text":"Bruno Coelho Coutinho, Hai-Jun Zhou, Yang-Yu Liu","cross_cats":["physics.soc-ph"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.dis-nn","submitted_at":"2016-05-03T13:29:30Z","title":"Covering Problems and Core Percolations on Hypergraphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.00897","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:511c7602ef1cc3a9c848bae299548b0565af5579b96d3bc8454fb93b1c9b5414","target":"record","created_at":"2026-07-05T01:15:04Z","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":"09bc366b823b45947d8f3c6fbc323332c1c50ef8e551bdbccd1283c304a47151","cross_cats_sorted":["physics.soc-ph"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.dis-nn","submitted_at":"2016-05-03T13:29:30Z","title_canon_sha256":"e71e2cd8499f51ab2037dc659042cf44ecf47dd5b2c61e7075ab97dddc0eadf1"},"schema_version":"1.0","source":{"id":"1605.00897","kind":"arxiv","version":2}},"canonical_sha256":"7d09e8dc417d6771ec79fbf63474cb985ccb9a582f7104b61dad7bf29526b06f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7d09e8dc417d6771ec79fbf63474cb985ccb9a582f7104b61dad7bf29526b06f","first_computed_at":"2026-07-05T01:15:04.428511Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T01:15:04.428511Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"R/uFZ+u6pGKhe+nBXuA9S0qx2BC5QzpZmSbSBw3FUMLXmusfL3WDx4P1u1ygEDoPYo55ayONRajTg91L4n2rDA==","signature_status":"signed_v1","signed_at":"2026-07-05T01:15:04.428924Z","signed_message":"canonical_sha256_bytes"},"source_id":"1605.00897","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:511c7602ef1cc3a9c848bae299548b0565af5579b96d3bc8454fb93b1c9b5414","sha256:ae78cca18df10cccf6ed7d706bca3f9014922b9d656e8c2f4c3d46d9dee86f61"],"state_sha256":"3390b6276eaf2447e88bc11edc5706e4bd4768bcca600a8f65823eb54e912674"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Q4lx228x/CW+7VjYFTMtqN19Byc4XKDglAWCr/jwnvizH3Aaf7B1GD7e0ez9RUC6t8L/TQzzMhpwLKQOl51dDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-16T18:30:25.330996Z","bundle_sha256":"ce80cadae908f0585536ffe4a12089920ccd2565825265c211103a815899f1e0"}}