{"as_of":"2026-08-11T22:05:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:c1e857caa93295d9aaa22e943d4808d002ccadf3f0fb79893027fe7007a63caa","coverage":[{"denominator":69,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":69,"source":"paper_references, paper_reference_links","source_observed_at":"2026-06-29T16:46:43.890086Z","state":"measured"},{"denominator":69,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":69,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-11T06:34:44.6726+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2605.26903/citation-record","integrity":"/paper/2605.26903/integrity","json":"/paper/2605.26903/citation-record.json","paper":"/paper/2605.26903"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-29T16:46:43.890086Z","title":"TitAnt: Online real-time transaction fraud detection in Ant Financial,","venue":null,"work_id":null,"year":2082},"citing_paper":{"arxiv_id":"2605.26903","last_updated":"2026-06-17T08:51:04Z","snapshot_observed_at":"2026-08-07T07:04:59.951692Z","submitted_at":"2026-05-26T12:02:14Z","title":"Practical Anonymous Two-Party Gradient Boosting Decision Tree","version":2},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-06-29T16:46:43.890086Z"},"links":{"citing_paper":"/paper/2605.26903"},"observation_digest":"sha256:d85118fe803472a940c613f01935b97d24d9e39d88ceaf72e95f9c870708ac1b","observation_id":"0fefe17b-3402-4dc2-a803-bcf057f2935c","resolution":{"observed_at":"2026-06-29T16:46:43.890086Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-29T16:46:43.890086Z","title":"Where medical statistics meets artificial intelligence,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2605.26903","last_updated":"2026-06-17T08:51:04Z","snapshot_observed_at":"2026-08-07T07:04:59.951692Z","submitted_at":"2026-05-26T12:02:14Z","title":"Practical Anonymous Two-Party Gradient Boosting Decision Tree","version":2},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-06-29T16:46:43.890086Z"},"links":{"citing_paper":"/paper/2605.26903"},"observation_digest":"sha256:6cb0f388d57a4fad993bd56a7006ffb5f208573bfd1f639e678e0af9daa782bc","observation_id":"8f40272b-76d5-429f-a3db-f2d1f5302266","resolution":{"observed_at":"2026-06-29T16:46:43.890086Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-29T16:46:43.890086Z","title":"Model ensem- ble for click prediction in Bing search ads,","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2605.26903","last_updated":"2026-06-17T08:51:04Z","snapshot_observed_at":"2026-08-07T07:04:59.951692Z","submitted_at":"2026-05-26T12:02:14Z","title":"Practical Anonymous Two-Party Gradient Boosting Decision Tree","version":2},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-06-29T16:46:43.890086Z"},"links":{"citing_paper":"/paper/2605.26903"},"observation_digest":"sha256:8495daa2681f214d6dd519d90b41220d2026ca50b670baab1af5cf546a840db4","observation_id":"66b8be88-65e8-480f-9d43-e2435f19e67e","resolution":{"observed_at":"2026-06-29T16:46:43.890086Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-29T16:46:43.890086Z","title":"SoK: Cryptographic neural-network computation,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2605.26903","last_updated":"2026-06-17T08:51:04Z","snapshot_observed_at":"2026-08-07T07:04:59.951692Z","submitted_at":"2026-05-26T12:02:14Z","title":"Practical Anonymous Two-Party Gradient Boosting Decision Tree","version":2},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-06-29T16:46:43.890086Z"},"links":{"citing_paper":"/paper/2605.26903"},"observation_digest":"sha256:7084d1ef127b542573f97728809fceed9bd841cca9ef4139ba6475003f55d1eb","observation_id":"daa7e9d3-2c4a-4025-a377-57c20a0c4213","resolution":{"observed_at":"2026-06-29T16:46:43.890086Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-29T16:46:43.890086Z","title":"Squirrel: A scalable secure two-party computation framework for training gradient boosting decision tree,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2605.26903","last_updated":"2026-06-17T08:51:04Z","snapshot_observed_at":"2026-08-07T07:04:59.951692Z","submitted_at":"2026-05-26T12:02:14Z","title":"Practical Anonymous Two-Party Gradient Boosting Decision Tree","version":2},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-06-29T16:46:43.890086Z"},"links":{"citing_paper":"/paper/2605.26903"},"observation_digest":"sha256:bef22bd1b92b3c023f50036a8bba08e725f86389727f64a0a603b72e97f9fcd4","observation_id":"80ec16fa-3e3c-49b2-9b7d-e6d72f533d2e","resolution":{"observed_at":"2026-06-29T16:46:43.890086Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-29T16:46:43.890086Z","title":"PriVDT: An efficient two-party cryptographic framework for vertical decision trees,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2605.26903","last_updated":"2026-06-17T08:51:04Z","snapshot_observed_at":"2026-08-07T07:04:59.951692Z","submitted_at":"2026-05-26T12:02:14Z","title":"Practical Anonymous Two-Party Gradient Boosting Decision Tree","version":2},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-06-29T16:46:43.890086Z"},"links":{"citing_paper":"/paper/2605.26903"},"observation_digest":"sha256:892a2b86f7973a810433eeb420a8d586df44e45c4737b4748eec93e72589dc78","observation_id":"5556757e-3517-4fd8-b05a-a1eb4a276685","resolution":{"observed_at":"2026-06-29T16:46:43.890086Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-29T16:46:43.890086Z","title":"Large-scale secure XGB for vertical federated learn- ing,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2605.26903","last_updated":"2026-06-17T08:51:04Z","snapshot_observed_at":"2026-08-07T07:04:59.951692Z","submitted_at":"2026-05-26T12:02:14Z","title":"Practical Anonymous Two-Party Gradient Boosting Decision Tree","version":2},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-06-29T16:46:43.890086Z"},"links":{"citing_paper":"/paper/2605.26903"},"observation_digest":"sha256:75c438618c00382f647101513c48efdb8832f310d77e424caf7d97b691abef08","observation_id":"176655d0-c465-4f29-92ad-fb487d955c47","resolution":{"observed_at":"2026-06-29T16:46:43.890086Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-29T16:46:43.890086Z","title":"Privacy preserv- ing vertical federated learning for tree-based models,","venue":null,"work_id":null,"year":2090},"citing_paper":{"arxiv_id":"2605.26903","last_updated":"2026-06-17T08:51:04Z","snapshot_observed_at":"2026-08-07T07:04:59.951692Z","submitted_at":"2026-05-26T12:02:14Z","title":"Practical Anonymous Two-Party Gradient Boosting Decision Tree","version":2},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-06-29T16:46:43.890086Z"},"links":{"citing_paper":"/paper/2605.26903"},"observation_digest":"sha256:e1a737fe1154a20d182e610750778b6bccae1f0a1f8266b34294c4333fa52666","observation_id":"6f43dde8-f1fd-4a7c-ab14-ff9005df2dcd","resolution":{"observed_at":"2026-06-29T16:46:43.890086Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-29T16:46:43.890086Z","title":"Efficient private matching and set intersection,","venue":null,"work_id":null,"year":2004},"citing_paper":{"arxiv_id":"2605.26903","last_updated":"2026-06-17T08:51:04Z","snapshot_observed_at":"2026-08-07T07:04:59.951692Z","submitted_at":"2026-05-26T12:02:14Z","title":"Practical Anonymous Two-Party Gradient Boosting Decision Tree","version":2},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-06-29T16:46:43.890086Z"},"links":{"citing_paper":"/paper/2605.26903"},"observation_digest":"sha256:65205ebce7a317cc2c40455f574ac68b0b534e7a04959321a5c29bcac48a205a","observation_id":"19a0b60e-93ea-44af-9543-f5d925a25e86","resolution":{"observed_at":"2026-06-29T16:46:43.890086Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-29T16:46:43.890086Z","title":"Efficient batched oblivious PRF with applications to private set intersection,","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2605.26903","last_updated":"2026-06-17T08:51:04Z","snapshot_observed_at":"2026-08-07T07:04:59.951692Z","submitted_at":"2026-05-26T12:02:14Z","title":"Practical Anonymous Two-Party Gradient Boosting Decision Tree","version":2},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-06-29T16:46:43.890086Z"},"links":{"citing_paper":"/paper/2605.26903"},"observation_digest":"sha256:c7e13def7529f279dbe20c26429b3ae6b27364c54e311c10aa902c2444121253","observation_id":"7f110866-3a1b-4c6d-8a42-1d5d5f1476d5","resolution":{"observed_at":"2026-06-29T16:46:43.890086Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-29T16:46:43.890086Z","title":"Unique in the shopping mall: On the reidentifiability of credit card metadata,","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2605.26903","last_updated":"2026-06-17T08:51:04Z","snapshot_observed_at":"2026-08-07T07:04:59.951692Z","submitted_at":"2026-05-26T12:02:14Z","title":"Practical Anonymous Two-Party Gradient Boosting Decision Tree","version":2},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-06-29T16:46:43.890086Z"},"links":{"citing_paper":"/paper/2605.26903"},"observation_digest":"sha256:25d3df63c508bebf0cab952beea257b71fd02add5db318eafd57b47bc37ebfa0","observation_id":"a47f9dc0-d457-4788-b6ba-941d80024554","resolution":{"observed_at":"2026-06-29T16:46:43.890086Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-29T16:46:43.890086Z","title":"On deploying secure computing: Private intersection-sum-with-cardinality,","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2605.26903","last_updated":"2026-06-17T08:51:04Z","snapshot_observed_at":"2026-08-07T07:04:59.951692Z","submitted_at":"2026-05-26T12:02:14Z","title":"Practical Anonymous Two-Party Gradient Boosting Decision Tree","version":2},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-06-29T16:46:43.890086Z"},"links":{"citing_paper":"/paper/2605.26903"},"observation_digest":"sha256:0d41a6f90444c364369593d869dde7da6c11a45c38d618a2c4eb269def6b2dd7","observation_id":"22526bf7-bb8c-4547-95bf-876c9129556f","resolution":{"observed_at":"2026-06-29T16:46:43.890086Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-29T16:46:43.890086Z","title":"Efficient circuit-based PSI with linear communication,","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2605.26903","last_updated":"2026-06-17T08:51:04Z","snapshot_observed_at":"2026-08-07T07:04:59.951692Z","submitted_at":"2026-05-26T12:02:14Z","title":"Practical Anonymous Two-Party Gradient Boosting Decision Tree","version":2},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-06-29T16:46:43.890086Z"},"links":{"citing_paper":"/paper/2605.26903"},"observation_digest":"sha256:96b5bcde801a858bd65c77b300519760a6f2a446f353f0d65a9e50220c1c062d","observation_id":"1a669a5b-bdb0-4368-88ea-6e52798b0203","resolution":{"observed_at":"2026-06-29T16:46:43.890086Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-29T16:46:43.890086Z","title":"VOLE-PSI: Fast OPRF and circuit- PSI from vector-OLE,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2605.26903","last_updated":"2026-06-17T08:51:04Z","snapshot_observed_at":"2026-08-07T07:04:59.951692Z","submitted_at":"2026-05-26T12:02:14Z","title":"Practical Anonymous Two-Party Gradient Boosting Decision Tree","version":2},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-06-29T16:46:43.890086Z"},"links":{"citing_paper":"/paper/2605.26903"},"observation_digest":"sha256:13d618101843bd2936d5234763758f7ebb60250e1443441982db06b7236d80ba","observation_id":"76fa911b-e2be-495e-9545-4163cd640462","resolution":{"observed_at":"2026-06-29T16:46:43.890086Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-29T16:46:43.890086Z","title":"Blazing fast PSI from improved OKVS and subfield VOLE,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2605.26903","last_updated":"2026-06-17T08:51:04Z","snapshot_observed_at":"2026-08-07T07:04:59.951692Z","submitted_at":"2026-05-26T12:02:14Z","title":"Practical Anonymous Two-Party Gradient Boosting Decision Tree","version":2},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-06-29T16:46:43.890086Z"},"links":{"citing_paper":"/paper/2605.26903"},"observation_digest":"sha256:ed81872c48a313790381812206545b3a42d5cdebc5d525b4460b6f1899d7ab0e","observation_id":"87d352fc-a4cf-4bae-8a33-b3b1d6a77340","resolution":{"observed_at":"2026-06-29T16:46:43.890086Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-29T16:46:43.890086Z","title":"PSI- Stats: Private set intersection protocols supporting secure statistical functions,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2605.26903","last_updated":"2026-06-17T08:51:04Z","snapshot_observed_at":"2026-08-07T07:04:59.951692Z","submitted_at":"2026-05-26T12:02:14Z","title":"Practical Anonymous Two-Party Gradient Boosting Decision Tree","version":2},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-06-29T16:46:43.890086Z"},"links":{"citing_paper":"/paper/2605.26903"},"observation_digest":"sha256:f060c479c3f1df6cb42ac29f99b2afd97a9ea7c6429537425796aefeaed54a21","observation_id":"13c66dcf-424b-4678-8989-be3b5ed2287c","resolution":{"observed_at":"2026-06-29T16:46:43.890086Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-29T16:46:43.890086Z","title":"Private set operations from oblivious switching,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2605.26903","last_updated":"2026-06-17T08:51:04Z","snapshot_observed_at":"2026-08-07T07:04:59.951692Z","submitted_at":"2026-05-26T12:02:14Z","title":"Practical Anonymous Two-Party Gradient Boosting Decision Tree","version":2},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-06-29T16:46:43.890086Z"},"links":{"citing_paper":"/paper/2605.26903"},"observation_digest":"sha256:dcda893b7c950e723079dbc7a569af31dbfa1f32036d1f9cf8b6eaecd68d206d","observation_id":"dc873130-83ae-464f-a9b0-0159a7ecd5da","resolution":{"observed_at":"2026-06-29T16:46:43.890086Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-29T16:46:43.890086Z","title":"Secure-computation-friendly pri- vate set intersection from oblivious compact graph evaluation,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2605.26903","last_updated":"2026-06-17T08:51:04Z","snapshot_observed_at":"2026-08-07T07:04:59.951692Z","submitted_at":"2026-05-26T12:02:14Z","title":"Practical Anonymous Two-Party Gradient Boosting Decision Tree","version":2},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-06-29T16:46:43.890086Z"},"links":{"citing_paper":"/paper/2605.26903"},"observation_digest":"sha256:a58288a4d09de75864560a8d99663eadf61971db7642ee2ad61accaab3660be6","observation_id":"a733a273-dd0a-454a-8856-79ffeaab1447","resolution":{"observed_at":"2026-06-29T16:46:43.890086Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-29T16:46:43.890086Z","title":"CrypTFlow2: Practical 2-party secure inference,","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2605.26903","last_updated":"2026-06-17T08:51:04Z","snapshot_observed_at":"2026-08-07T07:04:59.951692Z","submitted_at":"2026-05-26T12:02:14Z","title":"Practical Anonymous Two-Party Gradient Boosting Decision Tree","version":2},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-06-29T16:46:43.890086Z"},"links":{"citing_paper":"/paper/2605.26903"},"observation_digest":"sha256:c8663eabc38295a6785c2d37b2544c322c000dc8bd20b10f97a8b8e1e5a8f0e9","observation_id":"3ebfde90-d503-4eda-ae56-74a88545b538","resolution":{"observed_at":"2026-06-29T16:46:43.890086Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-29T16:46:43.890086Z","title":"Efficient homomorphic conversion between (ring) LWE ciphertexts,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2605.26903","last_updated":"2026-06-17T08:51:04Z","snapshot_observed_at":"2026-08-07T07:04:59.951692Z","submitted_at":"2026-05-26T12:02:14Z","title":"Practical Anonymous Two-Party Gradient Boosting Decision Tree","version":2},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-06-29T16:46:43.890086Z"},"links":{"citing_paper":"/paper/2605.26903"},"observation_digest":"sha256:d0f34a8d617bc6aaa7d14adfec32fe0f3b01759e303a453dee80ebb271551996","observation_id":"da32aab5-6444-42a6-a9b9-dc1ba54f59b1","resolution":{"observed_at":"2026-06-29T16:46:43.890086Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-29T16:46:43.890086Z","title":"Let’s stride blindfolded in a forest: Sublinear multi-client decision trees evaluation,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2605.26903","last_updated":"2026-06-17T08:51:04Z","snapshot_observed_at":"2026-08-07T07:04:59.951692Z","submitted_at":"2026-05-26T12:02:14Z","title":"Practical Anonymous Two-Party Gradient Boosting Decision Tree","version":2},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-06-29T16:46:43.890086Z"},"links":{"citing_paper":"/paper/2605.26903"},"observation_digest":"sha256:d5979ed9c2af0f33277c60aa3ab1e219ca6078fe0779e7e623b555020e37ec82","observation_id":"e9939876-8467-4da9-b8f2-371530247971","resolution":{"observed_at":"2026-06-29T16:46:43.890086Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-29T16:46:43.890086Z","title":"XGBoost: A scalable tree boosting system,","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2605.26903","last_updated":"2026-06-17T08:51:04Z","snapshot_observed_at":"2026-08-07T07:04:59.951692Z","submitted_at":"2026-05-26T12:02:14Z","title":"Practical Anonymous Two-Party Gradient Boosting Decision Tree","version":2},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-06-29T16:46:43.890086Z"},"links":{"citing_paper":"/paper/2605.26903"},"observation_digest":"sha256:690f2823217f00ea5e010b379731924b4c190c7066188d79ae14f7dc4a7157bb","observation_id":"35acd80d-684c-4003-9412-7c518b92c7e1","resolution":{"observed_at":"2026-06-29T16:46:43.890086Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-29T16:46:43.890086Z","title":"LightGBM: A highly efficient gradient boosting decision tree,","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2605.26903","last_updated":"2026-06-17T08:51:04Z","snapshot_observed_at":"2026-08-07T07:04:59.951692Z","submitted_at":"2026-05-26T12:02:14Z","title":"Practical Anonymous Two-Party Gradient Boosting Decision Tree","version":2},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-06-29T16:46:43.890086Z"},"links":{"citing_paper":"/paper/2605.26903"},"observation_digest":"sha256:b58bf92ae9136ae60913e426af2ebfb25231d03ce25eab8c47f53e032c5d13b0","observation_id":"490c4b7d-3145-46b2-acaf-b89c737799ab","resolution":{"observed_at":"2026-06-29T16:46:43.890086Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-29T16:46:43.890086Z","title":"ABY - A framework for efficient mixed-protocol secure two-party computation,","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2605.26903","last_updated":"2026-06-17T08:51:04Z","snapshot_observed_at":"2026-08-07T07:04:59.951692Z","submitted_at":"2026-05-26T12:02:14Z","title":"Practical Anonymous Two-Party Gradient Boosting Decision Tree","version":2},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-06-29T16:46:43.890086Z"},"links":{"citing_paper":"/paper/2605.26903"},"observation_digest":"sha256:978412091d54c8a3d5b9e085cab9236fa6e583b43006b8396687c2707b9732f7","observation_id":"8bb972fb-64a0-4bf3-add8-22547b02fedc","resolution":{"observed_at":"2026-06-29T16:46:43.890086Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-29T16:46:43.890086Z","title":"Efficient multiparty protocols using circuit randomiza- tion,","venue":null,"work_id":null,"year":1991},"citing_paper":{"arxiv_id":"2605.26903","last_updated":"2026-06-17T08:51:04Z","snapshot_observed_at":"2026-08-07T07:04:59.951692Z","submitted_at":"2026-05-26T12:02:14Z","title":"Practical Anonymous Two-Party Gradient Boosting Decision Tree","version":2},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-06-29T16:46:43.890086Z"},"links":{"citing_paper":"/paper/2605.26903"},"observation_digest":"sha256:325a71b9b56185e8f5232254af5f566ced14cce06077c7c1a275c283a7d9904e","observation_id":"421ccd6a-d210-4721-ab9a-8471a9a3d0d5","resolution":{"observed_at":"2026-06-29T16:46:43.890086Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-29T16:46:43.890086Z","title":"Secure computation with fixed-point numbers,","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2605.26903","last_updated":"2026-06-17T08:51:04Z","snapshot_observed_at":"2026-08-07T07:04:59.951692Z","submitted_at":"2026-05-26T12:02:14Z","title":"Practical Anonymous Two-Party Gradient Boosting Decision Tree","version":2},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-06-29T16:46:43.890086Z"},"links":{"citing_paper":"/paper/2605.26903"},"observation_digest":"sha256:370a96947a659007171d04d95805aac7ccc33f8174da170058006de0d75206f4","observation_id":"6fa55e9e-35f6-47ae-b182-d4ed154207c3","resolution":{"observed_at":"2026-06-29T16:46:43.890086Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-29T16:46:43.890086Z","title":"Improved garbled circuit building blocks and applications to auctions and computing minima,","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2605.26903","last_updated":"2026-06-17T08:51:04Z","snapshot_observed_at":"2026-08-07T07:04:59.951692Z","submitted_at":"2026-05-26T12:02:14Z","title":"Practical Anonymous Two-Party Gradient Boosting Decision Tree","version":2},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-06-29T16:46:43.890086Z"},"links":{"citing_paper":"/paper/2605.26903"},"observation_digest":"sha256:c671a57cd4f1cda127ee059c92f4c602d04eb4cb7c120bb0733cb07c0ad5fa55","observation_id":"bafe3ec3-c7cb-4ff0-ac2c-28a5646a8f9c","resolution":{"observed_at":"2026-06-29T16:46:43.890086Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-29T16:46:43.890086Z","title":"How to exchange secrets with oblivious transfer,","venue":null,"work_id":null,"year":2005},"citing_paper":{"arxiv_id":"2605.26903","last_updated":"2026-06-17T08:51:04Z","snapshot_observed_at":"2026-08-07T07:04:59.951692Z","submitted_at":"2026-05-26T12:02:14Z","title":"Practical Anonymous Two-Party Gradient Boosting Decision Tree","version":2},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-06-29T16:46:43.890086Z"},"links":{"citing_paper":"/paper/2605.26903"},"observation_digest":"sha256:1c095d2f6362e215bac915b8e6a953fcee830e979d431ee3cf1856864fee2948","observation_id":"ef4ef021-2213-4378-b102-aa9ed8700f20","resolution":{"observed_at":"2026-06-29T16:46:43.890086Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-29T16:46:43.890086Z","title":"Ferret: Fast extension for correlated OT with small communication,","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2605.26903","last_updated":"2026-06-17T08:51:04Z","snapshot_observed_at":"2026-08-07T07:04:59.951692Z","submitted_at":"2026-05-26T12:02:14Z","title":"Practical Anonymous Two-Party Gradient Boosting Decision Tree","version":2},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-06-29T16:46:43.890086Z"},"links":{"citing_paper":"/paper/2605.26903"},"observation_digest":"sha256:affe09ca8287dd2d7b7fe052a25efd13409c3ec76d50ac6d1636c58d5cf00d67","observation_id":"0e563c75-1b4e-4324-a8af-d3492156e1c7","resolution":{"observed_at":"2026-06-29T16:46:43.890086Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-29T16:46:43.890086Z","title":"Fully homomorphic encryption from ring-lwe and security for key dependent messages,","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2605.26903","last_updated":"2026-06-17T08:51:04Z","snapshot_observed_at":"2026-08-07T07:04:59.951692Z","submitted_at":"2026-05-26T12:02:14Z","title":"Practical Anonymous Two-Party Gradient Boosting Decision Tree","version":2},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-06-29T16:46:43.890086Z"},"links":{"citing_paper":"/paper/2605.26903"},"observation_digest":"sha256:ca2701fe507e0553758e4842c0c6335e95c0c60730c171278fff816eb4af264b","observation_id":"8621d785-569e-439b-aa29-8de75932e526","resolution":{"observed_at":"2026-06-29T16:46:43.890086Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-29T16:46:43.890086Z","title":"Security and composition of multiparty cryptographic protocols,","venue":null,"work_id":null,"year":2000},"citing_paper":{"arxiv_id":"2605.26903","last_updated":"2026-06-17T08:51:04Z","snapshot_observed_at":"2026-08-07T07:04:59.951692Z","submitted_at":"2026-05-26T12:02:14Z","title":"Practical Anonymous Two-Party Gradient Boosting Decision Tree","version":2},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-06-29T16:46:43.890086Z"},"links":{"citing_paper":"/paper/2605.26903"},"observation_digest":"sha256:84952efe467beca0a1cfce5201e356cb07d9e17f49ccde664f69bf4dbb32e33e","observation_id":"11fe90d2-0a38-460a-9db0-765569587254","resolution":{"observed_at":"2026-06-29T16:46:43.890086Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-29T16:46:43.890086Z","title":"Secure softmax/sigmoid for machine-learning computation,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2605.26903","last_updated":"2026-06-17T08:51:04Z","snapshot_observed_at":"2026-08-07T07:04:59.951692Z","submitted_at":"2026-05-26T12:02:14Z","title":"Practical Anonymous Two-Party Gradient Boosting Decision Tree","version":2},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-06-29T16:46:43.890086Z"},"links":{"citing_paper":"/paper/2605.26903"},"observation_digest":"sha256:4b34f14dd5e3f7bbc4972a500e13e80dec1c239b00f84e9abada7d9658bc79f2","observation_id":"7866bcec-ab58-4bbd-bc72-79ae8ed06689","resolution":{"observed_at":"2026-06-29T16:46:43.890086Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-29T16:46:43.890086Z","title":"SHAFT: Secure, handy, accurate, and fast transformer inference,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2605.26903","last_updated":"2026-06-17T08:51:04Z","snapshot_observed_at":"2026-08-07T07:04:59.951692Z","submitted_at":"2026-05-26T12:02:14Z","title":"Practical Anonymous Two-Party Gradient Boosting Decision Tree","version":2},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-06-29T16:46:43.890086Z"},"links":{"citing_paper":"/paper/2605.26903"},"observation_digest":"sha256:b1802bb16304665ad3593fac9e6467eeefee029ac826072443546927a03461d7","observation_id":"5b5ac08b-3c84-4d88-bb8a-82a3533195da","resolution":{"observed_at":"2026-06-29T16:46:43.890086Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-29T16:46:43.890086Z","title":"Communication-efficient secure logistic regression,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2605.26903","last_updated":"2026-06-17T08:51:04Z","snapshot_observed_at":"2026-08-07T07:04:59.951692Z","submitted_at":"2026-05-26T12:02:14Z","title":"Practical Anonymous Two-Party Gradient Boosting Decision Tree","version":2},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-06-29T16:46:43.890086Z"},"links":{"citing_paper":"/paper/2605.26903"},"observation_digest":"sha256:efa34d04ae949c99d8dcf289d4433b68875d72ea6b5baefa08def5c8fd550b38","observation_id":"ea9dfaa5-4516-41b4-bf7a-6ecd9481bdeb","resolution":{"observed_at":"2026-06-29T16:46:43.890086Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-29T16:46:43.890086Z","title":"Are you the one to share? Secret transfer with access structure,","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2605.26903","last_updated":"2026-06-17T08:51:04Z","snapshot_observed_at":"2026-08-07T07:04:59.951692Z","submitted_at":"2026-05-26T12:02:14Z","title":"Practical Anonymous Two-Party Gradient Boosting Decision Tree","version":2},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-06-29T16:46:43.890086Z"},"links":{"citing_paper":"/paper/2605.26903"},"observation_digest":"sha256:938f2019e8bbc0f3d34a93f4eb2d2f308ee75ead6a1b68de59b59298a3e8cf04","observation_id":"f9842fe7-d6dd-4943-9f5f-62b0c23133e7","resolution":{"observed_at":"2026-06-29T16:46:43.890086Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-29T16:46:43.890086Z","title":"Federated transformer: Multi- party vertical federated learning on practical fuzzily linked data,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2605.26903","last_updated":"2026-06-17T08:51:04Z","snapshot_observed_at":"2026-08-07T07:04:59.951692Z","submitted_at":"2026-05-26T12:02:14Z","title":"Practical Anonymous Two-Party Gradient Boosting Decision Tree","version":2},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-06-29T16:46:43.890086Z"},"links":{"citing_paper":"/paper/2605.26903"},"observation_digest":"sha256:d3adac219e2fbec57518c496b1d9fc3ccf5798f0d96be892ec424496b9e14956","observation_id":"48b062f0-e920-4233-8869-17922d902311","resolution":{"observed_at":"2026-06-29T16:46:43.890086Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-29T16:46:43.890086Z","title":"Distributed learning of deep neural network over multiple agents,","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2605.26903","last_updated":"2026-06-17T08:51:04Z","snapshot_observed_at":"2026-08-07T07:04:59.951692Z","submitted_at":"2026-05-26T12:02:14Z","title":"Practical Anonymous Two-Party Gradient Boosting Decision Tree","version":2},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-06-29T16:46:43.890086Z"},"links":{"citing_paper":"/paper/2605.26903"},"observation_digest":"sha256:af06be2f896d32934e49fe4cbabe678e81fe634c75120c492effcf9c7e40b8e8","observation_id":"a0a2c926-e028-45a3-8e5f-15c2e13e588a","resolution":{"observed_at":"2026-06-29T16:46:43.890086Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-29T16:46:43.890086Z","title":"Cheetah: Lean and fast secure two-party deep neu- ral network inference,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2605.26903","last_updated":"2026-06-17T08:51:04Z","snapshot_observed_at":"2026-08-07T07:04:59.951692Z","submitted_at":"2026-05-26T12:02:14Z","title":"Practical Anonymous Two-Party Gradient Boosting Decision Tree","version":2},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-06-29T16:46:43.890086Z"},"links":{"citing_paper":"/paper/2605.26903"},"observation_digest":"sha256:7e54d7851905129037d6910421298b52a1774a28ccfc1c513711bed669fcaabc","observation_id":"05a4cbd5-b7fe-4c72-bb4f-69863c8ac9aa","resolution":{"observed_at":"2026-06-29T16:46:43.890086Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-29T16:46:43.890086Z","title":"Homomorphic encryption for arithmetic of approximate numbers,","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2605.26903","last_updated":"2026-06-17T08:51:04Z","snapshot_observed_at":"2026-08-07T07:04:59.951692Z","submitted_at":"2026-05-26T12:02:14Z","title":"Practical Anonymous Two-Party Gradient Boosting Decision Tree","version":2},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-06-29T16:46:43.890086Z"},"links":{"citing_paper":"/paper/2605.26903"},"observation_digest":"sha256:9967abfa128c582d9e45abe7f669dd507be537346cac9118c05463542d163a16","observation_id":"57ffe028-ad4c-4bdb-be49-b46526016c54","resolution":{"observed_at":"2026-06-29T16:46:43.890086Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-29T16:46:43.890086Z","title":"Microsoft SEAL (release 4.1),","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2605.26903","last_updated":"2026-06-17T08:51:04Z","snapshot_observed_at":"2026-08-07T07:04:59.951692Z","submitted_at":"2026-05-26T12:02:14Z","title":"Practical Anonymous Two-Party Gradient Boosting Decision Tree","version":2},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-06-29T16:46:43.890086Z"},"links":{"citing_paper":"/paper/2605.26903"},"observation_digest":"sha256:6120507dcccdafdd3810a1d5de1bf1c8a8fad711af475130909f62c5c095a41d","observation_id":"a76dfdb3-0ead-45a0-88c9-b8cc870dd7b4","resolution":{"observed_at":"2026-06-29T16:46:43.890086Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-29T16:46:43.890086Z","title":"LIBSVM data: Classification (binary class),","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2605.26903","last_updated":"2026-06-17T08:51:04Z","snapshot_observed_at":"2026-08-07T07:04:59.951692Z","submitted_at":"2026-05-26T12:02:14Z","title":"Practical Anonymous Two-Party Gradient Boosting Decision Tree","version":2},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-06-29T16:46:43.890086Z"},"links":{"citing_paper":"/paper/2605.26903"},"observation_digest":"sha256:e78662f2685347a44f05c2d876fedacb1926156c41d458aad0dbd0f683e03db6","observation_id":"377ab702-b8b7-4c4b-a268-462d0dc32d97","resolution":{"observed_at":"2026-06-29T16:46:43.890086Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-29T16:46:43.890086Z","title":"eXtreme gradient boosting,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2605.26903","last_updated":"2026-06-17T08:51:04Z","snapshot_observed_at":"2026-08-07T07:04:59.951692Z","submitted_at":"2026-05-26T12:02:14Z","title":"Practical Anonymous Two-Party Gradient Boosting Decision Tree","version":2},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-06-29T16:46:43.890086Z"},"links":{"citing_paper":"/paper/2605.26903"},"observation_digest":"sha256:9b4ae9a7897ce1b46b63eae57c2b1b5d5c6fa451082fc1986e640b1713bfdc8e","observation_id":"9b935c78-2de2-41d8-92a0-d1fb722ae57e","resolution":{"observed_at":"2026-06-29T16:46:43.890086Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-29T16:46:43.890086Z","title":"Efficient permu- tation correlations and batched random access for two-party compu- tation,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2605.26903","last_updated":"2026-06-17T08:51:04Z","snapshot_observed_at":"2026-08-07T07:04:59.951692Z","submitted_at":"2026-05-26T12:02:14Z","title":"Practical Anonymous Two-Party Gradient Boosting Decision Tree","version":2},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-06-29T16:46:43.890086Z"},"links":{"citing_paper":"/paper/2605.26903"},"observation_digest":"sha256:5eab33eeb368820e31b318df3923e5d9d76c0971916e0728bbc0793fb8723df1","observation_id":"70d06686-48ff-4dea-97d5-2d6ca7f92c20","resolution":{"observed_at":"2026-06-29T16:46:43.890086Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-29T16:46:43.890086Z","title":"Private matching for compute,","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2605.26903","last_updated":"2026-06-17T08:51:04Z","snapshot_observed_at":"2026-08-07T07:04:59.951692Z","submitted_at":"2026-05-26T12:02:14Z","title":"Practical Anonymous Two-Party Gradient Boosting Decision Tree","version":2},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-06-29T16:46:43.890086Z"},"links":{"citing_paper":"/paper/2605.26903"},"observation_digest":"sha256:bcc43d201ef1f6d000e908036eb3dc86c3b4ad21253419a22cf70d908eb1df51","observation_id":"9c81380a-aa8e-4cc5-8c3e-e3e8db8a73c3","resolution":{"observed_at":"2026-06-29T16:46:43.890086Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-29T16:46:43.890086Z","title":"Can you find the one for me?","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2605.26903","last_updated":"2026-06-17T08:51:04Z","snapshot_observed_at":"2026-08-07T07:04:59.951692Z","submitted_at":"2026-05-26T12:02:14Z","title":"Practical Anonymous Two-Party Gradient Boosting Decision Tree","version":2},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-06-29T16:46:43.890086Z"},"links":{"citing_paper":"/paper/2605.26903"},"observation_digest":"sha256:700be5ea2ff8b333c69f665c66158abce2a3d490761ba6eb9ffcdee2cc8d455e","observation_id":"391a6bcf-01d6-46f7-8d32-71d3023278f8","resolution":{"observed_at":"2026-06-29T16:46:43.890086Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-29T16:46:43.890086Z","title":"Privacy preserving data mining,","venue":null,"work_id":null,"year":2000},"citing_paper":{"arxiv_id":"2605.26903","last_updated":"2026-06-17T08:51:04Z","snapshot_observed_at":"2026-08-07T07:04:59.951692Z","submitted_at":"2026-05-26T12:02:14Z","title":"Practical Anonymous Two-Party Gradient Boosting Decision Tree","version":2},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-06-29T16:46:43.890086Z"},"links":{"citing_paper":"/paper/2605.26903"},"observation_digest":"sha256:59a000f6ca2c6c365f100ceeee72b8329082f1b5e4c7d467de06bd047f57dcc3","observation_id":"3b8e15d6-4434-499f-a6eb-aa083374c793","resolution":{"observed_at":"2026-06-29T16:46:43.890086Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-29T16:46:43.890086Z","title":"Understanding privacy risk of publishing decision trees,","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2605.26903","last_updated":"2026-06-17T08:51:04Z","snapshot_observed_at":"2026-08-07T07:04:59.951692Z","submitted_at":"2026-05-26T12:02:14Z","title":"Practical Anonymous Two-Party Gradient Boosting Decision Tree","version":2},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-06-29T16:46:43.890086Z"},"links":{"citing_paper":"/paper/2605.26903"},"observation_digest":"sha256:5772dc1e47d954298ed541d947eacec025e015caf1724f19b6a74e5cd2cc05e2","observation_id":"9a3ad2e7-bb26-4d3a-b426-3eea0e4eed05","resolution":{"observed_at":"2026-06-29T16:46:43.890086Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-29T16:46:43.890086Z","title":"SecureXGB: A secure and efficient multi-party protocol for vertical federated XGBoost,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2605.26903","last_updated":"2026-06-17T08:51:04Z","snapshot_observed_at":"2026-08-07T07:04:59.951692Z","submitted_at":"2026-05-26T12:02:14Z","title":"Practical Anonymous Two-Party Gradient Boosting Decision Tree","version":2},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-06-29T16:46:43.890086Z"},"links":{"citing_paper":"/paper/2605.26903"},"observation_digest":"sha256:f83b19809336cff9fece005bf12490c9251bc0718d3e8e6139a7c6d64975de45","observation_id":"7fc31a0f-9e22-4aa0-be3c-16d5f44b107e","resolution":{"observed_at":"2026-06-29T16:46:43.890086Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-29T16:46:43.890086Z","title":"Efficient de- cision tree training with new data structure for secure multi-party computation,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2605.26903","last_updated":"2026-06-17T08:51:04Z","snapshot_observed_at":"2026-08-07T07:04:59.951692Z","submitted_at":"2026-05-26T12:02:14Z","title":"Practical Anonymous Two-Party Gradient Boosting Decision Tree","version":2},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-06-29T16:46:43.890086Z"},"links":{"citing_paper":"/paper/2605.26903"},"observation_digest":"sha256:ffd812417099ffbe7fd13ea505d64e921cb0487993cbdfaf40d03b33f94198de","observation_id":"27459112-b034-44b8-b2ed-51b48667de15","resolution":{"observed_at":"2026-06-29T16:46:43.890086Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-29T16:46:43.890086Z","title":"Securely training decision trees efficiently,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2605.26903","last_updated":"2026-06-17T08:51:04Z","snapshot_observed_at":"2026-08-07T07:04:59.951692Z","submitted_at":"2026-05-26T12:02:14Z","title":"Practical Anonymous Two-Party Gradient Boosting Decision Tree","version":2},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-06-29T16:46:43.890086Z"},"links":{"citing_paper":"/paper/2605.26903"},"observation_digest":"sha256:a0c4f8a082f0934920b2188d2fe190030e7a820b2152050ae9599c6d95a644f6","observation_id":"596073a2-333e-48b1-9e62-cc2aeab91731","resolution":{"observed_at":"2026-06-29T16:46:43.890086Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-29T16:46:43.890086Z","title":"Ents: An efficient three-party training framework for decision trees by communication optimization,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2605.26903","last_updated":"2026-06-17T08:51:04Z","snapshot_observed_at":"2026-08-07T07:04:59.951692Z","submitted_at":"2026-05-26T12:02:14Z","title":"Practical Anonymous Two-Party Gradient Boosting Decision Tree","version":2},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-06-29T16:46:43.890086Z"},"links":{"citing_paper":"/paper/2605.26903"},"observation_digest":"sha256:2305b3d3936633fec910e850f145fdcd25c2aff01cc7aa389745d65de8d12342","observation_id":"2b61ce1d-96ec-4eca-8f97-d70de0dbbbfc","resolution":{"observed_at":"2026-06-29T16:46:43.890086Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-29T16:46:43.890086Z","title":"SecureBoost: A lossless federated learning framework,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2605.26903","last_updated":"2026-06-17T08:51:04Z","snapshot_observed_at":"2026-08-07T07:04:59.951692Z","submitted_at":"2026-05-26T12:02:14Z","title":"Practical Anonymous Two-Party Gradient Boosting Decision Tree","version":2},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-06-29T16:46:43.890086Z"},"links":{"citing_paper":"/paper/2605.26903"},"observation_digest":"sha256:f5ff61d537e1547480d75d5a7a3ffda46459e98c372fe9d196f5108fba6ddd56","observation_id":"c9bb6793-d2dc-4711-a374-d92a0cd5bfa4","resolution":{"observed_at":"2026-06-29T16:46:43.890086Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-29T16:46:43.890086Z","title":"VF2Boost: Very fast vertical federated gradient boosting for cross- enterprise learning,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2605.26903","last_updated":"2026-06-17T08:51:04Z","snapshot_observed_at":"2026-08-07T07:04:59.951692Z","submitted_at":"2026-05-26T12:02:14Z","title":"Practical Anonymous Two-Party Gradient Boosting Decision Tree","version":2},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-06-29T16:46:43.890086Z"},"links":{"citing_paper":"/paper/2605.26903"},"observation_digest":"sha256:2bdfd796d3b9245327c0c035444d6465fdfc94f29b628185c965ba33c8c369ea","observation_id":"5788c7cf-59cf-484e-a8e8-f5affbfa2156","resolution":{"observed_at":"2026-06-29T16:46:43.890086Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-29T16:46:43.890086Z","title":"Label inference attacks against vertical federated learning,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2605.26903","last_updated":"2026-06-17T08:51:04Z","snapshot_observed_at":"2026-08-07T07:04:59.951692Z","submitted_at":"2026-05-26T12:02:14Z","title":"Practical Anonymous Two-Party Gradient Boosting Decision Tree","version":2},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-06-29T16:46:43.890086Z"},"links":{"citing_paper":"/paper/2605.26903"},"observation_digest":"sha256:3bbc5824f961e1c007d396f3d7c9da91b0bf05c7af345cefecd352baaf0297e6","observation_id":"aaba8afe-26f3-4337-a61f-20ac066f710e","resolution":{"observed_at":"2026-06-29T16:46:43.890086Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2307.10318","last_updated":"2023-10-22T11:17:52Z","snapshot_observed_at":"2026-07-06T15:56:03.875184Z","submitted_at":"2023-07-19T06:28:12Z","title":"Eliminating Label Leakage in Tree-Based Vertical Federated Learning","version":2},"cited_work":{"arxiv_id":"2307.10318","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2307.10318","snapshot_observed_at":"2026-06-29T16:53:40.975833Z","title":"Eliminating label leakage in tree- based vertical federated learning","venue":null,"work_id":"58aa1781-97b6-47a3-a065-e5033fabfd4b","year":2023},"citing_paper":{"arxiv_id":"2605.26903","last_updated":"2026-06-17T08:51:04Z","snapshot_observed_at":"2026-08-07T07:04:59.951692Z","submitted_at":"2026-05-26T12:02:14Z","title":"Practical Anonymous Two-Party Gradient Boosting Decision Tree","version":2},"reference_index":55,"source":"pdf_text","source_observed_at":"2026-06-29T16:46:43.890086Z"},"links":{"cited_paper":"/paper/2307.10318","citing_paper":"/paper/2605.26903"},"observation_digest":"sha256:374e5428433c24a66721cba2ea1c3df712a06fbf44814c28fbc9fb8793957ff3","observation_id":"536ce304-968f-45e2-bec1-23e30c2e21d5","resolution":{"observed_at":"2026-06-29T16:53:40.977427Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-29T16:46:43.890086Z","title":"Practical secure decision tree learning in a teletreatment application,","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2605.26903","last_updated":"2026-06-17T08:51:04Z","snapshot_observed_at":"2026-08-07T07:04:59.951692Z","submitted_at":"2026-05-26T12:02:14Z","title":"Practical Anonymous Two-Party Gradient Boosting Decision Tree","version":2},"reference_index":56,"source":"pdf_text","source_observed_at":"2026-06-29T16:46:43.890086Z"},"links":{"citing_paper":"/paper/2605.26903"},"observation_digest":"sha256:c8d1b709b1b213b69bde15ce4816e0f267cb40682dbc82c9088acdce935788cf","observation_id":"d3196542-603d-4a06-b9dc-d96c0948c077","resolution":{"observed_at":"2026-06-29T16:46:43.890086Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-29T16:46:43.890086Z","title":"Secure training of decision trees with continuous attributes,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2605.26903","last_updated":"2026-06-17T08:51:04Z","snapshot_observed_at":"2026-08-07T07:04:59.951692Z","submitted_at":"2026-05-26T12:02:14Z","title":"Practical Anonymous Two-Party Gradient Boosting Decision Tree","version":2},"reference_index":57,"source":"pdf_text","source_observed_at":"2026-06-29T16:46:43.890086Z"},"links":{"citing_paper":"/paper/2605.26903"},"observation_digest":"sha256:a596f0828c89a25eb65e2b7584471b6ebf9a228f721b4c034ea2d478fe2c9476","observation_id":"56c486b2-718f-4e63-988a-63d0a7c84600","resolution":{"observed_at":"2026-06-29T16:46:43.890086Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-29T16:46:43.890086Z","title":"SiGBDT: Large-scale gradient boosting decision tree training via function secret sharing,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2605.26903","last_updated":"2026-06-17T08:51:04Z","snapshot_observed_at":"2026-08-07T07:04:59.951692Z","submitted_at":"2026-05-26T12:02:14Z","title":"Practical Anonymous Two-Party Gradient Boosting Decision Tree","version":2},"reference_index":58,"source":"pdf_text","source_observed_at":"2026-06-29T16:46:43.890086Z"},"links":{"citing_paper":"/paper/2605.26903"},"observation_digest":"sha256:21329b7660331bd1db8f997c82715b226925cc0968fac513ddd350d750ecb79d","observation_id":"5abcb33d-1e9f-4eb8-9800-969cef7b8b33","resolution":{"observed_at":"2026-06-29T16:46:43.890086Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-29T16:46:43.890086Z","title":"NodeGuard: A highly efficient two-party computation framework for training large-scale gradient boosting decision tree,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2605.26903","last_updated":"2026-06-17T08:51:04Z","snapshot_observed_at":"2026-08-07T07:04:59.951692Z","submitted_at":"2026-05-26T12:02:14Z","title":"Practical Anonymous Two-Party Gradient Boosting Decision Tree","version":2},"reference_index":59,"source":"pdf_text","source_observed_at":"2026-06-29T16:46:43.890086Z"},"links":{"citing_paper":"/paper/2605.26903"},"observation_digest":"sha256:623773457ce987581fb5b48b0f74cfd7deec93a540933d7f20720a9af4e883d4","observation_id":"3923713d-e690-4e14-90cd-597190413791","resolution":{"observed_at":"2026-06-29T16:46:43.890086Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-29T16:46:43.890086Z","title":"SoK: Privacy-preserving collaborative tree-based model learning,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2605.26903","last_updated":"2026-06-17T08:51:04Z","snapshot_observed_at":"2026-08-07T07:04:59.951692Z","submitted_at":"2026-05-26T12:02:14Z","title":"Practical Anonymous Two-Party Gradient Boosting Decision Tree","version":2},"reference_index":60,"source":"pdf_text","source_observed_at":"2026-06-29T16:46:43.890086Z"},"links":{"citing_paper":"/paper/2605.26903"},"observation_digest":"sha256:b9182b4a772fe566db4a4b68ce2b397e866ba438ec27f96caa9897168d513824","observation_id":"5a1c7aa1-ccfe-4f6d-af9e-a7c4cfb2fe43","resolution":{"observed_at":"2026-06-29T16:46:43.890086Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2106.05508","last_updated":"2021-06-10T05:26:50Z","snapshot_observed_at":"2026-08-11T17:50:56.299472Z","submitted_at":"2021-06-10T05:26:50Z","title":"Vertical Federated Learning without Revealing Intersection Membership","version":1},"cited_work":{"arxiv_id":"2106.05508","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2106.05508","snapshot_observed_at":"2026-06-29T16:53:40.978601Z","title":"Vertical federated learning without revealing intersection member- ship,","venue":null,"work_id":"e2d09300-5757-48ae-8b22-5378c99b428e","year":2021},"citing_paper":{"arxiv_id":"2605.26903","last_updated":"2026-06-17T08:51:04Z","snapshot_observed_at":"2026-08-07T07:04:59.951692Z","submitted_at":"2026-05-26T12:02:14Z","title":"Practical Anonymous Two-Party Gradient Boosting Decision Tree","version":2},"reference_index":61,"source":"pdf_text","source_observed_at":"2026-06-29T16:46:43.890086Z"},"links":{"cited_paper":"/paper/2106.05508","citing_paper":"/paper/2605.26903"},"observation_digest":"sha256:40ebfbb27d281cb6773439a235c8d5dd7129088078b2129df92d6748b560091c","observation_id":"996cfd1b-832f-45dd-b78d-f2428e659d66","resolution":{"observed_at":"2026-06-29T16:53:40.980090Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-29T16:46:43.890086Z","title":"OpenVFL: A vertical federated learn- ing framework with stronger privacy-preserving,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2605.26903","last_updated":"2026-06-17T08:51:04Z","snapshot_observed_at":"2026-08-07T07:04:59.951692Z","submitted_at":"2026-05-26T12:02:14Z","title":"Practical Anonymous Two-Party Gradient Boosting Decision Tree","version":2},"reference_index":62,"source":"pdf_text","source_observed_at":"2026-06-29T16:46:43.890086Z"},"links":{"citing_paper":"/paper/2605.26903"},"observation_digest":"sha256:7a6d0a53cc2cf03268a1e92ae6d79f1977afb53386aa858bf020bbbfdb5048e5","observation_id":"bad7ad0a-5a39-45fa-854c-955d4213967f","resolution":{"observed_at":"2026-06-29T16:46:43.890086Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-29T16:46:43.890086Z","title":"Improved multiplication triple generation over rings via RLWE-based AHE,","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2605.26903","last_updated":"2026-06-17T08:51:04Z","snapshot_observed_at":"2026-08-07T07:04:59.951692Z","submitted_at":"2026-05-26T12:02:14Z","title":"Practical Anonymous Two-Party Gradient Boosting Decision Tree","version":2},"reference_index":63,"source":"pdf_text","source_observed_at":"2026-06-29T16:46:43.890086Z"},"links":{"citing_paper":"/paper/2605.26903"},"observation_digest":"sha256:cd6b5a119acccaf054a250162198100881c3878d09ad3e114ce284fe0372f90d","observation_id":"d488a5aa-c2a0-48f8-ba51-89798748ef05","resolution":{"observed_at":"2026-06-29T16:46:43.890086Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-29T16:46:43.890086Z","title":"(Leveled) fully ho- momorphic encryption without bootstrapping,","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2605.26903","last_updated":"2026-06-17T08:51:04Z","snapshot_observed_at":"2026-08-07T07:04:59.951692Z","submitted_at":"2026-05-26T12:02:14Z","title":"Practical Anonymous Two-Party Gradient Boosting Decision Tree","version":2},"reference_index":64,"source":"pdf_text","source_observed_at":"2026-06-29T16:46:43.890086Z"},"links":{"citing_paper":"/paper/2605.26903"},"observation_digest":"sha256:811ac9cffcf3af796934537b57950bd8e6a9cb9edc743c5c79d7d399defd4f46","observation_id":"af7b80a3-6dc5-452c-91e4-ea78585f82b5","resolution":{"observed_at":"2026-06-29T16:46:43.890086Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-29T16:46:43.890086Z","title":"Linear private set union from multi-query reverse private membership test,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2605.26903","last_updated":"2026-06-17T08:51:04Z","snapshot_observed_at":"2026-08-07T07:04:59.951692Z","submitted_at":"2026-05-26T12:02:14Z","title":"Practical Anonymous Two-Party Gradient Boosting Decision Tree","version":2},"reference_index":65,"source":"pdf_text","source_observed_at":"2026-06-29T16:46:43.890086Z"},"links":{"citing_paper":"/paper/2605.26903"},"observation_digest":"sha256:829ffc68be29663eede864d2ee2540d46119aa3ceb404cdf43836e99af063887","observation_id":"abc04db9-ed5c-4dfd-9e37-9563d3fee350","resolution":{"observed_at":"2026-06-29T16:46:43.890086Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-29T16:46:43.890086Z","title":"ThenScomputes⟨b ∗⟩B 0 =⟨b ∗⟩B 1 ⊕fM0[z∗B+u ∗]; elseSplays the sender ofF OT with input of the XOR of randomly chosenr(=⟨b ∗⟩B 0 ) and⟨ fM1⟩B 0 as in Line 8","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2605.26903","last_updated":"2026-06-17T08:51:04Z","snapshot_observed_at":"2026-08-07T07:04:59.951692Z","submitted_at":"2026-05-26T12:02:14Z","title":"Practical Anonymous Two-Party Gradient Boosting Decision Tree","version":2},"reference_index":66,"source":"pdf_text","source_observed_at":"2026-06-29T16:46:43.890086Z"},"links":{"citing_paper":"/paper/2605.26903"},"observation_digest":"sha256:3dccd38c5084a4e3075639f41056f10236d1f37288cd6ad682777c66e2a94f29","observation_id":"d02502ea-b94a-44dc-a818-eacb48416979","resolution":{"observed_at":"2026-06-29T16:46:43.890086Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-29T16:46:43.890086Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2605.26903","last_updated":"2026-06-17T08:51:04Z","snapshot_observed_at":"2026-08-07T07:04:59.951692Z","submitted_at":"2026-05-26T12:02:14Z","title":"Practical Anonymous Two-Party Gradient Boosting Decision Tree","version":2},"reference_index":67,"source":"pdf_text","source_observed_at":"2026-06-29T16:46:43.890086Z"},"links":{"citing_paper":"/paper/2605.26903"},"observation_digest":"sha256:7fe3a95eb7c8dbb5ac3f829033487ff0263375f7d5332a2e94135d1c29607cf1","observation_id":"8cde752d-12a2-4d92-a04e-a518ec74cef7","resolution":{"observed_at":"2026-06-29T16:46:43.890086Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-29T16:46:43.890086Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2605.26903","last_updated":"2026-06-17T08:51:04Z","snapshot_observed_at":"2026-08-07T07:04:59.951692Z","submitted_at":"2026-05-26T12:02:14Z","title":"Practical Anonymous Two-Party Gradient Boosting Decision Tree","version":2},"reference_index":68,"source":"pdf_text","source_observed_at":"2026-06-29T16:46:43.890086Z"},"links":{"citing_paper":"/paper/2605.26903"},"observation_digest":"sha256:f88b41f0b7ff97648fad94f0752ee645fabb330a1e3bfdb4526e131ab024afa8","observation_id":"81a14e54-7086-4292-b090-35fd8b355fef","resolution":{"observed_at":"2026-06-29T16:46:43.890086Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-29T16:46:43.890086Z","title":"To prove the simulation is indistinguishable from the real protocol, we consider the following hybrids","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2605.26903","last_updated":"2026-06-17T08:51:04Z","snapshot_observed_at":"2026-08-07T07:04:59.951692Z","submitted_at":"2026-05-26T12:02:14Z","title":"Practical Anonymous Two-Party Gradient Boosting Decision Tree","version":2},"reference_index":69,"source":"pdf_text","source_observed_at":"2026-06-29T16:46:43.890086Z"},"links":{"citing_paper":"/paper/2605.26903"},"observation_digest":"sha256:9ff29e6bb0d235557fe49b70e57d543d52ce86142833279f475b0f0ca71ecaca","observation_id":"460a3d29-4e4e-4e0a-b9af-6ea4e86bf4c1","resolution":{"observed_at":"2026-06-29T16:46:43.890086Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2605.26903","last_updated":"2026-06-17T08:51:04Z","latest_version":2,"primary_category":"cs.CR","snapshot_observed_at":"2026-08-07T07:04:59.951692Z","submitted_at":"2026-05-26T12:02:14Z","title":"Practical Anonymous Two-Party Gradient Boosting Decision Tree"},"reference_resolution":{"displayed":69,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":67,"verified_exact":2,"verified_fuzzy":0},"total_outbound_references":69},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"thesis":"As of 11 August 2026, this Paper Citation Record lists 69 of 69 outbound references and 0 inbound Pith citation observations for arXiv:2605.26903."}