{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:UCKCTWPNQQXMWQ4DCDPHLO2YKK","short_pith_number":"pith:UCKCTWPN","canonical_record":{"source":{"id":"2208.07788","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2022-08-16T14:55:11Z","cross_cats_sorted":[],"title_canon_sha256":"786a76f86b38a1607b67cf5c3a48024a8e5580a8f8443d5e0ea598e1b11b1d17","abstract_canon_sha256":"b9289477e35e47a0851989198d87a627928c449d754f172da7312f005e44fc26"},"schema_version":"1.0"},"canonical_sha256":"a09429d9ed842ecb438310de75bb58528aae0b8c4b39c909ea8ac6c75ebcc945","source":{"kind":"arxiv","id":"2208.07788","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2208.07788","created_at":"2026-07-05T04:49:08Z"},{"alias_kind":"arxiv_version","alias_value":"2208.07788v1","created_at":"2026-07-05T04:49:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2208.07788","created_at":"2026-07-05T04:49:08Z"},{"alias_kind":"pith_short_12","alias_value":"UCKCTWPNQQXM","created_at":"2026-07-05T04:49:08Z"},{"alias_kind":"pith_short_16","alias_value":"UCKCTWPNQQXMWQ4D","created_at":"2026-07-05T04:49:08Z"},{"alias_kind":"pith_short_8","alias_value":"UCKCTWPN","created_at":"2026-07-05T04:49:08Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:UCKCTWPNQQXMWQ4DCDPHLO2YKK","target":"record","payload":{"canonical_record":{"source":{"id":"2208.07788","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2022-08-16T14:55:11Z","cross_cats_sorted":[],"title_canon_sha256":"786a76f86b38a1607b67cf5c3a48024a8e5580a8f8443d5e0ea598e1b11b1d17","abstract_canon_sha256":"b9289477e35e47a0851989198d87a627928c449d754f172da7312f005e44fc26"},"schema_version":"1.0"},"canonical_sha256":"a09429d9ed842ecb438310de75bb58528aae0b8c4b39c909ea8ac6c75ebcc945","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:49:08.963821Z","signature_b64":"gSJTWmvLsYX62zXcMon4aaAHQzgorqSa5mk1ebV3i0rVlymMt0ZYMHBdveGYxgty4vbc7cIBLbI2y8nW+h1iDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a09429d9ed842ecb438310de75bb58528aae0b8c4b39c909ea8ac6c75ebcc945","last_reissued_at":"2026-07-05T04:49:08.963451Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:49:08.963451Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2208.07788","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-05T04:49:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pUdFBXCZCo8/MliEM0oI6P6GoaBIs8jPkXWCoh1l8k6tdcxlYWERoZHSgP3WA5UPZONHFLNLspsnnKx6ogCoBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-06T14:44:07.882401Z"},"content_sha256":"522f083786a1af74b66a264865bee5e15c4504df938220d39d249c688187b0c3","schema_version":"1.0","event_id":"sha256:522f083786a1af74b66a264865bee5e15c4504df938220d39d249c688187b0c3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:UCKCTWPNQQXMWQ4DCDPHLO2YKK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The Localization Game on Directed Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Anthony Bonato, Brittany Pittman, Ryan Cushman, Trent G. Marbach","submitted_at":"2022-08-16T14:55:11Z","abstract_excerpt":"In the Localization game played on graphs, a set of cops uses distance probes to identify the location of an invisible robber. We present an extension of the game and its main parameter, the localization number, to directed graphs. We present several bounds on the localization number of a directed graphs, including a tight bound via strong components, a bound using a linear programming problem on hypergraphs, and bounds in terms of pathwidth and DAG-width. A family of digraphs of order $n$ is given with localization number $(1-o(1))n/2$. We investigate the localization number of random and qua"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2208.07788","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/2208.07788/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-05T04:49:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"asVcT12/MIbYIszwo5geu3avTOGkjfYJ/rzyngpBd5pmsAW3rJpXCfJmQuZmajn6z/BiKUznA9do+aRzrlLoBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-06T14:44:07.882783Z"},"content_sha256":"66798be7dcaf7bddd6e2637eedfa47f5900f78d03a3ec30f16c24bfc14308cb2","schema_version":"1.0","event_id":"sha256:66798be7dcaf7bddd6e2637eedfa47f5900f78d03a3ec30f16c24bfc14308cb2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UCKCTWPNQQXMWQ4DCDPHLO2YKK/bundle.json","state_url":"https://pith.science/pith/UCKCTWPNQQXMWQ4DCDPHLO2YKK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UCKCTWPNQQXMWQ4DCDPHLO2YKK/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-07-06T14:44:07Z","links":{"resolver":"https://pith.science/pith/UCKCTWPNQQXMWQ4DCDPHLO2YKK","bundle":"https://pith.science/pith/UCKCTWPNQQXMWQ4DCDPHLO2YKK/bundle.json","state":"https://pith.science/pith/UCKCTWPNQQXMWQ4DCDPHLO2YKK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UCKCTWPNQQXMWQ4DCDPHLO2YKK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:UCKCTWPNQQXMWQ4DCDPHLO2YKK","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":"b9289477e35e47a0851989198d87a627928c449d754f172da7312f005e44fc26","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2022-08-16T14:55:11Z","title_canon_sha256":"786a76f86b38a1607b67cf5c3a48024a8e5580a8f8443d5e0ea598e1b11b1d17"},"schema_version":"1.0","source":{"id":"2208.07788","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2208.07788","created_at":"2026-07-05T04:49:08Z"},{"alias_kind":"arxiv_version","alias_value":"2208.07788v1","created_at":"2026-07-05T04:49:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2208.07788","created_at":"2026-07-05T04:49:08Z"},{"alias_kind":"pith_short_12","alias_value":"UCKCTWPNQQXM","created_at":"2026-07-05T04:49:08Z"},{"alias_kind":"pith_short_16","alias_value":"UCKCTWPNQQXMWQ4D","created_at":"2026-07-05T04:49:08Z"},{"alias_kind":"pith_short_8","alias_value":"UCKCTWPN","created_at":"2026-07-05T04:49:08Z"}],"graph_snapshots":[{"event_id":"sha256:66798be7dcaf7bddd6e2637eedfa47f5900f78d03a3ec30f16c24bfc14308cb2","target":"graph","created_at":"2026-07-05T04:49:08Z","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/2208.07788/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In the Localization game played on graphs, a set of cops uses distance probes to identify the location of an invisible robber. We present an extension of the game and its main parameter, the localization number, to directed graphs. We present several bounds on the localization number of a directed graphs, including a tight bound via strong components, a bound using a linear programming problem on hypergraphs, and bounds in terms of pathwidth and DAG-width. A family of digraphs of order $n$ is given with localization number $(1-o(1))n/2$. We investigate the localization number of random and qua","authors_text":"Anthony Bonato, Brittany Pittman, Ryan Cushman, Trent G. Marbach","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2022-08-16T14:55:11Z","title":"The Localization Game on Directed Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2208.07788","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:522f083786a1af74b66a264865bee5e15c4504df938220d39d249c688187b0c3","target":"record","created_at":"2026-07-05T04:49:08Z","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":"b9289477e35e47a0851989198d87a627928c449d754f172da7312f005e44fc26","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2022-08-16T14:55:11Z","title_canon_sha256":"786a76f86b38a1607b67cf5c3a48024a8e5580a8f8443d5e0ea598e1b11b1d17"},"schema_version":"1.0","source":{"id":"2208.07788","kind":"arxiv","version":1}},"canonical_sha256":"a09429d9ed842ecb438310de75bb58528aae0b8c4b39c909ea8ac6c75ebcc945","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a09429d9ed842ecb438310de75bb58528aae0b8c4b39c909ea8ac6c75ebcc945","first_computed_at":"2026-07-05T04:49:08.963451Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T04:49:08.963451Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"gSJTWmvLsYX62zXcMon4aaAHQzgorqSa5mk1ebV3i0rVlymMt0ZYMHBdveGYxgty4vbc7cIBLbI2y8nW+h1iDw==","signature_status":"signed_v1","signed_at":"2026-07-05T04:49:08.963821Z","signed_message":"canonical_sha256_bytes"},"source_id":"2208.07788","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:522f083786a1af74b66a264865bee5e15c4504df938220d39d249c688187b0c3","sha256:66798be7dcaf7bddd6e2637eedfa47f5900f78d03a3ec30f16c24bfc14308cb2"],"state_sha256":"110d836ec7516095108d7a4e7f4f3e301dffa4e4b794748a3075c9e5e0bc45b0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"x2wH4/0xf6F7PB127ElsSVQXsDDC4gAoblDH/QTcjnMrZDKh5P5urYBb3qd5NGxsRJxurRKI89N4bLmdYb2ZCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-06T14:44:07.884859Z","bundle_sha256":"a38360b4b6d9c59dd9a0832e476c9fd05a56c00cb8be24e0df2bb9092427d949"}}