{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:DFZQBGLNIMRR76AZ5RBS5ELWTI","short_pith_number":"pith:DFZQBGLN","schema_version":"1.0","canonical_sha256":"197300996d43231ff819ec432e91769a354b6390c08ac59319920e9c10aef737","source":{"kind":"arxiv","id":"2401.06125","version":2},"attestation_state":"computed","paper":{"title":"Improved Capacity Outer Bound for Private Quadratic Monomial Computation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Eirik Rosnes, Hsuan-Yin Lin, Karen M. D{\\ae}hli, Sarah A Obead","submitted_at":"2024-01-11T18:58:57Z","abstract_excerpt":"In private computation, a user wishes to retrieve a function evaluation of messages stored on a set of databases without revealing the function's identity to the databases. Obead \\emph{et al.} introduced a capacity outer bound for private nonlinear computation, dependent on the order of the candidate functions. Focusing on private \\emph{quadratic monomial} computation, we propose three methods for ordering candidate functions: a graph edge-coloring method, a graph-distance method, and an entropy-based greedy method. We confirm, via an exhaustive search, that all three methods yield an optimal "},"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":"2401.06125","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2024-01-11T18:58:57Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"9992a08fa305f4355107125711386b265d26991790ceefc4fb4e6c6460e72776","abstract_canon_sha256":"cef4d7c128d38d98b06f9ebc5fdb291d17006eae9bf4bb6b291654780c4c78c5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:49:17.330214Z","signature_b64":"VZdkKpeJjgWwJ511hbueQsfw9TCp4YFYZ/H38d314wHA7I4vYoZIjz/rBzMPFIO80WRnKrV/2JF2AAbZWnmLAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"197300996d43231ff819ec432e91769a354b6390c08ac59319920e9c10aef737","last_reissued_at":"2026-07-05T07:49:17.329673Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:49:17.329673Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Improved Capacity Outer Bound for Private Quadratic Monomial Computation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Eirik Rosnes, Hsuan-Yin Lin, Karen M. D{\\ae}hli, Sarah A Obead","submitted_at":"2024-01-11T18:58:57Z","abstract_excerpt":"In private computation, a user wishes to retrieve a function evaluation of messages stored on a set of databases without revealing the function's identity to the databases. Obead \\emph{et al.} introduced a capacity outer bound for private nonlinear computation, dependent on the order of the candidate functions. Focusing on private \\emph{quadratic monomial} computation, we propose three methods for ordering candidate functions: a graph edge-coloring method, a graph-distance method, and an entropy-based greedy method. We confirm, via an exhaustive search, that all three methods yield an optimal "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2401.06125","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/2401.06125/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":"2401.06125","created_at":"2026-07-05T07:49:17.329733+00:00"},{"alias_kind":"arxiv_version","alias_value":"2401.06125v2","created_at":"2026-07-05T07:49:17.329733+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2401.06125","created_at":"2026-07-05T07:49:17.329733+00:00"},{"alias_kind":"pith_short_12","alias_value":"DFZQBGLNIMRR","created_at":"2026-07-05T07:49:17.329733+00:00"},{"alias_kind":"pith_short_16","alias_value":"DFZQBGLNIMRR76AZ","created_at":"2026-07-05T07:49:17.329733+00:00"},{"alias_kind":"pith_short_8","alias_value":"DFZQBGLN","created_at":"2026-07-05T07:49:17.329733+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2508.17172","citing_title":"VROOM - Visual Reconstruction over Onboard Multiview","ref_index":8,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/DFZQBGLNIMRR76AZ5RBS5ELWTI","json":"https://pith.science/pith/DFZQBGLNIMRR76AZ5RBS5ELWTI.json","graph_json":"https://pith.science/api/pith-number/DFZQBGLNIMRR76AZ5RBS5ELWTI/graph.json","events_json":"https://pith.science/api/pith-number/DFZQBGLNIMRR76AZ5RBS5ELWTI/events.json","paper":"https://pith.science/paper/DFZQBGLN"},"agent_actions":{"view_html":"https://pith.science/pith/DFZQBGLNIMRR76AZ5RBS5ELWTI","download_json":"https://pith.science/pith/DFZQBGLNIMRR76AZ5RBS5ELWTI.json","view_paper":"https://pith.science/paper/DFZQBGLN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2401.06125&json=true","fetch_graph":"https://pith.science/api/pith-number/DFZQBGLNIMRR76AZ5RBS5ELWTI/graph.json","fetch_events":"https://pith.science/api/pith-number/DFZQBGLNIMRR76AZ5RBS5ELWTI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DFZQBGLNIMRR76AZ5RBS5ELWTI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DFZQBGLNIMRR76AZ5RBS5ELWTI/action/storage_attestation","attest_author":"https://pith.science/pith/DFZQBGLNIMRR76AZ5RBS5ELWTI/action/author_attestation","sign_citation":"https://pith.science/pith/DFZQBGLNIMRR76AZ5RBS5ELWTI/action/citation_signature","submit_replication":"https://pith.science/pith/DFZQBGLNIMRR76AZ5RBS5ELWTI/action/replication_record"}},"created_at":"2026-07-05T07:49:17.329733+00:00","updated_at":"2026-07-05T07:49:17.329733+00:00"}