{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:ZYFTQZDU5X22OHI5MUA65RAYDF","short_pith_number":"pith:ZYFTQZDU","canonical_record":{"source":{"id":"1605.09589","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-05-31T12:02:36Z","cross_cats_sorted":[],"title_canon_sha256":"ead8e061101994bb9be3d62eeea5e2440ba24a3af4b69d48b730bfb44da6e1cb","abstract_canon_sha256":"c8225f9e3a907a27d3a46015cc5e36c439fd13e0cc415cd44b8d9b1366ba52bc"},"schema_version":"1.0"},"canonical_sha256":"ce0b386474edf5a71d1d6501eec41819695f9483ff9a2036e725bc21fb625d04","source":{"kind":"arxiv","id":"1605.09589","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.09589","created_at":"2026-05-18T01:13:10Z"},{"alias_kind":"arxiv_version","alias_value":"1605.09589v1","created_at":"2026-05-18T01:13:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.09589","created_at":"2026-05-18T01:13:10Z"},{"alias_kind":"pith_short_12","alias_value":"ZYFTQZDU5X22","created_at":"2026-05-18T12:30:55Z"},{"alias_kind":"pith_short_16","alias_value":"ZYFTQZDU5X22OHI5","created_at":"2026-05-18T12:30:55Z"},{"alias_kind":"pith_short_8","alias_value":"ZYFTQZDU","created_at":"2026-05-18T12:30:55Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:ZYFTQZDU5X22OHI5MUA65RAYDF","target":"record","payload":{"canonical_record":{"source":{"id":"1605.09589","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-05-31T12:02:36Z","cross_cats_sorted":[],"title_canon_sha256":"ead8e061101994bb9be3d62eeea5e2440ba24a3af4b69d48b730bfb44da6e1cb","abstract_canon_sha256":"c8225f9e3a907a27d3a46015cc5e36c439fd13e0cc415cd44b8d9b1366ba52bc"},"schema_version":"1.0"},"canonical_sha256":"ce0b386474edf5a71d1d6501eec41819695f9483ff9a2036e725bc21fb625d04","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:13:10.534270Z","signature_b64":"0WMF7P9uQjvtsvSC8LlWjlJOK8zOlB1UhEF1hZ2G0Dfjwt8vDp9+mKK/UMRNVU4rwNKvPBrnRTmwmK+vIapKDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ce0b386474edf5a71d1d6501eec41819695f9483ff9a2036e725bc21fb625d04","last_reissued_at":"2026-05-18T01:13:10.533890Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:13:10.533890Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1605.09589","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-18T01:13:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SXyu7Rurr8i7JRD2L6P+ikeM+SBsbYoPlJaM+VIYXgjuHvXRg2EefO3flA73Qdn9DxtVUvvLRO1QKOlUYrzUDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T05:46:35.880434Z"},"content_sha256":"553db072bf531640cd55fa403d8e477314a14a907f002d275312a2f38c01f43e","schema_version":"1.0","event_id":"sha256:553db072bf531640cd55fa403d8e477314a14a907f002d275312a2f38c01f43e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:ZYFTQZDU5X22OHI5MUA65RAYDF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A dichotomy for the kernel by $H$-walks problem in digraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"C\\'esar Hern\\'andez-Cruz, Hortensia Galeana-S\\'anchez","submitted_at":"2016-05-31T12:02:36Z","abstract_excerpt":"Let $H = (V_H, A_H)$ be a digraph which may contain loops, and let $D = (V_D, A_D)$ be a loopless digraph with a coloring of its arcs $c: A_D \\to V_H$. An $H$-walk of $D$ is a walk $(v_0, \\dots, v_n)$ of $D$ such that $(c(v_{i-1}, v_i), c(v_i, v_{i+1}))$ is an arc of $H$, for every $1 \\le i \\le n-1$. For $u, v \\in V_D$, we say that $u$ reaches $v$ by $H$-walks if there exists an $H$-walk from $u$ to $v$ in $D$. A subset $S \\subseteq V_D$ is a kernel by $H$-walks of $D$ if every vertex in $V_D \\setminus S$ reaches by $H$-walks some vertex in $S$, and no vertex in $S$ can reach another vertex in"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.09589","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-18T01:13:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qsx7T++peilqwjQ+nRnh63GNYXlVii689oHj/8moOv8p/KsgHCm9zTDqSJ/T0wRry8wstDLPCvSxwWSGwsIiBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T05:46:35.880783Z"},"content_sha256":"cc0a565b74428401c638a5011442b92d5dd3a670e71ae420b29f289fcbc07f7a","schema_version":"1.0","event_id":"sha256:cc0a565b74428401c638a5011442b92d5dd3a670e71ae420b29f289fcbc07f7a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZYFTQZDU5X22OHI5MUA65RAYDF/bundle.json","state_url":"https://pith.science/pith/ZYFTQZDU5X22OHI5MUA65RAYDF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZYFTQZDU5X22OHI5MUA65RAYDF/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-28T05:46:35Z","links":{"resolver":"https://pith.science/pith/ZYFTQZDU5X22OHI5MUA65RAYDF","bundle":"https://pith.science/pith/ZYFTQZDU5X22OHI5MUA65RAYDF/bundle.json","state":"https://pith.science/pith/ZYFTQZDU5X22OHI5MUA65RAYDF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZYFTQZDU5X22OHI5MUA65RAYDF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:ZYFTQZDU5X22OHI5MUA65RAYDF","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":"c8225f9e3a907a27d3a46015cc5e36c439fd13e0cc415cd44b8d9b1366ba52bc","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-05-31T12:02:36Z","title_canon_sha256":"ead8e061101994bb9be3d62eeea5e2440ba24a3af4b69d48b730bfb44da6e1cb"},"schema_version":"1.0","source":{"id":"1605.09589","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.09589","created_at":"2026-05-18T01:13:10Z"},{"alias_kind":"arxiv_version","alias_value":"1605.09589v1","created_at":"2026-05-18T01:13:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.09589","created_at":"2026-05-18T01:13:10Z"},{"alias_kind":"pith_short_12","alias_value":"ZYFTQZDU5X22","created_at":"2026-05-18T12:30:55Z"},{"alias_kind":"pith_short_16","alias_value":"ZYFTQZDU5X22OHI5","created_at":"2026-05-18T12:30:55Z"},{"alias_kind":"pith_short_8","alias_value":"ZYFTQZDU","created_at":"2026-05-18T12:30:55Z"}],"graph_snapshots":[{"event_id":"sha256:cc0a565b74428401c638a5011442b92d5dd3a670e71ae420b29f289fcbc07f7a","target":"graph","created_at":"2026-05-18T01:13:10Z","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":"Let $H = (V_H, A_H)$ be a digraph which may contain loops, and let $D = (V_D, A_D)$ be a loopless digraph with a coloring of its arcs $c: A_D \\to V_H$. An $H$-walk of $D$ is a walk $(v_0, \\dots, v_n)$ of $D$ such that $(c(v_{i-1}, v_i), c(v_i, v_{i+1}))$ is an arc of $H$, for every $1 \\le i \\le n-1$. For $u, v \\in V_D$, we say that $u$ reaches $v$ by $H$-walks if there exists an $H$-walk from $u$ to $v$ in $D$. A subset $S \\subseteq V_D$ is a kernel by $H$-walks of $D$ if every vertex in $V_D \\setminus S$ reaches by $H$-walks some vertex in $S$, and no vertex in $S$ can reach another vertex in","authors_text":"C\\'esar Hern\\'andez-Cruz, Hortensia Galeana-S\\'anchez","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-05-31T12:02:36Z","title":"A dichotomy for the kernel by $H$-walks problem in digraphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.09589","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:553db072bf531640cd55fa403d8e477314a14a907f002d275312a2f38c01f43e","target":"record","created_at":"2026-05-18T01:13:10Z","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":"c8225f9e3a907a27d3a46015cc5e36c439fd13e0cc415cd44b8d9b1366ba52bc","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-05-31T12:02:36Z","title_canon_sha256":"ead8e061101994bb9be3d62eeea5e2440ba24a3af4b69d48b730bfb44da6e1cb"},"schema_version":"1.0","source":{"id":"1605.09589","kind":"arxiv","version":1}},"canonical_sha256":"ce0b386474edf5a71d1d6501eec41819695f9483ff9a2036e725bc21fb625d04","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ce0b386474edf5a71d1d6501eec41819695f9483ff9a2036e725bc21fb625d04","first_computed_at":"2026-05-18T01:13:10.533890Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:13:10.533890Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"0WMF7P9uQjvtsvSC8LlWjlJOK8zOlB1UhEF1hZ2G0Dfjwt8vDp9+mKK/UMRNVU4rwNKvPBrnRTmwmK+vIapKDA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:13:10.534270Z","signed_message":"canonical_sha256_bytes"},"source_id":"1605.09589","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:553db072bf531640cd55fa403d8e477314a14a907f002d275312a2f38c01f43e","sha256:cc0a565b74428401c638a5011442b92d5dd3a670e71ae420b29f289fcbc07f7a"],"state_sha256":"0b7a77e88eaa9b9c5984f8e9e19a6345c003013314dc829d205439590fa03a02"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"umlKFhB2LdLcxbdQanV5cY6Io8RhJNXVmnrEPReKOyOGSh3p6ocE2Vn6zebK6ZmNaXt2pyi7DNPwx14mlltVCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T05:46:35.882869Z","bundle_sha256":"3f8402c809720e21f6ca005528d9af591d57230d07c8445bd30146c1baaaebcf"}}