{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:3N4WQCTBLSJAI5OERMOHVWUHBD","short_pith_number":"pith:3N4WQCTB","canonical_record":{"source":{"id":"1807.10613","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-07-25T10:35:34Z","cross_cats_sorted":["math.HO"],"title_canon_sha256":"df4c66f8b917db449139cf9b6bf9f0e5df43a2513ae531b7d1438bd818caba1c","abstract_canon_sha256":"a54cf9f134df1638affee2f505fefffd6d280fa6f554509df58b14fd9c8e820d"},"schema_version":"1.0"},"canonical_sha256":"db79680a615c920475c48b1c7ada8708f700e47a430568d4adfb539aec5b1ec5","source":{"kind":"arxiv","id":"1807.10613","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1807.10613","created_at":"2026-05-18T00:09:40Z"},{"alias_kind":"arxiv_version","alias_value":"1807.10613v1","created_at":"2026-05-18T00:09:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.10613","created_at":"2026-05-18T00:09:40Z"},{"alias_kind":"pith_short_12","alias_value":"3N4WQCTBLSJA","created_at":"2026-05-18T12:32:02Z"},{"alias_kind":"pith_short_16","alias_value":"3N4WQCTBLSJAI5OE","created_at":"2026-05-18T12:32:02Z"},{"alias_kind":"pith_short_8","alias_value":"3N4WQCTB","created_at":"2026-05-18T12:32:02Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:3N4WQCTBLSJAI5OERMOHVWUHBD","target":"record","payload":{"canonical_record":{"source":{"id":"1807.10613","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-07-25T10:35:34Z","cross_cats_sorted":["math.HO"],"title_canon_sha256":"df4c66f8b917db449139cf9b6bf9f0e5df43a2513ae531b7d1438bd818caba1c","abstract_canon_sha256":"a54cf9f134df1638affee2f505fefffd6d280fa6f554509df58b14fd9c8e820d"},"schema_version":"1.0"},"canonical_sha256":"db79680a615c920475c48b1c7ada8708f700e47a430568d4adfb539aec5b1ec5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:09:40.019915Z","signature_b64":"FeJykK99fJg3E2Fhndehgj4F7zXBB2LKW/sQhrClrOWuFXpaizaNj/g5wkh5QHq3M906zeFJU/OEZzdPEh6aCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"db79680a615c920475c48b1c7ada8708f700e47a430568d4adfb539aec5b1ec5","last_reissued_at":"2026-05-18T00:09:40.019161Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:09:40.019161Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1807.10613","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:09:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"a42fs7Xao5mtugA6aY6aPmi7aKa1c0YYrLLk0pldgehPH9IY9znDzfmMAwfpDEHpVArZZQ1zypnV+NNkCjyEBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T04:58:47.529247Z"},"content_sha256":"708f557b70c0f57d948d5f63fb0ab0ef94302a7c1865139dc259fd89d75e493f","schema_version":"1.0","event_id":"sha256:708f557b70c0f57d948d5f63fb0ab0ef94302a7c1865139dc259fd89d75e493f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:3N4WQCTBLSJAI5OERMOHVWUHBD","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Revisiting path-type covering and partitioning problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.HO"],"primary_cat":"math.CO","authors_text":"Paul Manuel","submitted_at":"2018-07-25T10:35:34Z","abstract_excerpt":"Covering problems belong to the foundation of graph theory. There are several types of covering problems in graph theory such as covering the vertex set by stars (domination problem), covering the vertex set by cliques (clique covering problem), covering the vertex set by independent sets (coloring problem), and covering the vertex set by paths or cycles. A similar concept which is partitioning problem is also equally important. Lately research in graph theory has produced unprecedented growth because of its various application in engineering and science. The covering and partitioning problem "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.10613","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:09:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YpEmpUcDfg37FpKVIOeEYyfnbp7pq5iwLUsBglxgAcmvt2pBNmxi3hgkZiuxhiCYy7/xX3/YhkNmrs0Q3jfHBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T04:58:47.529800Z"},"content_sha256":"54703f26f7e58a75e22ee791a5da68a2f3e5116032d4b8c216ea471ff1bfbd87","schema_version":"1.0","event_id":"sha256:54703f26f7e58a75e22ee791a5da68a2f3e5116032d4b8c216ea471ff1bfbd87"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3N4WQCTBLSJAI5OERMOHVWUHBD/bundle.json","state_url":"https://pith.science/pith/3N4WQCTBLSJAI5OERMOHVWUHBD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3N4WQCTBLSJAI5OERMOHVWUHBD/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-24T04:58:47Z","links":{"resolver":"https://pith.science/pith/3N4WQCTBLSJAI5OERMOHVWUHBD","bundle":"https://pith.science/pith/3N4WQCTBLSJAI5OERMOHVWUHBD/bundle.json","state":"https://pith.science/pith/3N4WQCTBLSJAI5OERMOHVWUHBD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3N4WQCTBLSJAI5OERMOHVWUHBD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:3N4WQCTBLSJAI5OERMOHVWUHBD","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":"a54cf9f134df1638affee2f505fefffd6d280fa6f554509df58b14fd9c8e820d","cross_cats_sorted":["math.HO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-07-25T10:35:34Z","title_canon_sha256":"df4c66f8b917db449139cf9b6bf9f0e5df43a2513ae531b7d1438bd818caba1c"},"schema_version":"1.0","source":{"id":"1807.10613","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1807.10613","created_at":"2026-05-18T00:09:40Z"},{"alias_kind":"arxiv_version","alias_value":"1807.10613v1","created_at":"2026-05-18T00:09:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.10613","created_at":"2026-05-18T00:09:40Z"},{"alias_kind":"pith_short_12","alias_value":"3N4WQCTBLSJA","created_at":"2026-05-18T12:32:02Z"},{"alias_kind":"pith_short_16","alias_value":"3N4WQCTBLSJAI5OE","created_at":"2026-05-18T12:32:02Z"},{"alias_kind":"pith_short_8","alias_value":"3N4WQCTB","created_at":"2026-05-18T12:32:02Z"}],"graph_snapshots":[{"event_id":"sha256:54703f26f7e58a75e22ee791a5da68a2f3e5116032d4b8c216ea471ff1bfbd87","target":"graph","created_at":"2026-05-18T00:09:40Z","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":"Covering problems belong to the foundation of graph theory. There are several types of covering problems in graph theory such as covering the vertex set by stars (domination problem), covering the vertex set by cliques (clique covering problem), covering the vertex set by independent sets (coloring problem), and covering the vertex set by paths or cycles. A similar concept which is partitioning problem is also equally important. Lately research in graph theory has produced unprecedented growth because of its various application in engineering and science. The covering and partitioning problem ","authors_text":"Paul Manuel","cross_cats":["math.HO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-07-25T10:35:34Z","title":"Revisiting path-type covering and partitioning problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.10613","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:708f557b70c0f57d948d5f63fb0ab0ef94302a7c1865139dc259fd89d75e493f","target":"record","created_at":"2026-05-18T00:09:40Z","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":"a54cf9f134df1638affee2f505fefffd6d280fa6f554509df58b14fd9c8e820d","cross_cats_sorted":["math.HO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-07-25T10:35:34Z","title_canon_sha256":"df4c66f8b917db449139cf9b6bf9f0e5df43a2513ae531b7d1438bd818caba1c"},"schema_version":"1.0","source":{"id":"1807.10613","kind":"arxiv","version":1}},"canonical_sha256":"db79680a615c920475c48b1c7ada8708f700e47a430568d4adfb539aec5b1ec5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"db79680a615c920475c48b1c7ada8708f700e47a430568d4adfb539aec5b1ec5","first_computed_at":"2026-05-18T00:09:40.019161Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:09:40.019161Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"FeJykK99fJg3E2Fhndehgj4F7zXBB2LKW/sQhrClrOWuFXpaizaNj/g5wkh5QHq3M906zeFJU/OEZzdPEh6aCg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:09:40.019915Z","signed_message":"canonical_sha256_bytes"},"source_id":"1807.10613","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:708f557b70c0f57d948d5f63fb0ab0ef94302a7c1865139dc259fd89d75e493f","sha256:54703f26f7e58a75e22ee791a5da68a2f3e5116032d4b8c216ea471ff1bfbd87"],"state_sha256":"e5021a9108e08948f97d9dfcc5a390ce0243195f2596ff092c941f7e685f9b8b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bjzrA228iii0QpNZ8VKibQzCLKLB8cm8ipbB3L/nQfkipvdzA+EYVf8Hzr7fYxYc2y99uCIaaod6qT8zJVGGBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-24T04:58:47.532817Z","bundle_sha256":"66ad68129e41a273096ad252b1b6e5838637e1eb79f8d9b54220d761df1f0204"}}