{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:77Z7YIUD3CT6UZ24IZUFXQ3WOJ","short_pith_number":"pith:77Z7YIUD","canonical_record":{"source":{"id":"1708.06580","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-08-22T12:23:06Z","cross_cats_sorted":[],"title_canon_sha256":"18df8268bee8c154623d8f0301b3bb867c0bc80f90d4b54f5194f55b80af928a","abstract_canon_sha256":"74e306c648a4c0a18cfd0f7739a8648f998e436a5dfc39205b6f96ab59255fc6"},"schema_version":"1.0"},"canonical_sha256":"fff3fc2283d8a7ea675c46685bc3767254ee7ed080dcd473ff31ee1ab8cd99b5","source":{"kind":"arxiv","id":"1708.06580","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.06580","created_at":"2026-05-18T00:37:33Z"},{"alias_kind":"arxiv_version","alias_value":"1708.06580v1","created_at":"2026-05-18T00:37:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.06580","created_at":"2026-05-18T00:37:33Z"},{"alias_kind":"pith_short_12","alias_value":"77Z7YIUD3CT6","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_16","alias_value":"77Z7YIUD3CT6UZ24","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_8","alias_value":"77Z7YIUD","created_at":"2026-05-18T12:31:03Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:77Z7YIUD3CT6UZ24IZUFXQ3WOJ","target":"record","payload":{"canonical_record":{"source":{"id":"1708.06580","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-08-22T12:23:06Z","cross_cats_sorted":[],"title_canon_sha256":"18df8268bee8c154623d8f0301b3bb867c0bc80f90d4b54f5194f55b80af928a","abstract_canon_sha256":"74e306c648a4c0a18cfd0f7739a8648f998e436a5dfc39205b6f96ab59255fc6"},"schema_version":"1.0"},"canonical_sha256":"fff3fc2283d8a7ea675c46685bc3767254ee7ed080dcd473ff31ee1ab8cd99b5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:37:33.104410Z","signature_b64":"Yi6VHufFhYm+Y7o+JmIFtt92O8GDyxHnqrfg6QENM+DzXMKU+WheiHtD0vCgM127mLV1yQuESK1bFKFooQvdDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fff3fc2283d8a7ea675c46685bc3767254ee7ed080dcd473ff31ee1ab8cd99b5","last_reissued_at":"2026-05-18T00:37:33.103899Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:37:33.103899Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1708.06580","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-18T00:37:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"drH5Gnh6Bp0Em+ou+8nnuGyh4m5HabXUrNIszpoCNO/j5BMPuTBER22jWre1zK2tpzumwYPNNzFKFRt7nPNUBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T07:06:31.850839Z"},"content_sha256":"bbe8e6713095d0bd56c7c243495840f72c7e42071216a7850fa0f262c574be11","schema_version":"1.0","event_id":"sha256:bbe8e6713095d0bd56c7c243495840f72c7e42071216a7850fa0f262c574be11"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:77Z7YIUD3CT6UZ24IZUFXQ3WOJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On Solving the Quadratic Shortest Path Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Hao Hu, Renata Sotirov","submitted_at":"2017-08-22T12:23:06Z","abstract_excerpt":"The quadratic shortest path problem is the problem of finding a path in a directed graph such that the sum of interaction costs over all pairs of arcs on the path is minimized. We derive several semidefinite programming relaxations for the quadratic shortest path problem with a matrix variable of order $m+1$, where $m$ is the number of arcs in the graph. We use the alternating direction method of multipliers to solve the semidefinite programming relaxations. Numerical results show that our bounds are currently the strongest bounds for the quadratic shortest path problem.\n  We also present comp"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.06580","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-18T00:37:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"58LxIJUDvy8er7Nsy1GYGGBUrDssfhYTJLrxBCwNRXhsl4PKo5nKXtApE3mt0bnR6z/N91lyJipqF51uJlqwBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T07:06:31.851182Z"},"content_sha256":"da8113a653ac9a55327b112ff92d1b58e02c2c5754a2734f9c5150b682a63264","schema_version":"1.0","event_id":"sha256:da8113a653ac9a55327b112ff92d1b58e02c2c5754a2734f9c5150b682a63264"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/77Z7YIUD3CT6UZ24IZUFXQ3WOJ/bundle.json","state_url":"https://pith.science/pith/77Z7YIUD3CT6UZ24IZUFXQ3WOJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/77Z7YIUD3CT6UZ24IZUFXQ3WOJ/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-25T07:06:31Z","links":{"resolver":"https://pith.science/pith/77Z7YIUD3CT6UZ24IZUFXQ3WOJ","bundle":"https://pith.science/pith/77Z7YIUD3CT6UZ24IZUFXQ3WOJ/bundle.json","state":"https://pith.science/pith/77Z7YIUD3CT6UZ24IZUFXQ3WOJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/77Z7YIUD3CT6UZ24IZUFXQ3WOJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:77Z7YIUD3CT6UZ24IZUFXQ3WOJ","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":"74e306c648a4c0a18cfd0f7739a8648f998e436a5dfc39205b6f96ab59255fc6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-08-22T12:23:06Z","title_canon_sha256":"18df8268bee8c154623d8f0301b3bb867c0bc80f90d4b54f5194f55b80af928a"},"schema_version":"1.0","source":{"id":"1708.06580","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.06580","created_at":"2026-05-18T00:37:33Z"},{"alias_kind":"arxiv_version","alias_value":"1708.06580v1","created_at":"2026-05-18T00:37:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.06580","created_at":"2026-05-18T00:37:33Z"},{"alias_kind":"pith_short_12","alias_value":"77Z7YIUD3CT6","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_16","alias_value":"77Z7YIUD3CT6UZ24","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_8","alias_value":"77Z7YIUD","created_at":"2026-05-18T12:31:03Z"}],"graph_snapshots":[{"event_id":"sha256:da8113a653ac9a55327b112ff92d1b58e02c2c5754a2734f9c5150b682a63264","target":"graph","created_at":"2026-05-18T00:37:33Z","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 quadratic shortest path problem is the problem of finding a path in a directed graph such that the sum of interaction costs over all pairs of arcs on the path is minimized. We derive several semidefinite programming relaxations for the quadratic shortest path problem with a matrix variable of order $m+1$, where $m$ is the number of arcs in the graph. We use the alternating direction method of multipliers to solve the semidefinite programming relaxations. Numerical results show that our bounds are currently the strongest bounds for the quadratic shortest path problem.\n  We also present comp","authors_text":"Hao Hu, Renata Sotirov","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-08-22T12:23:06Z","title":"On Solving the Quadratic Shortest Path Problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.06580","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:bbe8e6713095d0bd56c7c243495840f72c7e42071216a7850fa0f262c574be11","target":"record","created_at":"2026-05-18T00:37:33Z","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":"74e306c648a4c0a18cfd0f7739a8648f998e436a5dfc39205b6f96ab59255fc6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-08-22T12:23:06Z","title_canon_sha256":"18df8268bee8c154623d8f0301b3bb867c0bc80f90d4b54f5194f55b80af928a"},"schema_version":"1.0","source":{"id":"1708.06580","kind":"arxiv","version":1}},"canonical_sha256":"fff3fc2283d8a7ea675c46685bc3767254ee7ed080dcd473ff31ee1ab8cd99b5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fff3fc2283d8a7ea675c46685bc3767254ee7ed080dcd473ff31ee1ab8cd99b5","first_computed_at":"2026-05-18T00:37:33.103899Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:37:33.103899Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Yi6VHufFhYm+Y7o+JmIFtt92O8GDyxHnqrfg6QENM+DzXMKU+WheiHtD0vCgM127mLV1yQuESK1bFKFooQvdDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:37:33.104410Z","signed_message":"canonical_sha256_bytes"},"source_id":"1708.06580","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bbe8e6713095d0bd56c7c243495840f72c7e42071216a7850fa0f262c574be11","sha256:da8113a653ac9a55327b112ff92d1b58e02c2c5754a2734f9c5150b682a63264"],"state_sha256":"bfc6a369e40ca5aaebaa2f6e7e00993d91c0637a45df37a2f158dc3565539c5d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FxwuB8yDAdjTUPxL468OQeK0Xlz6LSb20YNWjH6ih9Vm+vR2RC7nHOB1yMjb3bJMTwGd7FIv59tPwfJ2ohIqDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-25T07:06:31.853130Z","bundle_sha256":"7f956ee17ef6761eae13b47661c05c70d4506d67aecf2fedb3a5eba6297e876a"}}