{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:4WSWOT5O5M2BYKDI7ZGCEJL353","short_pith_number":"pith:4WSWOT5O","canonical_record":{"source":{"id":"1105.0830","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2011-05-04T14:04:49Z","cross_cats_sorted":["physics.soc-ph"],"title_canon_sha256":"8a8202d5f9c9d6f724100dcf07624ecded08dbaeec3e42dda82f588084f71a71","abstract_canon_sha256":"6b806651f5b6360239d62555d53fc7d5f02d431139ee665da51dcd605061b9d4"},"schema_version":"1.0"},"canonical_sha256":"e5a5674faeeb341c2868fe4c22257beef581d2ffe8da393ed2d7a8e424ab6dac","source":{"kind":"arxiv","id":"1105.0830","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1105.0830","created_at":"2026-05-18T04:22:49Z"},{"alias_kind":"arxiv_version","alias_value":"1105.0830v2","created_at":"2026-05-18T04:22:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1105.0830","created_at":"2026-05-18T04:22:49Z"},{"alias_kind":"pith_short_12","alias_value":"4WSWOT5O5M2B","created_at":"2026-05-18T12:26:20Z"},{"alias_kind":"pith_short_16","alias_value":"4WSWOT5O5M2BYKDI","created_at":"2026-05-18T12:26:20Z"},{"alias_kind":"pith_short_8","alias_value":"4WSWOT5O","created_at":"2026-05-18T12:26:20Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:4WSWOT5O5M2BYKDI7ZGCEJL353","target":"record","payload":{"canonical_record":{"source":{"id":"1105.0830","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2011-05-04T14:04:49Z","cross_cats_sorted":["physics.soc-ph"],"title_canon_sha256":"8a8202d5f9c9d6f724100dcf07624ecded08dbaeec3e42dda82f588084f71a71","abstract_canon_sha256":"6b806651f5b6360239d62555d53fc7d5f02d431139ee665da51dcd605061b9d4"},"schema_version":"1.0"},"canonical_sha256":"e5a5674faeeb341c2868fe4c22257beef581d2ffe8da393ed2d7a8e424ab6dac","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:22:49.655760Z","signature_b64":"Nvp0DTnaA+0zWDtt18jLkY+TI2Fg1+EUrgusyodaTIzUM6nQM5hzumT6vdRaT1ZZBdFlt3MqL5TKF/JiMrMjBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e5a5674faeeb341c2868fe4c22257beef581d2ffe8da393ed2d7a8e424ab6dac","last_reissued_at":"2026-05-18T04:22:49.655127Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:22:49.655127Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1105.0830","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-18T04:22:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6I6zEFkVWi6EyPLIKpeJ9vf5kgL+tYfm7nKN/Pga5Rwx15b30M643UVmpu0Q6l/H0Y2BKqSwKtFap5wTELd9AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T07:48:56.943560Z"},"content_sha256":"7168133d982bc1813d0396193ef8eb76b332f4f3abf8ae9a2ff5c790bcca627f","schema_version":"1.0","event_id":"sha256:7168133d982bc1813d0396193ef8eb76b332f4f3abf8ae9a2ff5c790bcca627f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:4WSWOT5O5M2BYKDI7ZGCEJL353","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Maximum Gain Round Trips with Cost Constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["physics.soc-ph"],"primary_cat":"cs.SI","authors_text":"Franz Graf, Hans-Peter Kriegel, Matthias Schubert","submitted_at":"2011-05-04T14:04:49Z","abstract_excerpt":"Searching for optimal ways in a network is an important task in multiple application areas such as social networks, co-citation graphs or road networks. In the majority of applications, each edge in a network is associated with a certain cost and an optimal way minimizes the cost while fulfilling a certain property, e.g connecting a start and a destination node. In this paper, we want to extend pure cost networks to so-called cost-gain networks. In this type of network, each edge is additionally associated with a certain gain. Thus, a way having a certain cost additionally provides a certain g"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1105.0830","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-18T04:22:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zNa02qdo79B4TN2PYCsCN7id+/D1zatto9wg/rLVq/kzux0nM6GTSmF+ZPtgidUVEcQxYb+k/FFbSQiwP3dvDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T07:48:56.943911Z"},"content_sha256":"f49ce3429d0ffc901c50b420f190b993d2b9e9c3f864a81c9a44d161ea5c487d","schema_version":"1.0","event_id":"sha256:f49ce3429d0ffc901c50b420f190b993d2b9e9c3f864a81c9a44d161ea5c487d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4WSWOT5O5M2BYKDI7ZGCEJL353/bundle.json","state_url":"https://pith.science/pith/4WSWOT5O5M2BYKDI7ZGCEJL353/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4WSWOT5O5M2BYKDI7ZGCEJL353/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-02T07:48:56Z","links":{"resolver":"https://pith.science/pith/4WSWOT5O5M2BYKDI7ZGCEJL353","bundle":"https://pith.science/pith/4WSWOT5O5M2BYKDI7ZGCEJL353/bundle.json","state":"https://pith.science/pith/4WSWOT5O5M2BYKDI7ZGCEJL353/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4WSWOT5O5M2BYKDI7ZGCEJL353/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:4WSWOT5O5M2BYKDI7ZGCEJL353","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":"6b806651f5b6360239d62555d53fc7d5f02d431139ee665da51dcd605061b9d4","cross_cats_sorted":["physics.soc-ph"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2011-05-04T14:04:49Z","title_canon_sha256":"8a8202d5f9c9d6f724100dcf07624ecded08dbaeec3e42dda82f588084f71a71"},"schema_version":"1.0","source":{"id":"1105.0830","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1105.0830","created_at":"2026-05-18T04:22:49Z"},{"alias_kind":"arxiv_version","alias_value":"1105.0830v2","created_at":"2026-05-18T04:22:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1105.0830","created_at":"2026-05-18T04:22:49Z"},{"alias_kind":"pith_short_12","alias_value":"4WSWOT5O5M2B","created_at":"2026-05-18T12:26:20Z"},{"alias_kind":"pith_short_16","alias_value":"4WSWOT5O5M2BYKDI","created_at":"2026-05-18T12:26:20Z"},{"alias_kind":"pith_short_8","alias_value":"4WSWOT5O","created_at":"2026-05-18T12:26:20Z"}],"graph_snapshots":[{"event_id":"sha256:f49ce3429d0ffc901c50b420f190b993d2b9e9c3f864a81c9a44d161ea5c487d","target":"graph","created_at":"2026-05-18T04:22:49Z","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":"Searching for optimal ways in a network is an important task in multiple application areas such as social networks, co-citation graphs or road networks. In the majority of applications, each edge in a network is associated with a certain cost and an optimal way minimizes the cost while fulfilling a certain property, e.g connecting a start and a destination node. In this paper, we want to extend pure cost networks to so-called cost-gain networks. In this type of network, each edge is additionally associated with a certain gain. Thus, a way having a certain cost additionally provides a certain g","authors_text":"Franz Graf, Hans-Peter Kriegel, Matthias Schubert","cross_cats":["physics.soc-ph"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2011-05-04T14:04:49Z","title":"Maximum Gain Round Trips with Cost Constraints"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1105.0830","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:7168133d982bc1813d0396193ef8eb76b332f4f3abf8ae9a2ff5c790bcca627f","target":"record","created_at":"2026-05-18T04:22:49Z","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":"6b806651f5b6360239d62555d53fc7d5f02d431139ee665da51dcd605061b9d4","cross_cats_sorted":["physics.soc-ph"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2011-05-04T14:04:49Z","title_canon_sha256":"8a8202d5f9c9d6f724100dcf07624ecded08dbaeec3e42dda82f588084f71a71"},"schema_version":"1.0","source":{"id":"1105.0830","kind":"arxiv","version":2}},"canonical_sha256":"e5a5674faeeb341c2868fe4c22257beef581d2ffe8da393ed2d7a8e424ab6dac","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e5a5674faeeb341c2868fe4c22257beef581d2ffe8da393ed2d7a8e424ab6dac","first_computed_at":"2026-05-18T04:22:49.655127Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:22:49.655127Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Nvp0DTnaA+0zWDtt18jLkY+TI2Fg1+EUrgusyodaTIzUM6nQM5hzumT6vdRaT1ZZBdFlt3MqL5TKF/JiMrMjBw==","signature_status":"signed_v1","signed_at":"2026-05-18T04:22:49.655760Z","signed_message":"canonical_sha256_bytes"},"source_id":"1105.0830","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7168133d982bc1813d0396193ef8eb76b332f4f3abf8ae9a2ff5c790bcca627f","sha256:f49ce3429d0ffc901c50b420f190b993d2b9e9c3f864a81c9a44d161ea5c487d"],"state_sha256":"19aeaa02242664c4d2d05360edf750f9723486a01acd53dfe046f9817d0008e1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rkU/YI79HYR+TW8Yp3bi+rwMwcwk+F4ORaDJ0DOEqms0L6k05ovGjB6pfw+tTN7kuL8pfJGw41MRbh0HkyBIAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T07:48:56.945919Z","bundle_sha256":"43254fbab2d19c340e4bc007f7eb5eb7085ff7327adc2524786db853055ac48b"}}