{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:KAG4Y7LPMQZQZ2JPG3IVOJBCVS","short_pith_number":"pith:KAG4Y7LP","canonical_record":{"source":{"id":"1707.01701","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2017-07-06T09:28:47Z","cross_cats_sorted":[],"title_canon_sha256":"f5857374a694138fa6f5fcf8704b66e38d03af86f69bfa1eca630fab6f4bea2b","abstract_canon_sha256":"a09fa441b38c34489b53d51d6423066c6d108e08a13979f2f33ea5c425825dbb"},"schema_version":"1.0"},"canonical_sha256":"500dcc7d6f64330ce92f36d1572422acb5ab122793d7f70d757932162e454f67","source":{"kind":"arxiv","id":"1707.01701","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.01701","created_at":"2026-05-18T00:40:45Z"},{"alias_kind":"arxiv_version","alias_value":"1707.01701v2","created_at":"2026-05-18T00:40:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.01701","created_at":"2026-05-18T00:40:45Z"},{"alias_kind":"pith_short_12","alias_value":"KAG4Y7LPMQZQ","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_16","alias_value":"KAG4Y7LPMQZQZ2JP","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_8","alias_value":"KAG4Y7LP","created_at":"2026-05-18T12:31:24Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:KAG4Y7LPMQZQZ2JPG3IVOJBCVS","target":"record","payload":{"canonical_record":{"source":{"id":"1707.01701","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2017-07-06T09:28:47Z","cross_cats_sorted":[],"title_canon_sha256":"f5857374a694138fa6f5fcf8704b66e38d03af86f69bfa1eca630fab6f4bea2b","abstract_canon_sha256":"a09fa441b38c34489b53d51d6423066c6d108e08a13979f2f33ea5c425825dbb"},"schema_version":"1.0"},"canonical_sha256":"500dcc7d6f64330ce92f36d1572422acb5ab122793d7f70d757932162e454f67","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:40:45.910513Z","signature_b64":"YYnIJESKuI8Kz1TAbK4VSa4zJ+3pBdKRn4Q6LY6Xz28iTcfXI1ehzd9lnUs213kzhEqyEkJY3r7Dq4KESSQYBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"500dcc7d6f64330ce92f36d1572422acb5ab122793d7f70d757932162e454f67","last_reissued_at":"2026-05-18T00:40:45.909856Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:40:45.909856Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1707.01701","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-05-18T00:40:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1oTBzDw7iuJ11uyDYQ3lqOoTxA/mUM5ZpGTyX7WpnpMZfsfcDP3I52cmcP8KchKy90RmiGivZRlBeWKFYsKNDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T07:40:29.905390Z"},"content_sha256":"23e3a3bdadac5d0add4da0f932389c46ec0bf02930b58f89bb5ac7b6d7873205","schema_version":"1.0","event_id":"sha256:23e3a3bdadac5d0add4da0f932389c46ec0bf02930b58f89bb5ac7b6d7873205"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:KAG4Y7LPMQZQZ2JPG3IVOJBCVS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Algorithmic Properties of Sparse Digraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Patrice Ossona de Mendez, Roman Rabinovich, Sebastian Siebertz, Stephan Kreutzer","submitted_at":"2017-07-06T09:28:47Z","abstract_excerpt":"The notions of bounded expansion and nowhere denseness have been applied very successfully in algorithmic graph theory. We study the corresponding notions of directed bounded expansion and nowhere crownfulness on directed graphs. We show that many of the algorithmic tools that were developed for undirected bounded expansion classes can, with some care, also be applied in their directed counterparts, and thereby we highlight a rich algorithmic structure theory of directed bounded expansion classes.\n  More specifically, we show that the directed Steiner tree problem is fixed-parameter tractable "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.01701","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":""},"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:40:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ihIWSNkMTscHJ5WvBrIb6auDIiaIimjY5l+UDn//d10W4RO9lgHI8vkSR1OZGXx8a/SSM1LPK7isBDmz171HDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T07:40:29.906085Z"},"content_sha256":"66de56fcceb637a4f364ec6beac9ab3e9249c42619408b53741f1bbb2a7817fa","schema_version":"1.0","event_id":"sha256:66de56fcceb637a4f364ec6beac9ab3e9249c42619408b53741f1bbb2a7817fa"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KAG4Y7LPMQZQZ2JPG3IVOJBCVS/bundle.json","state_url":"https://pith.science/pith/KAG4Y7LPMQZQZ2JPG3IVOJBCVS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KAG4Y7LPMQZQZ2JPG3IVOJBCVS/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-05T07:40:29Z","links":{"resolver":"https://pith.science/pith/KAG4Y7LPMQZQZ2JPG3IVOJBCVS","bundle":"https://pith.science/pith/KAG4Y7LPMQZQZ2JPG3IVOJBCVS/bundle.json","state":"https://pith.science/pith/KAG4Y7LPMQZQZ2JPG3IVOJBCVS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KAG4Y7LPMQZQZ2JPG3IVOJBCVS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:KAG4Y7LPMQZQZ2JPG3IVOJBCVS","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":"a09fa441b38c34489b53d51d6423066c6d108e08a13979f2f33ea5c425825dbb","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2017-07-06T09:28:47Z","title_canon_sha256":"f5857374a694138fa6f5fcf8704b66e38d03af86f69bfa1eca630fab6f4bea2b"},"schema_version":"1.0","source":{"id":"1707.01701","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.01701","created_at":"2026-05-18T00:40:45Z"},{"alias_kind":"arxiv_version","alias_value":"1707.01701v2","created_at":"2026-05-18T00:40:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.01701","created_at":"2026-05-18T00:40:45Z"},{"alias_kind":"pith_short_12","alias_value":"KAG4Y7LPMQZQ","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_16","alias_value":"KAG4Y7LPMQZQZ2JP","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_8","alias_value":"KAG4Y7LP","created_at":"2026-05-18T12:31:24Z"}],"graph_snapshots":[{"event_id":"sha256:66de56fcceb637a4f364ec6beac9ab3e9249c42619408b53741f1bbb2a7817fa","target":"graph","created_at":"2026-05-18T00:40:45Z","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":"The notions of bounded expansion and nowhere denseness have been applied very successfully in algorithmic graph theory. We study the corresponding notions of directed bounded expansion and nowhere crownfulness on directed graphs. We show that many of the algorithmic tools that were developed for undirected bounded expansion classes can, with some care, also be applied in their directed counterparts, and thereby we highlight a rich algorithmic structure theory of directed bounded expansion classes.\n  More specifically, we show that the directed Steiner tree problem is fixed-parameter tractable ","authors_text":"Patrice Ossona de Mendez, Roman Rabinovich, Sebastian Siebertz, Stephan Kreutzer","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2017-07-06T09:28:47Z","title":"Algorithmic Properties of Sparse Digraphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.01701","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:23e3a3bdadac5d0add4da0f932389c46ec0bf02930b58f89bb5ac7b6d7873205","target":"record","created_at":"2026-05-18T00:40:45Z","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":"a09fa441b38c34489b53d51d6423066c6d108e08a13979f2f33ea5c425825dbb","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2017-07-06T09:28:47Z","title_canon_sha256":"f5857374a694138fa6f5fcf8704b66e38d03af86f69bfa1eca630fab6f4bea2b"},"schema_version":"1.0","source":{"id":"1707.01701","kind":"arxiv","version":2}},"canonical_sha256":"500dcc7d6f64330ce92f36d1572422acb5ab122793d7f70d757932162e454f67","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"500dcc7d6f64330ce92f36d1572422acb5ab122793d7f70d757932162e454f67","first_computed_at":"2026-05-18T00:40:45.909856Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:40:45.909856Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"YYnIJESKuI8Kz1TAbK4VSa4zJ+3pBdKRn4Q6LY6Xz28iTcfXI1ehzd9lnUs213kzhEqyEkJY3r7Dq4KESSQYBg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:40:45.910513Z","signed_message":"canonical_sha256_bytes"},"source_id":"1707.01701","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:23e3a3bdadac5d0add4da0f932389c46ec0bf02930b58f89bb5ac7b6d7873205","sha256:66de56fcceb637a4f364ec6beac9ab3e9249c42619408b53741f1bbb2a7817fa"],"state_sha256":"cb40f89bdbe4a78399385e2ecabf7c5b0826eab2b6a072dd81b29c5f3a90fb45"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KkvHfO2+HeTxuoXZiLXhHWtzEbZx2S0EweTLmuTMaCdwzoZpcmtoU/CVwcNv6Jr6r7OAjr1tKmk1tOfwNLWAAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T07:40:29.910007Z","bundle_sha256":"21a193ff8c9fea5cd7a6a228182305f13f71948d8b6955ece1b104ede7bab438"}}