{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:4WSWOT5O5M2BYKDI7ZGCEJL353","short_pith_number":"pith:4WSWOT5O","schema_version":"1.0","canonical_sha256":"e5a5674faeeb341c2868fe4c22257beef581d2ffe8da393ed2d7a8e424ab6dac","source":{"kind":"arxiv","id":"1105.0830","version":2},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1105.0830","created_at":"2026-05-18T04:22:49.655224+00:00"},{"alias_kind":"arxiv_version","alias_value":"1105.0830v2","created_at":"2026-05-18T04:22:49.655224+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1105.0830","created_at":"2026-05-18T04:22:49.655224+00:00"},{"alias_kind":"pith_short_12","alias_value":"4WSWOT5O5M2B","created_at":"2026-05-18T12:26:20.644004+00:00"},{"alias_kind":"pith_short_16","alias_value":"4WSWOT5O5M2BYKDI","created_at":"2026-05-18T12:26:20.644004+00:00"},{"alias_kind":"pith_short_8","alias_value":"4WSWOT5O","created_at":"2026-05-18T12:26:20.644004+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/4WSWOT5O5M2BYKDI7ZGCEJL353","json":"https://pith.science/pith/4WSWOT5O5M2BYKDI7ZGCEJL353.json","graph_json":"https://pith.science/api/pith-number/4WSWOT5O5M2BYKDI7ZGCEJL353/graph.json","events_json":"https://pith.science/api/pith-number/4WSWOT5O5M2BYKDI7ZGCEJL353/events.json","paper":"https://pith.science/paper/4WSWOT5O"},"agent_actions":{"view_html":"https://pith.science/pith/4WSWOT5O5M2BYKDI7ZGCEJL353","download_json":"https://pith.science/pith/4WSWOT5O5M2BYKDI7ZGCEJL353.json","view_paper":"https://pith.science/paper/4WSWOT5O","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1105.0830&json=true","fetch_graph":"https://pith.science/api/pith-number/4WSWOT5O5M2BYKDI7ZGCEJL353/graph.json","fetch_events":"https://pith.science/api/pith-number/4WSWOT5O5M2BYKDI7ZGCEJL353/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4WSWOT5O5M2BYKDI7ZGCEJL353/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4WSWOT5O5M2BYKDI7ZGCEJL353/action/storage_attestation","attest_author":"https://pith.science/pith/4WSWOT5O5M2BYKDI7ZGCEJL353/action/author_attestation","sign_citation":"https://pith.science/pith/4WSWOT5O5M2BYKDI7ZGCEJL353/action/citation_signature","submit_replication":"https://pith.science/pith/4WSWOT5O5M2BYKDI7ZGCEJL353/action/replication_record"}},"created_at":"2026-05-18T04:22:49.655224+00:00","updated_at":"2026-05-18T04:22:49.655224+00:00"}