{"as_of":"2026-08-16T17:57:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:f3d014112f92bc7cc8fa230a3846cd5e499d3dfb3b9ad5d56febe815b7da0b90","coverage":[{"denominator":13,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":13,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-14T14:10:23.290296Z","state":"measured"},{"denominator":13,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":13,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-16T06:30:59.297886+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/1908.03718/citation-record","integrity":"/paper/1908.03718/integrity","json":"/paper/1908.03718/citation-record.json","paper":"/paper/1908.03718"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:10:23.644991Z","title":null,"venue":null,"work_id":"7664bfbb-47a3-4de6-826a-1833db320423","year":null},"citing_paper":{"arxiv_id":"1908.03718","last_updated":"2019-08-10T09:24:24Z","snapshot_observed_at":"2026-08-16T02:25:16.466063Z","submitted_at":"2019-08-10T09:24:24Z","title":"Efficient Three-party Computation: An Information-theoretic Approach from Cut-and-Choose","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-14T14:10:23.194773Z"},"links":{"citing_paper":"/paper/1908.03718"},"observation_digest":"sha256:7f620ec37c6122c57f2c1500bcc9c24811eafd4e24ddfc174ef71ce649589554","observation_id":"d79aa6a7-6277-4246-81f0-88b4e8e2060a","resolution":{"observed_at":"2026-08-14T14:10:23.655116Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:10:23.564094Z","title":"Marcel Keller, Peter Scholl, and Nigel P Smart","venue":null,"work_id":"656a1f1d-6e29-4a83-b9c5-af9c8bf16404","year":2013},"citing_paper":{"arxiv_id":"1908.03718","last_updated":"2019-08-10T09:24:24Z","snapshot_observed_at":"2026-08-16T02:25:16.466063Z","submitted_at":"2019-08-10T09:24:24Z","title":"Efficient Three-party Computation: An Information-theoretic Approach from Cut-and-Choose","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-14T14:10:23.220694Z"},"links":{"citing_paper":"/paper/1908.03718"},"observation_digest":"sha256:25209a15d8111dc4c6f6677bbb239f5c60d6af83f8a6a476f105786b36a27e9e","observation_id":"044b3aca-87f1-419d-96a3-38721609e6d4","resolution":{"observed_at":"2026-08-14T14:10:23.573244Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:10:23.529189Z","title":"Yehuda Lindell","venue":null,"work_id":"4118c563-9a7a-41a2-b226-39e3e0904704","year":2013},"citing_paper":{"arxiv_id":"1908.03718","last_updated":"2019-08-10T09:24:24Z","snapshot_observed_at":"2026-08-16T02:25:16.466063Z","submitted_at":"2019-08-10T09:24:24Z","title":"Efficient Three-party Computation: An Information-theoretic Approach from Cut-and-Choose","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-14T14:10:23.226712Z"},"links":{"citing_paper":"/paper/1908.03718"},"observation_digest":"sha256:053a9f1cb86ff66abfb1f45588b1110cef9b52f32f731fe250a9a73d115ad2cf","observation_id":"52c8d317-c777-4716-af7c-018f373a9d60","resolution":{"observed_at":"2026-08-14T14:10:23.537995Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:10:23.468332Z","title":"Payman Mohassel and Ben Riva","venue":null,"work_id":"a20d220b-85e0-49a0-8b3c-d90777d6ed12","year":2013},"citing_paper":{"arxiv_id":"1908.03718","last_updated":"2019-08-10T09:24:24Z","snapshot_observed_at":"2026-08-16T02:25:16.466063Z","submitted_at":"2019-08-10T09:24:24Z","title":"Efficient Three-party Computation: An Information-theoretic Approach from Cut-and-Choose","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-14T14:10:23.240341Z"},"links":{"citing_paper":"/paper/1908.03718"},"observation_digest":"sha256:fa82eedf3510f4de821214b49033dd5f5b6b3fe4402c70a81f6907b6901e6f6d","observation_id":"5fafc9af-ccae-456d-8645-1f9169192ed4","resolution":{"observed_at":"2026-08-14T14:10:23.475744Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:10:23.411103Z","title":"Chih-hao Shen et al","venue":null,"work_id":"4be89b2d-c4bd-4657-8b23-2f2bd932f4e6","year":2013},"citing_paper":{"arxiv_id":"1908.03718","last_updated":"2019-08-10T09:24:24Z","snapshot_observed_at":"2026-08-16T02:25:16.466063Z","submitted_at":"2019-08-10T09:24:24Z","title":"Efficient Three-party Computation: An Information-theoretic Approach from Cut-and-Choose","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-14T14:10:23.260588Z"},"links":{"citing_paper":"/paper/1908.03718"},"observation_digest":"sha256:97ddaab33066db095778b56b532f1bcb77ec92bddcd23cae986635b2feff6170","observation_id":"b34b45bf-ddf4-411f-abfa-4337675d5e69","resolution":{"observed_at":"2026-08-14T14:10:23.418104Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:10:23.383220Z","title":"David P Woodruff","venue":null,"work_id":"918ba647-adeb-4338-ae1b-2008c12f614b","year":2007},"citing_paper":{"arxiv_id":"1908.03718","last_updated":"2019-08-10T09:24:24Z","snapshot_observed_at":"2026-08-16T02:25:16.466063Z","submitted_at":"2019-08-10T09:24:24Z","title":"Efficient Three-party Computation: An Information-theoretic Approach from Cut-and-Choose","version":1},"reference_index":1979,"source":"pdf_text","source_observed_at":"2026-08-14T14:10:23.280138Z"},"links":{"citing_paper":"/paper/1908.03718"},"observation_digest":"sha256:dc9c0c28ea4f6bb772846dee701ae4ab63a6dad49c84983d387daad8dc27330b","observation_id":"58c715c7-1f5a-49df-9bfe-70f58061b718","resolution":{"observed_at":"2026-08-14T14:10:23.395198Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:10:23.357674Z","title":null,"venue":null,"work_id":"262c4526-43a6-4698-9c3a-0e85ace222e2","year":1986},"citing_paper":{"arxiv_id":"1908.03718","last_updated":"2019-08-10T09:24:24Z","snapshot_observed_at":"2026-08-16T02:25:16.466063Z","submitted_at":"2019-08-10T09:24:24Z","title":"Efficient Three-party Computation: An Information-theoretic Approach from Cut-and-Choose","version":1},"reference_index":2007,"source":"pdf_text","source_observed_at":"2026-08-14T14:10:23.290296Z"},"links":{"citing_paper":"/paper/1908.03718"},"observation_digest":"sha256:e237e5a259721a175a97132166bea68c8b15321a77bcc3e958c0a902bb1fd97e","observation_id":"161faf53-aad2-4508-aa4f-8771124055fb","resolution":{"observed_at":"2026-08-14T14:10:23.365734Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:10:23.691967Z","title":"Mihir Bellare, Viet Tung Hoang, and Phillip Rogaway","venue":null,"work_id":"2ed82c67-8b05-4862-ab1d-f24dbeadb359","year":2012},"citing_paper":{"arxiv_id":"1908.03718","last_updated":"2019-08-10T09:24:24Z","snapshot_observed_at":"2026-08-16T02:25:16.466063Z","submitted_at":"2019-08-10T09:24:24Z","title":"Efficient Three-party Computation: An Information-theoretic Approach from Cut-and-Choose","version":1},"reference_index":2008,"source":"pdf_text","source_observed_at":"2026-08-14T14:10:23.169183Z"},"links":{"citing_paper":"/paper/1908.03718"},"observation_digest":"sha256:e5bef50086f4ba3889dba2a406b294f461cfc5fd98ee7c8cb619bfea4f03882b","observation_id":"06e7b80f-fbae-44d8-a38a-29ba023809bd","resolution":{"observed_at":"2026-08-14T14:10:23.698735Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:10:23.442709Z","title":"Chih-hao Shen et al","venue":null,"work_id":"0195d00a-38b6-4ced-ac65-45f340e1acaf","year":2011},"citing_paper":{"arxiv_id":"1908.03718","last_updated":"2019-08-10T09:24:24Z","snapshot_observed_at":"2026-08-16T02:25:16.466063Z","submitted_at":"2019-08-10T09:24:24Z","title":"Efficient Three-party Computation: An Information-theoretic Approach from Cut-and-Choose","version":1},"reference_index":2009,"source":"pdf_text","source_observed_at":"2026-08-14T14:10:23.248100Z"},"links":{"citing_paper":"/paper/1908.03718"},"observation_digest":"sha256:b4fdc205cc3bd79c2858204785debeacaf70be1225363be5afe72845d0592b93","observation_id":"1dbd1ad6-0d4a-4a86-93e3-44748a1f51cf","resolution":{"observed_at":"2026-08-14T14:10:23.450886Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:10:23.596831Z","title":"Yan Huang, Jonathan Katz, and David Evans","venue":null,"work_id":"b2056dbb-f431-4da7-aff3-35cede699b48","year":2013},"citing_paper":{"arxiv_id":"1908.03718","last_updated":"2019-08-10T09:24:24Z","snapshot_observed_at":"2026-08-16T02:25:16.466063Z","submitted_at":"2019-08-10T09:24:24Z","title":"Efficient Three-party Computation: An Information-theoretic Approach from Cut-and-Choose","version":1},"reference_index":2011,"source":"pdf_text","source_observed_at":"2026-08-14T14:10:23.212239Z"},"links":{"citing_paper":"/paper/1908.03718"},"observation_digest":"sha256:20bf67703bf91a1fe80f9b671fa0191e46395800062820bbbff7754f8e5c97ff","observation_id":"3f25ddb0-3e4b-424f-9b3b-7a1059569133","resolution":{"observed_at":"2026-08-14T14:10:23.603446Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:10:23.670603Z","title":"Dan Bogdanov, Sven Laur, and Jan Willemson","venue":null,"work_id":"7cd8a2cb-eed5-4e8c-b2b9-562ae80c2106","year":2008},"citing_paper":{"arxiv_id":"1908.03718","last_updated":"2019-08-10T09:24:24Z","snapshot_observed_at":"2026-08-16T02:25:16.466063Z","submitted_at":"2019-08-10T09:24:24Z","title":"Efficient Three-party Computation: An Information-theoretic Approach from Cut-and-Choose","version":1},"reference_index":2012,"source":"pdf_text","source_observed_at":"2026-08-14T14:10:23.185496Z"},"links":{"citing_paper":"/paper/1908.03718"},"observation_digest":"sha256:910b9f59ca76bef44608aaa47631870881507303eac37daecd2e3eb4d377e7d7","observation_id":"0604d985-223b-49cf-b2a7-d0c084f54227","resolution":{"observed_at":"2026-08-14T14:10:23.678551Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:10:23.500221Z","title":"Yehuda Lindell and Benny Pinkas","venue":null,"work_id":"f37df8a1-952d-4a9b-85cf-bf7a583e2d75","year":2007},"citing_paper":{"arxiv_id":"1908.03718","last_updated":"2019-08-10T09:24:24Z","snapshot_observed_at":"2026-08-16T02:25:16.466063Z","submitted_at":"2019-08-10T09:24:24Z","title":"Efficient Three-party Computation: An Information-theoretic Approach from Cut-and-Choose","version":1},"reference_index":2013,"source":"pdf_text","source_observed_at":"2026-08-14T14:10:23.234900Z"},"links":{"citing_paper":"/paper/1908.03718"},"observation_digest":"sha256:ccb30283e5794f8f9aec0d8dac7d37000e90c980c3b363631a5b84cde87f5c59","observation_id":"3314e40f-69cf-420e-83b8-ee022145471b","resolution":{"observed_at":"2026-08-14T14:10:23.511429Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:10:23.618540Z","title":"Seung Geol Choi, Jonathan Katz, Alex J Malozemoff, and Vassilis Zikas","venue":null,"work_id":"fdadf924-7e93-442e-b42b-a63649d1f1b5","year":2014},"citing_paper":{"arxiv_id":"1908.03718","last_updated":"2019-08-10T09:24:24Z","snapshot_observed_at":"2026-08-16T02:25:16.466063Z","submitted_at":"2019-08-10T09:24:24Z","title":"Efficient Three-party Computation: An Information-theoretic Approach from Cut-and-Choose","version":1},"reference_index":2015,"source":"pdf_text","source_observed_at":"2026-08-14T14:10:23.206530Z"},"links":{"citing_paper":"/paper/1908.03718"},"observation_digest":"sha256:6ea5d5807ea1138976882c084e53ebe3644ce0a8c545b7d42f5315a2d21b068d","observation_id":"6d2bf9a6-1e48-4b95-96c1-56a33121efa5","resolution":{"observed_at":"2026-08-14T14:10:23.626884Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"1908.03718","last_updated":"2019-08-10T09:24:24Z","latest_version":1,"primary_category":"cs.CR","snapshot_observed_at":"2026-08-16T02:25:16.466063Z","submitted_at":"2019-08-10T09:24:24Z","title":"Efficient Three-party Computation: An Information-theoretic Approach from Cut-and-Choose"},"reference_resolution":{"displayed":13,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":2,"verified_exact":0,"verified_fuzzy":11},"total_outbound_references":13},"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-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"thesis":"As of 16 August 2026, this Paper Citation Record lists 13 of 13 outbound references and 0 inbound Pith citation observations for arXiv:1908.03718."}