{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:7E44RK74OGLZ5E3N4FCY4OY5CQ","short_pith_number":"pith:7E44RK74","schema_version":"1.0","canonical_sha256":"f939c8abfc71979e936de1458e3b1d1419afa7aa1d7d16348b7578ad85d0d6a0","source":{"kind":"arxiv","id":"2510.24515","version":2},"attestation_state":"computed","paper":{"title":"Learning Ordinal Response Policies in Rank-Based Stochastic Prize-Collecting Games","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Malintha Fernando, Petter \\\"Ogren, Silun Zhang","submitted_at":"2025-10-28T15:27:26Z","abstract_excerpt":"The Team Orienteering Problem (TOP) generalizes many real-world multi-agent scheduling and routing tasks that occur in autonomous mobility, aerial logistics, and surveillance applications. While many flavors of the TOP exist for planning in multi-agent systems, they assume that all the agents cooperate toward a single objective; therefore, they do not extend to settings when they compete in reward-scarce environments. We propose Stochastic Prize-Collecting Orienteering Games (SPCOG) as an extension of the TOP to plan in the presence of self-interested agents operating on a graph, under energy "},"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":"2510.24515","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.RO","submitted_at":"2025-10-28T15:27:26Z","cross_cats_sorted":[],"title_canon_sha256":"ebe8a9b78d7827779c59202b815fb3815af4a2dbcb095944ea2ccbfc51a596a0","abstract_canon_sha256":"53e961ee2f40dd52d18cfeb33fd62b31fd7f70273c31b5d0c2c771c210625433"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-11T01:09:20.863053Z","signature_b64":"ZukIPkjGFOjp4HDLyQ2bX52ZdIBSnYOQVygjWRpBJSmZOP+Jh5WmwOwK+Gq7flIbjsHvZQDQsEueKwcJ4Y3rBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f939c8abfc71979e936de1458e3b1d1419afa7aa1d7d16348b7578ad85d0d6a0","last_reissued_at":"2026-06-11T01:09:20.862011Z","signature_status":"signed_v1","first_computed_at":"2026-06-11T01:09:20.862011Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Learning Ordinal Response Policies in Rank-Based Stochastic Prize-Collecting Games","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Malintha Fernando, Petter \\\"Ogren, Silun Zhang","submitted_at":"2025-10-28T15:27:26Z","abstract_excerpt":"The Team Orienteering Problem (TOP) generalizes many real-world multi-agent scheduling and routing tasks that occur in autonomous mobility, aerial logistics, and surveillance applications. While many flavors of the TOP exist for planning in multi-agent systems, they assume that all the agents cooperate toward a single objective; therefore, they do not extend to settings when they compete in reward-scarce environments. We propose Stochastic Prize-Collecting Orienteering Games (SPCOG) as an extension of the TOP to plan in the presence of self-interested agents operating on a graph, under energy "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2510.24515","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2510.24515/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2510.24515","created_at":"2026-06-11T01:09:20.862161+00:00"},{"alias_kind":"arxiv_version","alias_value":"2510.24515v2","created_at":"2026-06-11T01:09:20.862161+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2510.24515","created_at":"2026-06-11T01:09:20.862161+00:00"},{"alias_kind":"pith_short_12","alias_value":"7E44RK74OGLZ","created_at":"2026-06-11T01:09:20.862161+00:00"},{"alias_kind":"pith_short_16","alias_value":"7E44RK74OGLZ5E3N","created_at":"2026-06-11T01:09:20.862161+00:00"},{"alias_kind":"pith_short_8","alias_value":"7E44RK74","created_at":"2026-06-11T01:09:20.862161+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/7E44RK74OGLZ5E3N4FCY4OY5CQ","json":"https://pith.science/pith/7E44RK74OGLZ5E3N4FCY4OY5CQ.json","graph_json":"https://pith.science/api/pith-number/7E44RK74OGLZ5E3N4FCY4OY5CQ/graph.json","events_json":"https://pith.science/api/pith-number/7E44RK74OGLZ5E3N4FCY4OY5CQ/events.json","paper":"https://pith.science/paper/7E44RK74"},"agent_actions":{"view_html":"https://pith.science/pith/7E44RK74OGLZ5E3N4FCY4OY5CQ","download_json":"https://pith.science/pith/7E44RK74OGLZ5E3N4FCY4OY5CQ.json","view_paper":"https://pith.science/paper/7E44RK74","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2510.24515&json=true","fetch_graph":"https://pith.science/api/pith-number/7E44RK74OGLZ5E3N4FCY4OY5CQ/graph.json","fetch_events":"https://pith.science/api/pith-number/7E44RK74OGLZ5E3N4FCY4OY5CQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7E44RK74OGLZ5E3N4FCY4OY5CQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7E44RK74OGLZ5E3N4FCY4OY5CQ/action/storage_attestation","attest_author":"https://pith.science/pith/7E44RK74OGLZ5E3N4FCY4OY5CQ/action/author_attestation","sign_citation":"https://pith.science/pith/7E44RK74OGLZ5E3N4FCY4OY5CQ/action/citation_signature","submit_replication":"https://pith.science/pith/7E44RK74OGLZ5E3N4FCY4OY5CQ/action/replication_record"}},"created_at":"2026-06-11T01:09:20.862161+00:00","updated_at":"2026-06-11T01:09:20.862161+00:00"}