{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:FW66QTWFI2QKIRRDNVDKD37J4Z","short_pith_number":"pith:FW66QTWF","canonical_record":{"source":{"id":"2509.00383","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DM","submitted_at":"2025-08-30T06:47:52Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"2b4813d25427f5e1cff04a7c0a95d6e478020f72672e1a476e4fb65b32d4cb6f","abstract_canon_sha256":"958978336a9af5f09a13c3c51ad5020254627e145923e30fb51a404765f3a2e5"},"schema_version":"1.0"},"canonical_sha256":"2dbde84ec546a0a446236d46a1efe9e65348a01fbf44f041dc656d4fcc277f7f","source":{"kind":"arxiv","id":"2509.00383","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2509.00383","created_at":"2026-07-05T12:02:15Z"},{"alias_kind":"arxiv_version","alias_value":"2509.00383v1","created_at":"2026-07-05T12:02:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2509.00383","created_at":"2026-07-05T12:02:15Z"},{"alias_kind":"pith_short_12","alias_value":"FW66QTWFI2QK","created_at":"2026-07-05T12:02:15Z"},{"alias_kind":"pith_short_16","alias_value":"FW66QTWFI2QKIRRD","created_at":"2026-07-05T12:02:15Z"},{"alias_kind":"pith_short_8","alias_value":"FW66QTWF","created_at":"2026-07-05T12:02:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:FW66QTWFI2QKIRRDNVDKD37J4Z","target":"record","payload":{"canonical_record":{"source":{"id":"2509.00383","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DM","submitted_at":"2025-08-30T06:47:52Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"2b4813d25427f5e1cff04a7c0a95d6e478020f72672e1a476e4fb65b32d4cb6f","abstract_canon_sha256":"958978336a9af5f09a13c3c51ad5020254627e145923e30fb51a404765f3a2e5"},"schema_version":"1.0"},"canonical_sha256":"2dbde84ec546a0a446236d46a1efe9e65348a01fbf44f041dc656d4fcc277f7f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T12:02:15.149883Z","signature_b64":"N/Zdfolt94Cz+0lKFKpPyTgwKv9npOzgbSmvFGQJ8LJUfpGB5w05f09txcj1En+0l0CnejAq23F4U3YfHCEVBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2dbde84ec546a0a446236d46a1efe9e65348a01fbf44f041dc656d4fcc277f7f","last_reissued_at":"2026-07-05T12:02:15.149405Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T12:02:15.149405Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2509.00383","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-07-05T12:02:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"O+c2XWb8VjDXe6LoUfHNDvHzGJNoGRtyYdYnM7w7OMVVB1KwpimulwuGwPkL1wCnb2AbX6cSNJhxixLveosyAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-12T14:32:50.589972Z"},"content_sha256":"4f38ae0561e734e7f491742cce10e1703a7b742e1cfcdf8dbcfada30385b0cee","schema_version":"1.0","event_id":"sha256:4f38ae0561e734e7f491742cce10e1703a7b742e1cfcdf8dbcfada30385b0cee"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:FW66QTWFI2QKIRRDNVDKD37J4Z","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Distance-based (and path-based) covering problems for graphs of given cyclomatic number","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Anni Hakanen, Dibyayan Chakraborty, Florent Foucaud","submitted_at":"2025-08-30T06:47:52Z","abstract_excerpt":"We study a large family of graph covering problems, whose definitions rely on distances, for graphs of bounded cyclomatic number (that is, the minimum number of edges that need to be removed from the graph to destroy all cycles). These problems include (but are not restricted to) three families of problems: (i) variants of metric dimension, where one wants to choose a small set $S$ of vertices of the graph such that every vertex is uniquely determined by its ordered vector of distances to the vertices of $S$; (ii) variants of geodetic sets, where one wants to select a small set $S$ of vertices"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2509.00383","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2509.00383/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-05T12:02:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sBpd43RBkpX93rOM/Hfopl84TB4l8iAEYhN59PbuKVr5rCcHZvitvpMgObbJL3lbhbkEONRg/jBq6xdxdPVwDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-12T14:32:50.590846Z"},"content_sha256":"7ed73d98ad51bd88df69fc69237fb8d9552e0016ccddb060b33781f4e3d94687","schema_version":"1.0","event_id":"sha256:7ed73d98ad51bd88df69fc69237fb8d9552e0016ccddb060b33781f4e3d94687"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FW66QTWFI2QKIRRDNVDKD37J4Z/bundle.json","state_url":"https://pith.science/pith/FW66QTWFI2QKIRRDNVDKD37J4Z/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FW66QTWFI2QKIRRDNVDKD37J4Z/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-12T14:32:50Z","links":{"resolver":"https://pith.science/pith/FW66QTWFI2QKIRRDNVDKD37J4Z","bundle":"https://pith.science/pith/FW66QTWFI2QKIRRDNVDKD37J4Z/bundle.json","state":"https://pith.science/pith/FW66QTWFI2QKIRRDNVDKD37J4Z/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FW66QTWFI2QKIRRDNVDKD37J4Z/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:FW66QTWFI2QKIRRDNVDKD37J4Z","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":"958978336a9af5f09a13c3c51ad5020254627e145923e30fb51a404765f3a2e5","cross_cats_sorted":["math.CO"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DM","submitted_at":"2025-08-30T06:47:52Z","title_canon_sha256":"2b4813d25427f5e1cff04a7c0a95d6e478020f72672e1a476e4fb65b32d4cb6f"},"schema_version":"1.0","source":{"id":"2509.00383","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2509.00383","created_at":"2026-07-05T12:02:15Z"},{"alias_kind":"arxiv_version","alias_value":"2509.00383v1","created_at":"2026-07-05T12:02:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2509.00383","created_at":"2026-07-05T12:02:15Z"},{"alias_kind":"pith_short_12","alias_value":"FW66QTWFI2QK","created_at":"2026-07-05T12:02:15Z"},{"alias_kind":"pith_short_16","alias_value":"FW66QTWFI2QKIRRD","created_at":"2026-07-05T12:02:15Z"},{"alias_kind":"pith_short_8","alias_value":"FW66QTWF","created_at":"2026-07-05T12:02:15Z"}],"graph_snapshots":[{"event_id":"sha256:7ed73d98ad51bd88df69fc69237fb8d9552e0016ccddb060b33781f4e3d94687","target":"graph","created_at":"2026-07-05T12:02:15Z","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/2509.00383/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We study a large family of graph covering problems, whose definitions rely on distances, for graphs of bounded cyclomatic number (that is, the minimum number of edges that need to be removed from the graph to destroy all cycles). These problems include (but are not restricted to) three families of problems: (i) variants of metric dimension, where one wants to choose a small set $S$ of vertices of the graph such that every vertex is uniquely determined by its ordered vector of distances to the vertices of $S$; (ii) variants of geodetic sets, where one wants to select a small set $S$ of vertices","authors_text":"Anni Hakanen, Dibyayan Chakraborty, Florent Foucaud","cross_cats":["math.CO"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DM","submitted_at":"2025-08-30T06:47:52Z","title":"Distance-based (and path-based) covering problems for graphs of given cyclomatic number"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2509.00383","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:4f38ae0561e734e7f491742cce10e1703a7b742e1cfcdf8dbcfada30385b0cee","target":"record","created_at":"2026-07-05T12:02:15Z","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":"958978336a9af5f09a13c3c51ad5020254627e145923e30fb51a404765f3a2e5","cross_cats_sorted":["math.CO"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DM","submitted_at":"2025-08-30T06:47:52Z","title_canon_sha256":"2b4813d25427f5e1cff04a7c0a95d6e478020f72672e1a476e4fb65b32d4cb6f"},"schema_version":"1.0","source":{"id":"2509.00383","kind":"arxiv","version":1}},"canonical_sha256":"2dbde84ec546a0a446236d46a1efe9e65348a01fbf44f041dc656d4fcc277f7f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2dbde84ec546a0a446236d46a1efe9e65348a01fbf44f041dc656d4fcc277f7f","first_computed_at":"2026-07-05T12:02:15.149405Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T12:02:15.149405Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"N/Zdfolt94Cz+0lKFKpPyTgwKv9npOzgbSmvFGQJ8LJUfpGB5w05f09txcj1En+0l0CnejAq23F4U3YfHCEVBw==","signature_status":"signed_v1","signed_at":"2026-07-05T12:02:15.149883Z","signed_message":"canonical_sha256_bytes"},"source_id":"2509.00383","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4f38ae0561e734e7f491742cce10e1703a7b742e1cfcdf8dbcfada30385b0cee","sha256:7ed73d98ad51bd88df69fc69237fb8d9552e0016ccddb060b33781f4e3d94687"],"state_sha256":"d1f40f9b792c1e6d37933cbba5dad94052677f5fa78e6c663acd9a827fa47e11"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NoikufC+v4bAe1Q7vMN5bX0NWjN0341ewM5X9jbhJB7n3EuOQ7GYr+eB7+sAhtuHQi2dUEwEWG+/5agDi2vQDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-12T14:32:50.596506Z","bundle_sha256":"35cbe5881622b5e1d9c542e54ef44df564b608706d77629cd6a7662cc1f4049f"}}