{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:6CWTRDC3I5BTHN67REM6KUNHX3","short_pith_number":"pith:6CWTRDC3","schema_version":"1.0","canonical_sha256":"f0ad388c5b474333b7df8919e551a7bef8ff636c2300b00385f9a23e93cc1122","source":{"kind":"arxiv","id":"2504.14195","version":1},"attestation_state":"computed","paper":{"title":"The River Method","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Jobst Heitzig, Markus Brill, Michelle D\\\"oring","submitted_at":"2025-04-19T06:13:26Z","abstract_excerpt":"We introduce River, a novel Condorcet-consistent voting method that is based on pairwise majority margins and can be seen as a simplified variation of Tideman's Ranked Pairs method. River is simple to explain, simple to compute even 'by hand', and gives rise to an easy-to-interpret certificate in the form of a directed tree. Like Ranked Pairs and Schulze's Beat Path method, River is a refinement of the Split Cycle method and shares with those many desirable properties, including independence of clones. Unlike the other three methods, River satisfies a strong form of resistance to agenda-manipu"},"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":"2504.14195","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.GT","submitted_at":"2025-04-19T06:13:26Z","cross_cats_sorted":[],"title_canon_sha256":"e9f9e3d18bb135c3ad94f381fdc0e8d93aa123e465f85b74c40ad2a279c48161","abstract_canon_sha256":"7b766f37faebfdaae6042370621070bb2b206a96ed2eba61ce9d857f007e6619"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:51:39.631293Z","signature_b64":"yw8uAmidQlO7K2oj76bGF3S9UmNGvPQbq0qsnme98Uqgop9s32MuqGlIkuMAVa1FgOMqqoz3OwX3w9aYrQSVBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f0ad388c5b474333b7df8919e551a7bef8ff636c2300b00385f9a23e93cc1122","last_reissued_at":"2026-07-05T10:51:39.630803Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:51:39.630803Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The River Method","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Jobst Heitzig, Markus Brill, Michelle D\\\"oring","submitted_at":"2025-04-19T06:13:26Z","abstract_excerpt":"We introduce River, a novel Condorcet-consistent voting method that is based on pairwise majority margins and can be seen as a simplified variation of Tideman's Ranked Pairs method. River is simple to explain, simple to compute even 'by hand', and gives rise to an easy-to-interpret certificate in the form of a directed tree. Like Ranked Pairs and Schulze's Beat Path method, River is a refinement of the Split Cycle method and shares with those many desirable properties, including independence of clones. Unlike the other three methods, River satisfies a strong form of resistance to agenda-manipu"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2504.14195","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2504.14195/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":"2504.14195","created_at":"2026-07-05T10:51:39.630863+00:00"},{"alias_kind":"arxiv_version","alias_value":"2504.14195v1","created_at":"2026-07-05T10:51:39.630863+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2504.14195","created_at":"2026-07-05T10:51:39.630863+00:00"},{"alias_kind":"pith_short_12","alias_value":"6CWTRDC3I5BT","created_at":"2026-07-05T10:51:39.630863+00:00"},{"alias_kind":"pith_short_16","alias_value":"6CWTRDC3I5BTHN67","created_at":"2026-07-05T10:51:39.630863+00:00"},{"alias_kind":"pith_short_8","alias_value":"6CWTRDC3","created_at":"2026-07-05T10:51:39.630863+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.11873","citing_title":"Maximizing Reachability via Shifting of Temporal Paths","ref_index":278,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/6CWTRDC3I5BTHN67REM6KUNHX3","json":"https://pith.science/pith/6CWTRDC3I5BTHN67REM6KUNHX3.json","graph_json":"https://pith.science/api/pith-number/6CWTRDC3I5BTHN67REM6KUNHX3/graph.json","events_json":"https://pith.science/api/pith-number/6CWTRDC3I5BTHN67REM6KUNHX3/events.json","paper":"https://pith.science/paper/6CWTRDC3"},"agent_actions":{"view_html":"https://pith.science/pith/6CWTRDC3I5BTHN67REM6KUNHX3","download_json":"https://pith.science/pith/6CWTRDC3I5BTHN67REM6KUNHX3.json","view_paper":"https://pith.science/paper/6CWTRDC3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2504.14195&json=true","fetch_graph":"https://pith.science/api/pith-number/6CWTRDC3I5BTHN67REM6KUNHX3/graph.json","fetch_events":"https://pith.science/api/pith-number/6CWTRDC3I5BTHN67REM6KUNHX3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6CWTRDC3I5BTHN67REM6KUNHX3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6CWTRDC3I5BTHN67REM6KUNHX3/action/storage_attestation","attest_author":"https://pith.science/pith/6CWTRDC3I5BTHN67REM6KUNHX3/action/author_attestation","sign_citation":"https://pith.science/pith/6CWTRDC3I5BTHN67REM6KUNHX3/action/citation_signature","submit_replication":"https://pith.science/pith/6CWTRDC3I5BTHN67REM6KUNHX3/action/replication_record"}},"created_at":"2026-07-05T10:51:39.630863+00:00","updated_at":"2026-07-05T10:51:39.630863+00:00"}