{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:YQQMJZJK4ME72XCVHVRBQIJHQX","short_pith_number":"pith:YQQMJZJK","canonical_record":{"source":{"id":"1409.7033","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-09-24T18:10:29Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"3984ca0917fd63ceb330be5b220168e6e19d4e7809afdf826248b8ca9ed3e40b","abstract_canon_sha256":"3cc022a3a8991eafe74f06eb5426286ecbd35a7ae692da922f4dbc31739276e8"},"schema_version":"1.0"},"canonical_sha256":"c420c4e52ae309fd5c553d6218212785f67109f3a2421b85e5857bc33ec5a206","source":{"kind":"arxiv","id":"1409.7033","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1409.7033","created_at":"2026-05-18T02:41:59Z"},{"alias_kind":"arxiv_version","alias_value":"1409.7033v1","created_at":"2026-05-18T02:41:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.7033","created_at":"2026-05-18T02:41:59Z"},{"alias_kind":"pith_short_12","alias_value":"YQQMJZJK4ME7","created_at":"2026-05-18T12:28:57Z"},{"alias_kind":"pith_short_16","alias_value":"YQQMJZJK4ME72XCV","created_at":"2026-05-18T12:28:57Z"},{"alias_kind":"pith_short_8","alias_value":"YQQMJZJK","created_at":"2026-05-18T12:28:57Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:YQQMJZJK4ME72XCVHVRBQIJHQX","target":"record","payload":{"canonical_record":{"source":{"id":"1409.7033","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-09-24T18:10:29Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"3984ca0917fd63ceb330be5b220168e6e19d4e7809afdf826248b8ca9ed3e40b","abstract_canon_sha256":"3cc022a3a8991eafe74f06eb5426286ecbd35a7ae692da922f4dbc31739276e8"},"schema_version":"1.0"},"canonical_sha256":"c420c4e52ae309fd5c553d6218212785f67109f3a2421b85e5857bc33ec5a206","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:41:59.194401Z","signature_b64":"+TRjSshrn7VrHio7vnt4EwexBg0Zh2FQB7BQ6KOlb+0ypghMMTRj7lUk53HpnjKHBNUXJ7PnLGP+Ibv9IKp5DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c420c4e52ae309fd5c553d6218212785f67109f3a2421b85e5857bc33ec5a206","last_reissued_at":"2026-05-18T02:41:59.193999Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:41:59.193999Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1409.7033","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-18T02:41:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lQeP7yPeYrrsAMWNjDudivsKrXYGuPbgbbDWiFKSCWOB5ecRCnBJ4li/PN/aUzMKy+3mSpfLBx8wx41g8roWDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T21:36:18.062535Z"},"content_sha256":"b8d64c6137e87a301c826f8557286bfdba8728710173e74e906f65e9f34f9ff8","schema_version":"1.0","event_id":"sha256:b8d64c6137e87a301c826f8557286bfdba8728710173e74e906f65e9f34f9ff8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:YQQMJZJK4ME72XCVHVRBQIJHQX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Shortest Paths in Nearly Conservative Digraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DS","authors_text":"Zolt\\'an Kir\\'aly","submitted_at":"2014-09-24T18:10:29Z","abstract_excerpt":"We introduce the following notion: a digraph $D=(V,A)$ with arc weights $c: A\\rightarrow \\R$ is called nearly conservative if every negative cycle consists of two arcs. Computing shortest paths in nearly conservative digraphs is NP-hard, and even deciding whether a digraph is nearly conservative is coNP-complete.\n  We show that the \"All Pairs Shortest Path\" problem is fixed parameter tractable with various parameters for nearly conservative digraphs. The results also apply for the special case of conservative mixed graphs."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1409.7033","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-18T02:41:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fwsyT+KVcKNBLjFBKHrB5x2qLFxbpZfzQMgcwa4C7dXcBJShURmCgeiQrHsWwJ4DG3GinuPLcCZZr70muH9PCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T21:36:18.062880Z"},"content_sha256":"a86a622afce1cadde0770b71a1d34b0cd48c0ce967378cdd61dfff62d751ff7e","schema_version":"1.0","event_id":"sha256:a86a622afce1cadde0770b71a1d34b0cd48c0ce967378cdd61dfff62d751ff7e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YQQMJZJK4ME72XCVHVRBQIJHQX/bundle.json","state_url":"https://pith.science/pith/YQQMJZJK4ME72XCVHVRBQIJHQX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YQQMJZJK4ME72XCVHVRBQIJHQX/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-11T21:36:18Z","links":{"resolver":"https://pith.science/pith/YQQMJZJK4ME72XCVHVRBQIJHQX","bundle":"https://pith.science/pith/YQQMJZJK4ME72XCVHVRBQIJHQX/bundle.json","state":"https://pith.science/pith/YQQMJZJK4ME72XCVHVRBQIJHQX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YQQMJZJK4ME72XCVHVRBQIJHQX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:YQQMJZJK4ME72XCVHVRBQIJHQX","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":"3cc022a3a8991eafe74f06eb5426286ecbd35a7ae692da922f4dbc31739276e8","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-09-24T18:10:29Z","title_canon_sha256":"3984ca0917fd63ceb330be5b220168e6e19d4e7809afdf826248b8ca9ed3e40b"},"schema_version":"1.0","source":{"id":"1409.7033","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1409.7033","created_at":"2026-05-18T02:41:59Z"},{"alias_kind":"arxiv_version","alias_value":"1409.7033v1","created_at":"2026-05-18T02:41:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.7033","created_at":"2026-05-18T02:41:59Z"},{"alias_kind":"pith_short_12","alias_value":"YQQMJZJK4ME7","created_at":"2026-05-18T12:28:57Z"},{"alias_kind":"pith_short_16","alias_value":"YQQMJZJK4ME72XCV","created_at":"2026-05-18T12:28:57Z"},{"alias_kind":"pith_short_8","alias_value":"YQQMJZJK","created_at":"2026-05-18T12:28:57Z"}],"graph_snapshots":[{"event_id":"sha256:a86a622afce1cadde0770b71a1d34b0cd48c0ce967378cdd61dfff62d751ff7e","target":"graph","created_at":"2026-05-18T02:41:59Z","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":"We introduce the following notion: a digraph $D=(V,A)$ with arc weights $c: A\\rightarrow \\R$ is called nearly conservative if every negative cycle consists of two arcs. Computing shortest paths in nearly conservative digraphs is NP-hard, and even deciding whether a digraph is nearly conservative is coNP-complete.\n  We show that the \"All Pairs Shortest Path\" problem is fixed parameter tractable with various parameters for nearly conservative digraphs. The results also apply for the special case of conservative mixed graphs.","authors_text":"Zolt\\'an Kir\\'aly","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-09-24T18:10:29Z","title":"Shortest Paths in Nearly Conservative Digraphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1409.7033","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:b8d64c6137e87a301c826f8557286bfdba8728710173e74e906f65e9f34f9ff8","target":"record","created_at":"2026-05-18T02:41:59Z","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":"3cc022a3a8991eafe74f06eb5426286ecbd35a7ae692da922f4dbc31739276e8","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-09-24T18:10:29Z","title_canon_sha256":"3984ca0917fd63ceb330be5b220168e6e19d4e7809afdf826248b8ca9ed3e40b"},"schema_version":"1.0","source":{"id":"1409.7033","kind":"arxiv","version":1}},"canonical_sha256":"c420c4e52ae309fd5c553d6218212785f67109f3a2421b85e5857bc33ec5a206","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c420c4e52ae309fd5c553d6218212785f67109f3a2421b85e5857bc33ec5a206","first_computed_at":"2026-05-18T02:41:59.193999Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:41:59.193999Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"+TRjSshrn7VrHio7vnt4EwexBg0Zh2FQB7BQ6KOlb+0ypghMMTRj7lUk53HpnjKHBNUXJ7PnLGP+Ibv9IKp5DQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:41:59.194401Z","signed_message":"canonical_sha256_bytes"},"source_id":"1409.7033","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b8d64c6137e87a301c826f8557286bfdba8728710173e74e906f65e9f34f9ff8","sha256:a86a622afce1cadde0770b71a1d34b0cd48c0ce967378cdd61dfff62d751ff7e"],"state_sha256":"18919d6b8940e3bfdcc4b714982ab60e63e58e715a24a837e990d2f89c4c1207"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nidNLO6MkHWio88UzifOKmzanDXmHc4rETpQi0qCf2uabQUBwYo4c23yFWHovd11fT7wvTwwfBLRxyWXY6FIAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T21:36:18.067589Z","bundle_sha256":"d0337073845668f113f04739111f79befbce99bc43a2b9b456574955ab7e6773"}}