{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:6GGTRKKWLZUBSYTULRFVBLS6AA","short_pith_number":"pith:6GGTRKKW","schema_version":"1.0","canonical_sha256":"f18d38a9565e681962745c4b50ae5e0026a40f030c6fa7f2b3f5fff3561bc24f","source":{"kind":"arxiv","id":"1412.4039","version":1},"attestation_state":"computed","paper":{"title":"Resolving multi-proxy transitive vote delegation","license":"http://creativecommons.org/licenses/by/3.0/","headline":"","cross_cats":[],"primary_cat":"cs.MA","authors_text":"Jonas Degrave","submitted_at":"2014-12-11T13:06:38Z","abstract_excerpt":"Solving a delegation graph for transitive votes is already a non-trivial task for many programmers. When extending the current main paradigm, where each voter can only appoint a single transitive delegation, to a system where each vote can be separated over multiple delegations, solving the delegation graph becomes even harder. This article presents a solution of an example graph, and a non-formal proof of why this algorithm works."},"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":"1412.4039","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"cs.MA","submitted_at":"2014-12-11T13:06:38Z","cross_cats_sorted":[],"title_canon_sha256":"58991f46c3cf67ffdb644f7475dde27ccf2d0b31fd84d598d5b176c471bf7168","abstract_canon_sha256":"5c525e2ea6d375350302b2e5604525c0127aee16af465f4a00624041d7ddc94f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:31:28.048875Z","signature_b64":"5BofhQLwPek3uuUbPewS7IRJEnPQUMiCmck3pNdk8T16qv/D3UXtqfUcsZfP8foDfl9dRtEdKK92J5W+2cArBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f18d38a9565e681962745c4b50ae5e0026a40f030c6fa7f2b3f5fff3561bc24f","last_reissued_at":"2026-05-18T02:31:28.048382Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:31:28.048382Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Resolving multi-proxy transitive vote delegation","license":"http://creativecommons.org/licenses/by/3.0/","headline":"","cross_cats":[],"primary_cat":"cs.MA","authors_text":"Jonas Degrave","submitted_at":"2014-12-11T13:06:38Z","abstract_excerpt":"Solving a delegation graph for transitive votes is already a non-trivial task for many programmers. When extending the current main paradigm, where each voter can only appoint a single transitive delegation, to a system where each vote can be separated over multiple delegations, solving the delegation graph becomes even harder. This article presents a solution of an example graph, and a non-formal proof of why this algorithm works."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.4039","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1412.4039","created_at":"2026-05-18T02:31:28.048459+00:00"},{"alias_kind":"arxiv_version","alias_value":"1412.4039v1","created_at":"2026-05-18T02:31:28.048459+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.4039","created_at":"2026-05-18T02:31:28.048459+00:00"},{"alias_kind":"pith_short_12","alias_value":"6GGTRKKWLZUB","created_at":"2026-05-18T12:28:16.859392+00:00"},{"alias_kind":"pith_short_16","alias_value":"6GGTRKKWLZUBSYTU","created_at":"2026-05-18T12:28:16.859392+00:00"},{"alias_kind":"pith_short_8","alias_value":"6GGTRKKW","created_at":"2026-05-18T12:28:16.859392+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/6GGTRKKWLZUBSYTULRFVBLS6AA","json":"https://pith.science/pith/6GGTRKKWLZUBSYTULRFVBLS6AA.json","graph_json":"https://pith.science/api/pith-number/6GGTRKKWLZUBSYTULRFVBLS6AA/graph.json","events_json":"https://pith.science/api/pith-number/6GGTRKKWLZUBSYTULRFVBLS6AA/events.json","paper":"https://pith.science/paper/6GGTRKKW"},"agent_actions":{"view_html":"https://pith.science/pith/6GGTRKKWLZUBSYTULRFVBLS6AA","download_json":"https://pith.science/pith/6GGTRKKWLZUBSYTULRFVBLS6AA.json","view_paper":"https://pith.science/paper/6GGTRKKW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1412.4039&json=true","fetch_graph":"https://pith.science/api/pith-number/6GGTRKKWLZUBSYTULRFVBLS6AA/graph.json","fetch_events":"https://pith.science/api/pith-number/6GGTRKKWLZUBSYTULRFVBLS6AA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6GGTRKKWLZUBSYTULRFVBLS6AA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6GGTRKKWLZUBSYTULRFVBLS6AA/action/storage_attestation","attest_author":"https://pith.science/pith/6GGTRKKWLZUBSYTULRFVBLS6AA/action/author_attestation","sign_citation":"https://pith.science/pith/6GGTRKKWLZUBSYTULRFVBLS6AA/action/citation_signature","submit_replication":"https://pith.science/pith/6GGTRKKWLZUBSYTULRFVBLS6AA/action/replication_record"}},"created_at":"2026-05-18T02:31:28.048459+00:00","updated_at":"2026-05-18T02:31:28.048459+00:00"}