{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:BZG2H43PQSKUQ6IJUOO4UUBH6E","short_pith_number":"pith:BZG2H43P","canonical_record":{"source":{"id":"2411.03871","kind":"arxiv","version":4},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2024-11-06T12:35:47Z","cross_cats_sorted":["math.OC","q-bio.GN"],"title_canon_sha256":"6351b2b1cb12e5d2b2b6f606557d057fb1e42e0bc22cf9bd10981535d03fa760","abstract_canon_sha256":"57b01cb803cd0e3524b4028b45ab59df7236516e8159d2dea6bc77edefd978cc"},"schema_version":"1.0"},"canonical_sha256":"0e4da3f36f8495487909a39dca5027f105bddd41d2709eb33b037099fe0c9fa7","source":{"kind":"arxiv","id":"2411.03871","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2411.03871","created_at":"2026-07-05T12:04:29Z"},{"alias_kind":"arxiv_version","alias_value":"2411.03871v4","created_at":"2026-07-05T12:04:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.03871","created_at":"2026-07-05T12:04:29Z"},{"alias_kind":"pith_short_12","alias_value":"BZG2H43PQSKU","created_at":"2026-07-05T12:04:29Z"},{"alias_kind":"pith_short_16","alias_value":"BZG2H43PQSKUQ6IJ","created_at":"2026-07-05T12:04:29Z"},{"alias_kind":"pith_short_8","alias_value":"BZG2H43P","created_at":"2026-07-05T12:04:29Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:BZG2H43PQSKUQ6IJUOO4UUBH6E","target":"record","payload":{"canonical_record":{"source":{"id":"2411.03871","kind":"arxiv","version":4},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2024-11-06T12:35:47Z","cross_cats_sorted":["math.OC","q-bio.GN"],"title_canon_sha256":"6351b2b1cb12e5d2b2b6f606557d057fb1e42e0bc22cf9bd10981535d03fa760","abstract_canon_sha256":"57b01cb803cd0e3524b4028b45ab59df7236516e8159d2dea6bc77edefd978cc"},"schema_version":"1.0"},"canonical_sha256":"0e4da3f36f8495487909a39dca5027f105bddd41d2709eb33b037099fe0c9fa7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T12:04:29.057837Z","signature_b64":"a71fCW2C6zU4a+EpjunfqBow53f/SvYDdekpnaE3IzewUCBUTrlhBrwhopYg4q/0+21tyHduaV/yXKnnSBfiAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0e4da3f36f8495487909a39dca5027f105bddd41d2709eb33b037099fe0c9fa7","last_reissued_at":"2026-07-05T12:04:29.057325Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T12:04:29.057325Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2411.03871","source_version":4,"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:04:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FS4hSWXvRCG3vEyC6pkq2p3LsZe8VJbfYTJLD7pcYCBoEdo/MsZw56cnPDN1dkRCSc+zqVYhuWUcXA0RtpqeAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-17T19:17:16.938377Z"},"content_sha256":"6be848c51f585063416018b78b0fe9d19218f84d98f53dcfc092d137c3c6bb21","schema_version":"1.0","event_id":"sha256:6be848c51f585063416018b78b0fe9d19218f84d98f53dcfc092d137c3c6bb21"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:BZG2H43PQSKUQ6IJUOO4UUBH6E","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Safe Sequences via Dominators in DAGs for Path-Covering Problems","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.OC","q-bio.GN"],"primary_cat":"cs.DS","authors_text":"Alexandru I. Tomescu, Francisco Sena, Romeo Rizzi","submitted_at":"2024-11-06T12:35:47Z","abstract_excerpt":"A path-covering problem on a directed acyclic graph (DAG) requires finding a set of source-to-sink paths that cover all the nodes, all the arcs, or subsets thereof, and additionally they are optimal with respect to some function. In this paper we study safe sequences of nodes or arcs, namely sequences that appear in some path of every path cover of a DAG.\n  We show that safe sequences admit a simple characterization via cutnodes. Moreover, we establish a connection between maximal safe sequences and leaf-to-root paths in the source- and sink-dominator trees of the DAG, which may be of independ"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2411.03871","kind":"arxiv","version":4},"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/2411.03871/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:04:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PnkZNQk0GUKFMV2+yYYwfAyjn5EaWdBTytka4eiw4nEcNsC7Iourfi9DmqEDQ2s7j7l6MwtNQf2HrMPAWXuWDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-17T19:17:16.939193Z"},"content_sha256":"5ddb23c9891a21771fa476a13c49cf7a4d9b1777bd1701ff0c633cef92057b5c","schema_version":"1.0","event_id":"sha256:5ddb23c9891a21771fa476a13c49cf7a4d9b1777bd1701ff0c633cef92057b5c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BZG2H43PQSKUQ6IJUOO4UUBH6E/bundle.json","state_url":"https://pith.science/pith/BZG2H43PQSKUQ6IJUOO4UUBH6E/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BZG2H43PQSKUQ6IJUOO4UUBH6E/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-17T19:17:16Z","links":{"resolver":"https://pith.science/pith/BZG2H43PQSKUQ6IJUOO4UUBH6E","bundle":"https://pith.science/pith/BZG2H43PQSKUQ6IJUOO4UUBH6E/bundle.json","state":"https://pith.science/pith/BZG2H43PQSKUQ6IJUOO4UUBH6E/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BZG2H43PQSKUQ6IJUOO4UUBH6E/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:BZG2H43PQSKUQ6IJUOO4UUBH6E","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":"57b01cb803cd0e3524b4028b45ab59df7236516e8159d2dea6bc77edefd978cc","cross_cats_sorted":["math.OC","q-bio.GN"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2024-11-06T12:35:47Z","title_canon_sha256":"6351b2b1cb12e5d2b2b6f606557d057fb1e42e0bc22cf9bd10981535d03fa760"},"schema_version":"1.0","source":{"id":"2411.03871","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2411.03871","created_at":"2026-07-05T12:04:29Z"},{"alias_kind":"arxiv_version","alias_value":"2411.03871v4","created_at":"2026-07-05T12:04:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.03871","created_at":"2026-07-05T12:04:29Z"},{"alias_kind":"pith_short_12","alias_value":"BZG2H43PQSKU","created_at":"2026-07-05T12:04:29Z"},{"alias_kind":"pith_short_16","alias_value":"BZG2H43PQSKUQ6IJ","created_at":"2026-07-05T12:04:29Z"},{"alias_kind":"pith_short_8","alias_value":"BZG2H43P","created_at":"2026-07-05T12:04:29Z"}],"graph_snapshots":[{"event_id":"sha256:5ddb23c9891a21771fa476a13c49cf7a4d9b1777bd1701ff0c633cef92057b5c","target":"graph","created_at":"2026-07-05T12:04:29Z","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/2411.03871/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"A path-covering problem on a directed acyclic graph (DAG) requires finding a set of source-to-sink paths that cover all the nodes, all the arcs, or subsets thereof, and additionally they are optimal with respect to some function. In this paper we study safe sequences of nodes or arcs, namely sequences that appear in some path of every path cover of a DAG.\n  We show that safe sequences admit a simple characterization via cutnodes. Moreover, we establish a connection between maximal safe sequences and leaf-to-root paths in the source- and sink-dominator trees of the DAG, which may be of independ","authors_text":"Alexandru I. Tomescu, Francisco Sena, Romeo Rizzi","cross_cats":["math.OC","q-bio.GN"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2024-11-06T12:35:47Z","title":"Safe Sequences via Dominators in DAGs for Path-Covering Problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2411.03871","kind":"arxiv","version":4},"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:6be848c51f585063416018b78b0fe9d19218f84d98f53dcfc092d137c3c6bb21","target":"record","created_at":"2026-07-05T12:04:29Z","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":"57b01cb803cd0e3524b4028b45ab59df7236516e8159d2dea6bc77edefd978cc","cross_cats_sorted":["math.OC","q-bio.GN"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2024-11-06T12:35:47Z","title_canon_sha256":"6351b2b1cb12e5d2b2b6f606557d057fb1e42e0bc22cf9bd10981535d03fa760"},"schema_version":"1.0","source":{"id":"2411.03871","kind":"arxiv","version":4}},"canonical_sha256":"0e4da3f36f8495487909a39dca5027f105bddd41d2709eb33b037099fe0c9fa7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0e4da3f36f8495487909a39dca5027f105bddd41d2709eb33b037099fe0c9fa7","first_computed_at":"2026-07-05T12:04:29.057325Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T12:04:29.057325Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"a71fCW2C6zU4a+EpjunfqBow53f/SvYDdekpnaE3IzewUCBUTrlhBrwhopYg4q/0+21tyHduaV/yXKnnSBfiAg==","signature_status":"signed_v1","signed_at":"2026-07-05T12:04:29.057837Z","signed_message":"canonical_sha256_bytes"},"source_id":"2411.03871","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6be848c51f585063416018b78b0fe9d19218f84d98f53dcfc092d137c3c6bb21","sha256:5ddb23c9891a21771fa476a13c49cf7a4d9b1777bd1701ff0c633cef92057b5c"],"state_sha256":"e4c23786a7d25297fd09a97755373629e2261e9ea38851b832c55889ef48744e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QOiU01W5H1XmXSzYaZRBiCvlt83DwenSamy64DUJFhtmoJMV7D/sBnp7uFETJJS80hNlzqsVzSktHlk1QYFNAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-17T19:17:16.946654Z","bundle_sha256":"6f68983622c2aa034b5cf72a8696810b01c87f96cb58e69e14c3412582218f40"}}