{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:DD447ULLTEKL2KUMFMAQSLFA5B","short_pith_number":"pith:DD447ULL","canonical_record":{"source":{"id":"2206.12092","kind":"arxiv","version":6},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2022-06-24T06:05:32Z","cross_cats_sorted":[],"title_canon_sha256":"a06048779bf8ea10f9711e10b27e57093a6fd929b5a123a050aad56a45fa1de4","abstract_canon_sha256":"b2f8655b9607fe18c34f911b14d5cd7f83c46c97e5ce2b47c669ef6934bdcc8f"},"schema_version":"1.0"},"canonical_sha256":"18f9cfd16b9914bd2a8c2b01092ca0e850fe30f333aaefb21bfab4df0eebe7e7","source":{"kind":"arxiv","id":"2206.12092","version":6},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2206.12092","created_at":"2026-05-20T00:04:03Z"},{"alias_kind":"arxiv_version","alias_value":"2206.12092v6","created_at":"2026-05-20T00:04:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2206.12092","created_at":"2026-05-20T00:04:03Z"},{"alias_kind":"pith_short_12","alias_value":"DD447ULLTEKL","created_at":"2026-05-20T00:04:03Z"},{"alias_kind":"pith_short_16","alias_value":"DD447ULLTEKL2KUM","created_at":"2026-05-20T00:04:03Z"},{"alias_kind":"pith_short_8","alias_value":"DD447ULL","created_at":"2026-05-20T00:04:03Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:DD447ULLTEKL2KUMFMAQSLFA5B","target":"record","payload":{"canonical_record":{"source":{"id":"2206.12092","kind":"arxiv","version":6},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2022-06-24T06:05:32Z","cross_cats_sorted":[],"title_canon_sha256":"a06048779bf8ea10f9711e10b27e57093a6fd929b5a123a050aad56a45fa1de4","abstract_canon_sha256":"b2f8655b9607fe18c34f911b14d5cd7f83c46c97e5ce2b47c669ef6934bdcc8f"},"schema_version":"1.0"},"canonical_sha256":"18f9cfd16b9914bd2a8c2b01092ca0e850fe30f333aaefb21bfab4df0eebe7e7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-20T00:04:03.097014Z","signature_b64":"sVXdsFww+DakHaAMcLXR6RkquglXd5acis2I1JyTbgfhbaq2rL5S2MMFQIVHPEM8I3Df/PCd6uJMHTX6+ys8BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"18f9cfd16b9914bd2a8c2b01092ca0e850fe30f333aaefb21bfab4df0eebe7e7","last_reissued_at":"2026-05-20T00:04:03.096188Z","signature_status":"signed_v1","first_computed_at":"2026-05-20T00:04:03.096188Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2206.12092","source_version":6,"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-20T00:04:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dRMZb3fAxLB5tRZIB7SzqR3JVA0kJPiS5SrJTBPoy3AlWkz6O63NZPM6Wer7A6C0burZXd0wMG7buX2XymIIAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T18:09:08.003637Z"},"content_sha256":"bfef920ae7efe52f969b71d49bbef4aa51917048b30bbe408032f0fb32c2d430","schema_version":"1.0","event_id":"sha256:bfef920ae7efe52f969b71d49bbef4aa51917048b30bbe408032f0fb32c2d430"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:DD447ULLTEKL2KUMFMAQSLFA5B","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Steiner Type Packing Problems in Digraphs: A Survey","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Yuefang Sun","submitted_at":"2022-06-24T06:05:32Z","abstract_excerpt":"Graph packing problem is one of the central problems in graph theory and combinatorial optimization. The famous Steiner tree packing problem in undirected graphs has become an well-established area. It is natural to extend this problem to digraphs, and such problems in digraphs are called directed Steiner type packing problems.\n  In this survey we overview known results on several directed Steiner type packing problems. The paper is divided into seven sections: introduction, directed Steiner tree packing problem, directed Steiner path packing problem, directed pendant Steiner tree packing prob"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2206.12092","kind":"arxiv","version":6},"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/2206.12092/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-05-20T00:04:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qvRHgu7Caxo5EWvwsJG7vNNgg5R+1g5d13xBasXgjtqM8hamt1LNIZnnJsNTUu7cqQRyzhQ2wY8AFgT+NKWeBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T18:09:08.004200Z"},"content_sha256":"d1d460b84e207aedf6850712b7d2611a9074dfb19189d7b7425f797621b7d15f","schema_version":"1.0","event_id":"sha256:d1d460b84e207aedf6850712b7d2611a9074dfb19189d7b7425f797621b7d15f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DD447ULLTEKL2KUMFMAQSLFA5B/bundle.json","state_url":"https://pith.science/pith/DD447ULLTEKL2KUMFMAQSLFA5B/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DD447ULLTEKL2KUMFMAQSLFA5B/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-05-26T18:09:08Z","links":{"resolver":"https://pith.science/pith/DD447ULLTEKL2KUMFMAQSLFA5B","bundle":"https://pith.science/pith/DD447ULLTEKL2KUMFMAQSLFA5B/bundle.json","state":"https://pith.science/pith/DD447ULLTEKL2KUMFMAQSLFA5B/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DD447ULLTEKL2KUMFMAQSLFA5B/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:DD447ULLTEKL2KUMFMAQSLFA5B","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":"b2f8655b9607fe18c34f911b14d5cd7f83c46c97e5ce2b47c669ef6934bdcc8f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2022-06-24T06:05:32Z","title_canon_sha256":"a06048779bf8ea10f9711e10b27e57093a6fd929b5a123a050aad56a45fa1de4"},"schema_version":"1.0","source":{"id":"2206.12092","kind":"arxiv","version":6}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2206.12092","created_at":"2026-05-20T00:04:03Z"},{"alias_kind":"arxiv_version","alias_value":"2206.12092v6","created_at":"2026-05-20T00:04:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2206.12092","created_at":"2026-05-20T00:04:03Z"},{"alias_kind":"pith_short_12","alias_value":"DD447ULLTEKL","created_at":"2026-05-20T00:04:03Z"},{"alias_kind":"pith_short_16","alias_value":"DD447ULLTEKL2KUM","created_at":"2026-05-20T00:04:03Z"},{"alias_kind":"pith_short_8","alias_value":"DD447ULL","created_at":"2026-05-20T00:04:03Z"}],"graph_snapshots":[{"event_id":"sha256:d1d460b84e207aedf6850712b7d2611a9074dfb19189d7b7425f797621b7d15f","target":"graph","created_at":"2026-05-20T00:04:03Z","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/2206.12092/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Graph packing problem is one of the central problems in graph theory and combinatorial optimization. The famous Steiner tree packing problem in undirected graphs has become an well-established area. It is natural to extend this problem to digraphs, and such problems in digraphs are called directed Steiner type packing problems.\n  In this survey we overview known results on several directed Steiner type packing problems. The paper is divided into seven sections: introduction, directed Steiner tree packing problem, directed Steiner path packing problem, directed pendant Steiner tree packing prob","authors_text":"Yuefang Sun","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2022-06-24T06:05:32Z","title":"Steiner Type Packing Problems in Digraphs: A Survey"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2206.12092","kind":"arxiv","version":6},"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:bfef920ae7efe52f969b71d49bbef4aa51917048b30bbe408032f0fb32c2d430","target":"record","created_at":"2026-05-20T00:04:03Z","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":"b2f8655b9607fe18c34f911b14d5cd7f83c46c97e5ce2b47c669ef6934bdcc8f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2022-06-24T06:05:32Z","title_canon_sha256":"a06048779bf8ea10f9711e10b27e57093a6fd929b5a123a050aad56a45fa1de4"},"schema_version":"1.0","source":{"id":"2206.12092","kind":"arxiv","version":6}},"canonical_sha256":"18f9cfd16b9914bd2a8c2b01092ca0e850fe30f333aaefb21bfab4df0eebe7e7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"18f9cfd16b9914bd2a8c2b01092ca0e850fe30f333aaefb21bfab4df0eebe7e7","first_computed_at":"2026-05-20T00:04:03.096188Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-20T00:04:03.096188Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"sVXdsFww+DakHaAMcLXR6RkquglXd5acis2I1JyTbgfhbaq2rL5S2MMFQIVHPEM8I3Df/PCd6uJMHTX6+ys8BQ==","signature_status":"signed_v1","signed_at":"2026-05-20T00:04:03.097014Z","signed_message":"canonical_sha256_bytes"},"source_id":"2206.12092","source_kind":"arxiv","source_version":6}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bfef920ae7efe52f969b71d49bbef4aa51917048b30bbe408032f0fb32c2d430","sha256:d1d460b84e207aedf6850712b7d2611a9074dfb19189d7b7425f797621b7d15f"],"state_sha256":"dff72560d4f4afd7ffdabf806e0dad537fc8ef5b5d670189b000fb4889b78637"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oJdbd/e27j9kcExn4jZzbaqJHd/va0uuxqz8i1vMDpX6e4Zj7r2QWD6cFhoJT1m8UdCwgvWIXUrK+58jJIL7CA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T18:09:08.006964Z","bundle_sha256":"d4f70def8dc1f6bc54629666f451a360e2d18c8b4aeb99c5df25f61e27a05792"}}