{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:BUKX2J2FGJJM7ASWQGPS7Z26HU","short_pith_number":"pith:BUKX2J2F","schema_version":"1.0","canonical_sha256":"0d157d27453252cf8256819f2fe75e3d238869f1b6f31b7018bdfbbf27d6fb60","source":{"kind":"arxiv","id":"1704.05795","version":1},"attestation_state":"computed","paper":{"title":"Sorting sums of binary decision summands","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Nils Bl\\\"uthgen, Torsten Gross","submitted_at":"2017-04-19T16:08:15Z","abstract_excerpt":"A sum where each of the $N$ summands can be independently chosen from two choices yields $2^N$ possible summation outcomes. There is an $\\mathcal{O}(K^2)$-algorithm that finds the $K$ smallest/largest of these sums by evading the enumeration of all sums."},"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":"1704.05795","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-04-19T16:08:15Z","cross_cats_sorted":[],"title_canon_sha256":"1a854be9bec4957dbe3804ecaa883e629fc90eca7095dbbd1925429243e50d24","abstract_canon_sha256":"8f1a09eda710a95588a2b876de72df3af95aa8e151a384408a4f6b9d5c0ecfb6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:46:06.559420Z","signature_b64":"3JjOHoG+D0zJf5cCgpzU1M0ocyZqQNdkXwiR3b0I48OTTMEAksvhcLQ+au+OsXCZi628GUCG3IvSeB6YvxeDDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0d157d27453252cf8256819f2fe75e3d238869f1b6f31b7018bdfbbf27d6fb60","last_reissued_at":"2026-05-18T00:46:06.559016Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:46:06.559016Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Sorting sums of binary decision summands","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Nils Bl\\\"uthgen, Torsten Gross","submitted_at":"2017-04-19T16:08:15Z","abstract_excerpt":"A sum where each of the $N$ summands can be independently chosen from two choices yields $2^N$ possible summation outcomes. There is an $\\mathcal{O}(K^2)$-algorithm that finds the $K$ smallest/largest of these sums by evading the enumeration of all sums."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.05795","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":"1704.05795","created_at":"2026-05-18T00:46:06.559078+00:00"},{"alias_kind":"arxiv_version","alias_value":"1704.05795v1","created_at":"2026-05-18T00:46:06.559078+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.05795","created_at":"2026-05-18T00:46:06.559078+00:00"},{"alias_kind":"pith_short_12","alias_value":"BUKX2J2FGJJM","created_at":"2026-05-18T12:31:08.081275+00:00"},{"alias_kind":"pith_short_16","alias_value":"BUKX2J2FGJJM7ASW","created_at":"2026-05-18T12:31:08.081275+00:00"},{"alias_kind":"pith_short_8","alias_value":"BUKX2J2F","created_at":"2026-05-18T12:31:08.081275+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/BUKX2J2FGJJM7ASWQGPS7Z26HU","json":"https://pith.science/pith/BUKX2J2FGJJM7ASWQGPS7Z26HU.json","graph_json":"https://pith.science/api/pith-number/BUKX2J2FGJJM7ASWQGPS7Z26HU/graph.json","events_json":"https://pith.science/api/pith-number/BUKX2J2FGJJM7ASWQGPS7Z26HU/events.json","paper":"https://pith.science/paper/BUKX2J2F"},"agent_actions":{"view_html":"https://pith.science/pith/BUKX2J2FGJJM7ASWQGPS7Z26HU","download_json":"https://pith.science/pith/BUKX2J2FGJJM7ASWQGPS7Z26HU.json","view_paper":"https://pith.science/paper/BUKX2J2F","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1704.05795&json=true","fetch_graph":"https://pith.science/api/pith-number/BUKX2J2FGJJM7ASWQGPS7Z26HU/graph.json","fetch_events":"https://pith.science/api/pith-number/BUKX2J2FGJJM7ASWQGPS7Z26HU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BUKX2J2FGJJM7ASWQGPS7Z26HU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BUKX2J2FGJJM7ASWQGPS7Z26HU/action/storage_attestation","attest_author":"https://pith.science/pith/BUKX2J2FGJJM7ASWQGPS7Z26HU/action/author_attestation","sign_citation":"https://pith.science/pith/BUKX2J2FGJJM7ASWQGPS7Z26HU/action/citation_signature","submit_replication":"https://pith.science/pith/BUKX2J2FGJJM7ASWQGPS7Z26HU/action/replication_record"}},"created_at":"2026-05-18T00:46:06.559078+00:00","updated_at":"2026-05-18T00:46:06.559078+00:00"}