{"as_of":"2026-08-12T13:29:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:85bb86d4c2858c70307fefa4bb8237a5e8b51fca8bfe2aed55a76fe1724e3727","coverage":[{"denominator":300,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":100,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-01T15:58:03.420588Z","state":"measured"},{"denominator":100,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":100,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-12T06:34:41.77262+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/2607.18168/citation-record","integrity":"/paper/2607.18168/integrity","json":"/paper/2607.18168/citation-record.json","paper":"/paper/2607.18168"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1137/120875673","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"SIAM Journal on Computing , volume =","venue":"SIAM Journal on Computing","work_id":"77466c12-d57a-4e15-a9b9-60eaac1648c1","year":2014},"citing_paper":{"arxiv_id":"2607.18168","last_updated":"2026-07-23T04:00:01Z","snapshot_observed_at":"2026-08-01T15:57:55.164511Z","submitted_at":"2026-07-20T17:11:02Z","title":"A Forward-Backward Weight Analysis of INW for Permutation Branching Programs","version":2},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-01T15:57:56.180286Z"},"links":{"citing_paper":"/paper/2607.18168"},"observation_digest":"sha256:37bba87322948424fe7350f174ca18d8f51c94eacb2061772d3db8ad9b0e13b0","observation_id":"465f029e-4a1d-4191-8f5f-fb2a0f3ada0e","resolution":{"observed_at":"2026-08-01T15:58:24.209227Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-08-01T15:57:56.241221Z","title":"Simplifying the","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.18168","last_updated":"2026-07-23T04:00:01Z","snapshot_observed_at":"2026-08-01T15:57:55.164511Z","submitted_at":"2026-07-20T17:11:02Z","title":"A Forward-Backward Weight Analysis of INW for Permutation Branching Programs","version":2},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-01T15:57:56.241221Z"},"links":{"citing_paper":"/paper/2607.18168"},"observation_digest":"sha256:0e365c16861e26256be410d8634fee75b9eae1dcc024c61c44351767cab8fc5b","observation_id":"fb05669e-ba5e-46ac-8059-2af3273e7868","resolution":{"observed_at":"2026-08-01T15:57:56.241221Z","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-08-01T15:57:56.272743Z","title":"Annual Symposium on Foundations of Computer Science (FOCS) , pages=","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.18168","last_updated":"2026-07-23T04:00:01Z","snapshot_observed_at":"2026-08-01T15:57:55.164511Z","submitted_at":"2026-07-20T17:11:02Z","title":"A Forward-Backward Weight Analysis of INW for Permutation Branching Programs","version":2},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-01T15:57:56.272743Z"},"links":{"citing_paper":"/paper/2607.18168"},"observation_digest":"sha256:d2a7875e2e9031c6276b0782582e383286c49cd3282bc04659d3072e521c7dad","observation_id":"00795f44-c825-44b5-ac70-49dbd3dbf622","resolution":{"observed_at":"2026-08-01T15:57:56.272743Z","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-08-01T15:57:56.350304Z","title":"Opening up the distinguisher: A hardness to randomness approach","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.18168","last_updated":"2026-07-23T04:00:01Z","snapshot_observed_at":"2026-08-01T15:57:55.164511Z","submitted_at":"2026-07-20T17:11:02Z","title":"A Forward-Backward Weight Analysis of INW for Permutation Branching Programs","version":2},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-01T15:57:56.350304Z"},"links":{"citing_paper":"/paper/2607.18168"},"observation_digest":"sha256:70da81e678d49ebb7b05acf341b290aed4504725fdf4bdc56b0e08354c1746e1","observation_id":"0aec40a9-45b6-4f0e-afa8-b8bc50b9765f","resolution":{"observed_at":"2026-08-01T15:57:56.350304Z","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-08-01T15:57:56.426916Z","title":"Computational Complexity Conference (CCC) , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.18168","last_updated":"2026-07-23T04:00:01Z","snapshot_observed_at":"2026-08-01T15:57:55.164511Z","submitted_at":"2026-07-20T17:11:02Z","title":"A Forward-Backward Weight Analysis of INW for Permutation Branching Programs","version":2},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-01T15:57:56.426916Z"},"links":{"citing_paper":"/paper/2607.18168"},"observation_digest":"sha256:5c24d7a14e9b01062d3b22c0595a67032d915e40a27c6ae9800b7718730132c8","observation_id":"f8f796f9-d90c-4555-b44e-131d77cbdc26","resolution":{"observed_at":"2026-08-01T15:57:56.426916Z","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-08-01T15:57:56.493249Z","title":"Saks and Shiyu Zhou , title =","venue":null,"work_id":null,"year":1999},"citing_paper":{"arxiv_id":"2607.18168","last_updated":"2026-07-23T04:00:01Z","snapshot_observed_at":"2026-08-01T15:57:55.164511Z","submitted_at":"2026-07-20T17:11:02Z","title":"A Forward-Backward Weight Analysis of INW for Permutation Branching Programs","version":2},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-01T15:57:56.493249Z"},"links":{"citing_paper":"/paper/2607.18168"},"observation_digest":"sha256:e9c853c041dbad4d6ab2072983f43a5385f07636a73b439e413ab2e90b33bb2b","observation_id":"c6527770-43b4-4480-8500-2478710da9ad","resolution":{"observed_at":"2026-08-01T15:57:56.493249Z","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-08-01T15:57:56.537638Z","title":"Annual Symposium on Theory of Computing (STOC) , pages=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.18168","last_updated":"2026-07-23T04:00:01Z","snapshot_observed_at":"2026-08-01T15:57:55.164511Z","submitted_at":"2026-07-20T17:11:02Z","title":"A Forward-Backward Weight Analysis of INW for Permutation Branching Programs","version":2},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-01T15:57:56.537638Z"},"links":{"citing_paper":"/paper/2607.18168"},"observation_digest":"sha256:e63def9f813bfdc08f7bf15d382b5772d71d319e4da1503f7500ed7fe7ee5f3f","observation_id":"7317becd-c7b5-49d9-810a-7f86c1569b6d","resolution":{"observed_at":"2026-08-01T15:57:56.537638Z","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-08-01T15:57:56.613293Z","title":"Annual Symposium on Theory of Computing (STOC) , pages=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.18168","last_updated":"2026-07-23T04:00:01Z","snapshot_observed_at":"2026-08-01T15:57:55.164511Z","submitted_at":"2026-07-20T17:11:02Z","title":"A Forward-Backward Weight Analysis of INW for Permutation Branching Programs","version":2},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-01T15:57:56.613293Z"},"links":{"citing_paper":"/paper/2607.18168"},"observation_digest":"sha256:93f9311ba82b5cbbdaab6b319e264841e74443bcdf88a9953985ea213e8fd1db","observation_id":"8e203c1f-46be-4d25-ae6c-b497f8822924","resolution":{"observed_at":"2026-08-01T15:57:56.613293Z","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":"10.1016/s0019-9958(83)80060-6","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Information and Control , FJOURNAL =","venue":"Information and Control","work_id":"7072c6b4-3cc0-4044-b8a5-a45c9b2988a0","year":1983},"citing_paper":{"arxiv_id":"2607.18168","last_updated":"2026-07-23T04:00:01Z","snapshot_observed_at":"2026-08-01T15:57:55.164511Z","submitted_at":"2026-07-20T17:11:02Z","title":"A Forward-Backward Weight Analysis of INW for Permutation Branching Programs","version":2},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-01T15:57:56.668102Z"},"links":{"citing_paper":"/paper/2607.18168"},"observation_digest":"sha256:65bced224583c10eab68b799e52224a0ded9ca44e5932feb8288c133ced72428","observation_id":"f28cd47d-db09-4e86-b1db-ef03b20c9ce8","resolution":{"observed_at":"2026-08-01T15:58:24.154215Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/3-540-10856-4","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Jung , title =","venue":"Lecture notes in computer science","work_id":"ca9eb1c2-a46f-4a8b-831e-b8377e920a05","year":1981},"citing_paper":{"arxiv_id":"2607.18168","last_updated":"2026-07-23T04:00:01Z","snapshot_observed_at":"2026-08-01T15:57:55.164511Z","submitted_at":"2026-07-20T17:11:02Z","title":"A Forward-Backward Weight Analysis of INW for Permutation Branching Programs","version":2},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-01T15:57:56.737731Z"},"links":{"citing_paper":"/paper/2607.18168"},"observation_digest":"sha256:80ca50d68f069300f9f7482b3d596bcf101dbc6b5cc14053b1b7ffc35429ed48","observation_id":"6f2bbd76-4eb6-4562-84c2-5825db13a1f6","resolution":{"observed_at":"2026-08-01T15:58:24.075947Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1016/0304-3975(81)90032-3","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Theoretical Computer Science , FJOURNAL =","venue":"Theoretical Computer Science","work_id":"ea62810c-4b66-4352-bce1-f20cfcbfc626","year":1981},"citing_paper":{"arxiv_id":"2607.18168","last_updated":"2026-07-23T04:00:01Z","snapshot_observed_at":"2026-08-01T15:57:55.164511Z","submitted_at":"2026-07-20T17:11:02Z","title":"A Forward-Backward Weight Analysis of INW for Permutation Branching Programs","version":2},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-01T15:57:56.780175Z"},"links":{"citing_paper":"/paper/2607.18168"},"observation_digest":"sha256:be34ca928f60594e83aa77826f1ca351ac81d9241aea5965c12bcb4a8d493763","observation_id":"06e8d8a6-9507-4b3c-82e6-e4717d42a842","resolution":{"observed_at":"2026-08-01T15:58:24.022715Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1137/0206049","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"SIAM Journal on Computing , FJOURNAL =","venue":"SIAM Journal on Computing","work_id":"d7b55526-2c61-4fe4-b42f-aaf0dec3228c","year":1977},"citing_paper":{"arxiv_id":"2607.18168","last_updated":"2026-07-23T04:00:01Z","snapshot_observed_at":"2026-08-01T15:57:55.164511Z","submitted_at":"2026-07-20T17:11:02Z","title":"A Forward-Backward Weight Analysis of INW for Permutation Branching Programs","version":2},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-01T15:57:56.889600Z"},"links":{"citing_paper":"/paper/2607.18168"},"observation_digest":"sha256:54663876f7c8309226dc812f6434a801d523b310d435e24a59a0ded7844326f5","observation_id":"e07af5f9-d615-4f97-b9f5-61393306fbb6","resolution":{"observed_at":"2026-08-01T15:58:23.906410Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-08-01T15:57:56.963198Z","title":"2023 , organization=","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.18168","last_updated":"2026-07-23T04:00:01Z","snapshot_observed_at":"2026-08-01T15:57:55.164511Z","submitted_at":"2026-07-20T17:11:02Z","title":"A Forward-Backward Weight Analysis of INW for Permutation Branching Programs","version":2},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-01T15:57:56.963198Z"},"links":{"citing_paper":"/paper/2607.18168"},"observation_digest":"sha256:cf657ddde6330e04ec4b9735a29fe4f6b5012a779136a68798314617012b9dd7","observation_id":"b617ddbf-8af5-42a4-9d0d-424cd3eb12e1","resolution":{"observed_at":"2026-08-01T15:57:56.963198Z","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-08-01T15:57:57.001511Z","title":"Approximation, Randomization, and Combinatorial Optimization","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2607.18168","last_updated":"2026-07-23T04:00:01Z","snapshot_observed_at":"2026-08-01T15:57:55.164511Z","submitted_at":"2026-07-20T17:11:02Z","title":"A Forward-Backward Weight Analysis of INW for Permutation Branching Programs","version":2},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-01T15:57:57.001511Z"},"links":{"citing_paper":"/paper/2607.18168"},"observation_digest":"sha256:9ce01ba9c709320e6acf46b78b96024f0f45446a21126c4c715e15be0c998dca","observation_id":"14df5cde-f543-4a2e-91a5-c85b48dce152","resolution":{"observed_at":"2026-08-01T15:57:57.001511Z","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-08-01T15:57:57.063202Z","title":"Innovations in Theoretical Computer Science Conference (ITCS) , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.18168","last_updated":"2026-07-23T04:00:01Z","snapshot_observed_at":"2026-08-01T15:57:55.164511Z","submitted_at":"2026-07-20T17:11:02Z","title":"A Forward-Backward Weight Analysis of INW for Permutation Branching Programs","version":2},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-01T15:57:57.063202Z"},"links":{"citing_paper":"/paper/2607.18168"},"observation_digest":"sha256:2c9a6512ddf96e1adccc4fd1666ac7d2cef440d7a806d4c10c5c761d8b0774d0","observation_id":"6705752d-1715-433f-8ffd-406d6e94cdd3","resolution":{"observed_at":"2026-08-01T15:57:57.063202Z","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-08-01T15:57:57.128774Z","title":"2021 , MRCLASS =","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2607.18168","last_updated":"2026-07-23T04:00:01Z","snapshot_observed_at":"2026-08-01T15:57:55.164511Z","submitted_at":"2026-07-20T17:11:02Z","title":"A Forward-Backward Weight Analysis of INW for Permutation Branching Programs","version":2},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-01T15:57:57.128774Z"},"links":{"citing_paper":"/paper/2607.18168"},"observation_digest":"sha256:7222bda370b482f4abbc136dc88b274eb3e2c96dd5cae2151a2c521f5af3d2a9","observation_id":"9860f589-b211-4421-8b45-9940609fbc7f","resolution":{"observed_at":"2026-08-01T15:57:57.128774Z","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-08-01T15:57:57.198015Z","title":"2020 , MRCLASS =","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2607.18168","last_updated":"2026-07-23T04:00:01Z","snapshot_observed_at":"2026-08-01T15:57:55.164511Z","submitted_at":"2026-07-20T17:11:02Z","title":"A Forward-Backward Weight Analysis of INW for Permutation Branching Programs","version":2},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-01T15:57:57.198015Z"},"links":{"citing_paper":"/paper/2607.18168"},"observation_digest":"sha256:f8fea206774c57546db106af17ac0abde4a4cc70744ef13854eb279eb54bfce0","observation_id":"b71c774c-c0a4-4671-83be-9236235bf8ec","resolution":{"observed_at":"2026-08-01T15:57:57.198015Z","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-08-01T15:57:57.260124Z","title":", author=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.18168","last_updated":"2026-07-23T04:00:01Z","snapshot_observed_at":"2026-08-01T15:57:55.164511Z","submitted_at":"2026-07-20T17:11:02Z","title":"A Forward-Backward Weight Analysis of INW for Permutation Branching Programs","version":2},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-01T15:57:57.260124Z"},"links":{"citing_paper":"/paper/2607.18168"},"observation_digest":"sha256:51c346939de0fab9b5491b28d9e68e6546f9f4654225cf8173b1f423723b7f30","observation_id":"21c8e93f-4fcc-42cb-be3a-e5fa41d969f0","resolution":{"observed_at":"2026-08-01T15:57:57.260124Z","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-08-01T15:57:57.305920Z","title":"Electronic Colloquium on Computational Complexity (ECCC) , volume=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.18168","last_updated":"2026-07-23T04:00:01Z","snapshot_observed_at":"2026-08-01T15:57:55.164511Z","submitted_at":"2026-07-20T17:11:02Z","title":"A Forward-Backward Weight Analysis of INW for Permutation Branching Programs","version":2},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-01T15:57:57.305920Z"},"links":{"citing_paper":"/paper/2607.18168"},"observation_digest":"sha256:c799db013e07e826212ab9ef90d405c2e2c4775624db1ba8eb3a5ac8e1a5e208","observation_id":"a37863e7-01a7-45f0-ae83-5000ba7d0680","resolution":{"observed_at":"2026-08-01T15:57:57.305920Z","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-08-01T15:57:57.376231Z","title":"Computational Complexity Conference (CCC) , pages=","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2607.18168","last_updated":"2026-07-23T04:00:01Z","snapshot_observed_at":"2026-08-01T15:57:55.164511Z","submitted_at":"2026-07-20T17:11:02Z","title":"A Forward-Backward Weight Analysis of INW for Permutation Branching Programs","version":2},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-01T15:57:57.376231Z"},"links":{"citing_paper":"/paper/2607.18168"},"observation_digest":"sha256:46ec7ecab7884c3c8a8b9e8fad9d511f524c78356311d6e7e65f31e74956c83c","observation_id":"2c9eeed7-dfeb-4b83-9801-aae808b96bd2","resolution":{"observed_at":"2026-08-01T15:57:57.376231Z","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":"10.4086/toc.2017.v013a012","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Theory of Computing , FJOURNAL =","venue":"Theory of Computing","work_id":"1824d5fe-5a13-40b9-bba6-951a2c74308f","year":2017},"citing_paper":{"arxiv_id":"2607.18168","last_updated":"2026-07-23T04:00:01Z","snapshot_observed_at":"2026-08-01T15:57:55.164511Z","submitted_at":"2026-07-20T17:11:02Z","title":"A Forward-Backward Weight Analysis of INW for Permutation Branching Programs","version":2},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-01T15:57:57.439409Z"},"links":{"citing_paper":"/paper/2607.18168"},"observation_digest":"sha256:710f5de443fb02d5e87cb14a0c8bdda53fce6c499930f291b8c8995eb8e22161","observation_id":"51a6b68a-b02a-4291-a42f-e66369b6fbb2","resolution":{"observed_at":"2026-08-01T15:58:23.814678Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/978-3-642-40328-6","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Approximation, Randomization, and Combinatorial Optimization","venue":null,"work_id":"52bcbf71-3ec3-4b4c-a489-4b5b2978cdbd","year":2013},"citing_paper":{"arxiv_id":"2607.18168","last_updated":"2026-07-23T04:00:01Z","snapshot_observed_at":"2026-08-01T15:57:55.164511Z","submitted_at":"2026-07-20T17:11:02Z","title":"A Forward-Backward Weight Analysis of INW for Permutation Branching Programs","version":2},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-01T15:57:57.498309Z"},"links":{"citing_paper":"/paper/2607.18168"},"observation_digest":"sha256:bf4df44c5ca4cb5d0cd3491c4bdf1eaf9f56a05c4adb1ab935d68a2538e43ee1","observation_id":"1c3ac3ea-0690-4711-a67a-8bd5e35541a9","resolution":{"observed_at":"2026-08-01T15:58:23.754989Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.4230/lipics.ccc.2022.3","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Proceedings of the 37th","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","work_id":"3a3e209b-5f1f-4eda-932f-aa871b647f38","year":2022},"citing_paper":{"arxiv_id":"2607.18168","last_updated":"2026-07-23T04:00:01Z","snapshot_observed_at":"2026-08-01T15:57:55.164511Z","submitted_at":"2026-07-20T17:11:02Z","title":"A Forward-Backward Weight Analysis of INW for Permutation Branching Programs","version":2},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-01T15:57:57.577610Z"},"links":{"citing_paper":"/paper/2607.18168"},"observation_digest":"sha256:f8921a89cbe4e85c17cb061b699960788cee9d69e2737f1892c37062955d22b0","observation_id":"b1fed967-e258-4143-a875-c0a2d4d75827","resolution":{"observed_at":"2026-08-01T15:58:23.647599Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-08-01T15:57:57.654888Z","title":"Symposium on Simplicity in Algorithms (SOSA) , pages=","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.18168","last_updated":"2026-07-23T04:00:01Z","snapshot_observed_at":"2026-08-01T15:57:55.164511Z","submitted_at":"2026-07-20T17:11:02Z","title":"A Forward-Backward Weight Analysis of INW for Permutation Branching Programs","version":2},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-01T15:57:57.654888Z"},"links":{"citing_paper":"/paper/2607.18168"},"observation_digest":"sha256:bc761b4be92a0684bbb17ab8bec6b55682a514eb7bcde78a36319bd941eb78c9","observation_id":"72f22580-3dcc-4cda-b9f1-ed21edd6bb9e","resolution":{"observed_at":"2026-08-01T15:57:57.654888Z","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-08-01T15:57:57.710930Z","title":"SIAM Journal on Computing , volume=","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2607.18168","last_updated":"2026-07-23T04:00:01Z","snapshot_observed_at":"2026-08-01T15:57:55.164511Z","submitted_at":"2026-07-20T17:11:02Z","title":"A Forward-Backward Weight Analysis of INW for Permutation Branching Programs","version":2},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-01T15:57:57.710930Z"},"links":{"citing_paper":"/paper/2607.18168"},"observation_digest":"sha256:8bb20b25e0ee38863890a4da8dd2d875a81145a8869ebae2ddce1700c765c1cf","observation_id":"b940a1f4-f505-4976-9da6-b0eb4ecc570f","resolution":{"observed_at":"2026-08-01T15:57:57.710930Z","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-08-01T15:57:57.756321Z","title":"38th International Colloquium on Automata, Languages, and Programming (ICALP 2011) , pages=","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2607.18168","last_updated":"2026-07-23T04:00:01Z","snapshot_observed_at":"2026-08-01T15:57:55.164511Z","submitted_at":"2026-07-20T17:11:02Z","title":"A Forward-Backward Weight Analysis of INW for Permutation Branching Programs","version":2},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-01T15:57:57.756321Z"},"links":{"citing_paper":"/paper/2607.18168"},"observation_digest":"sha256:9d939728b4f9dd062f1a5770d2ab48b7eab849f4c687139f6f417f0a0212194a","observation_id":"84926aff-5c6a-46d3-816d-922af0ce7300","resolution":{"observed_at":"2026-08-01T15:57:57.756321Z","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-08-01T15:57:57.821539Z","title":"21st Annual Symposium on Discrete Algorithms (SODA 2010) , pages=","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2607.18168","last_updated":"2026-07-23T04:00:01Z","snapshot_observed_at":"2026-08-01T15:57:55.164511Z","submitted_at":"2026-07-20T17:11:02Z","title":"A Forward-Backward Weight Analysis of INW for Permutation Branching Programs","version":2},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-01T15:57:57.821539Z"},"links":{"citing_paper":"/paper/2607.18168"},"observation_digest":"sha256:c29ab78f8bfd77bdb83348bff3a926b450859186786019e71357eb5cca07e698","observation_id":"ea2992ae-cc77-4939-896c-df9b26ab2999","resolution":{"observed_at":"2026-08-01T15:57:57.821539Z","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-08-01T15:57:57.889681Z","title":"57th Annual Symposium on Foundations of Computer Science (FOCS 2016) , pages=","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2607.18168","last_updated":"2026-07-23T04:00:01Z","snapshot_observed_at":"2026-08-01T15:57:55.164511Z","submitted_at":"2026-07-20T17:11:02Z","title":"A Forward-Backward Weight Analysis of INW for Permutation Branching Programs","version":2},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-01T15:57:57.889681Z"},"links":{"citing_paper":"/paper/2607.18168"},"observation_digest":"sha256:4c5b1ae4e4736d404ed8f172d9251f1f9f6e2edba64acdcf449647ac9371401b","observation_id":"023b806c-9c9a-47c9-b540-d5a561525100","resolution":{"observed_at":"2026-08-01T15:57:57.889681Z","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-08-01T15:57:57.925783Z","title":"John von Neumann, Collected Works , volume=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.18168","last_updated":"2026-07-23T04:00:01Z","snapshot_observed_at":"2026-08-01T15:57:55.164511Z","submitted_at":"2026-07-20T17:11:02Z","title":"A Forward-Backward Weight Analysis of INW for Permutation Branching Programs","version":2},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-01T15:57:57.925783Z"},"links":{"citing_paper":"/paper/2607.18168"},"observation_digest":"sha256:2ff574e67c81fd7cf9e4a90856dabcca7382cbd492d8d843eb28a647a2c1a110","observation_id":"949b558c-b80a-47fe-8046-471b2abd8f65","resolution":{"observed_at":"2026-08-01T15:57:57.925783Z","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-08-01T15:57:57.990154Z","title":"Extreme High-End","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.18168","last_updated":"2026-07-23T04:00:01Z","snapshot_observed_at":"2026-08-01T15:57:55.164511Z","submitted_at":"2026-07-20T17:11:02Z","title":"A Forward-Backward Weight Analysis of INW for Permutation Branching Programs","version":2},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-08-01T15:57:57.990154Z"},"links":{"citing_paper":"/paper/2607.18168"},"observation_digest":"sha256:fde9ea76176f71f7aaeda4e413a2365f5825af8261b34b373a77b359d9bcdc11","observation_id":"a5b891bd-db85-4aa2-b2e1-19c6f685e3df","resolution":{"observed_at":"2026-08-01T15:57:57.990154Z","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-08-01T15:57:58.085599Z","title":", author=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.18168","last_updated":"2026-07-23T04:00:01Z","snapshot_observed_at":"2026-08-01T15:57:55.164511Z","submitted_at":"2026-07-20T17:11:02Z","title":"A Forward-Backward Weight Analysis of INW for Permutation Branching Programs","version":2},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-08-01T15:57:58.085599Z"},"links":{"citing_paper":"/paper/2607.18168"},"observation_digest":"sha256:a1a61c8b592a5754fbf73aaba9ed1350c3f1f32ef74494030a3d60b4e8d22bd1","observation_id":"e170e7fb-b8c1-4b13-964f-9795abc5f4c0","resolution":{"observed_at":"2026-08-01T15:57:58.085599Z","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-08-01T15:57:58.136829Z","title":"ACM Transactions on Algorithms (TALG) , volume=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.18168","last_updated":"2026-07-23T04:00:01Z","snapshot_observed_at":"2026-08-01T15:57:55.164511Z","submitted_at":"2026-07-20T17:11:02Z","title":"A Forward-Backward Weight Analysis of INW for Permutation Branching Programs","version":2},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-08-01T15:57:58.136829Z"},"links":{"citing_paper":"/paper/2607.18168"},"observation_digest":"sha256:573dc9b7030db18e52c287865fe12af625dcc2465dd43fd06e2fddf2eb0d99cb","observation_id":"5da1d74e-e7da-40ef-9751-de1639351545","resolution":{"observed_at":"2026-08-01T15:57:58.136829Z","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-08-01T15:57:58.176847Z","title":"40th International Colloquium on Automata, Languages, and Programming (ICALP 2013) , pages=","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2607.18168","last_updated":"2026-07-23T04:00:01Z","snapshot_observed_at":"2026-08-01T15:57:55.164511Z","submitted_at":"2026-07-20T17:11:02Z","title":"A Forward-Backward Weight Analysis of INW for Permutation Branching Programs","version":2},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-08-01T15:57:58.176847Z"},"links":{"citing_paper":"/paper/2607.18168"},"observation_digest":"sha256:eca704b4c120a67740fbbc689c34c8b44e808fcd267d76037e246d8d9ee1f763","observation_id":"bd4b0617-74f4-4dc8-84bb-daf90323dcb0","resolution":{"observed_at":"2026-08-01T15:57:58.176847Z","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-08-01T15:57:58.239408Z","title":"29th Annual Symposium on Theoretical Aspects of Computer Science (STACS 2012) , volume=","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2607.18168","last_updated":"2026-07-23T04:00:01Z","snapshot_observed_at":"2026-08-01T15:57:55.164511Z","submitted_at":"2026-07-20T17:11:02Z","title":"A Forward-Backward Weight Analysis of INW for Permutation Branching Programs","version":2},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-08-01T15:57:58.239408Z"},"links":{"citing_paper":"/paper/2607.18168"},"observation_digest":"sha256:59ef4120b344a26f13338011eb94a71c60f67f807c258db7736253e7e90641f4","observation_id":"2280b427-8208-4d4a-b57e-14b2075e7acc","resolution":{"observed_at":"2026-08-01T15:57:58.239408Z","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-08-01T15:57:58.292808Z","title":"44th Annual Symposium on Theory of Computing (STOC 2012) , pages=","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2607.18168","last_updated":"2026-07-23T04:00:01Z","snapshot_observed_at":"2026-08-01T15:57:55.164511Z","submitted_at":"2026-07-20T17:11:02Z","title":"A Forward-Backward Weight Analysis of INW for Permutation Branching Programs","version":2},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-08-01T15:57:58.292808Z"},"links":{"citing_paper":"/paper/2607.18168"},"observation_digest":"sha256:a8f2c7896631f2ae88ad475931d42f4fe5d02d72de2cf74da1884ec6544bdaec","observation_id":"ba2b0dc9-f43f-4ded-afb5-eeaf6aeacd54","resolution":{"observed_at":"2026-08-01T15:57:58.292808Z","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-08-01T15:57:58.355562Z","title":"43rd Annual Symposium on Theory of Computing (STOC 2011) , pages=","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2607.18168","last_updated":"2026-07-23T04:00:01Z","snapshot_observed_at":"2026-08-01T15:57:55.164511Z","submitted_at":"2026-07-20T17:11:02Z","title":"A Forward-Backward Weight Analysis of INW for Permutation Branching Programs","version":2},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-08-01T15:57:58.355562Z"},"links":{"citing_paper":"/paper/2607.18168"},"observation_digest":"sha256:38d9169a4fe33479c852be07d0bc5191b2a3205517bc8902d644d017054ba5fe","observation_id":"e525a376-c110-4d5e-a766-b63c13264626","resolution":{"observed_at":"2026-08-01T15:57:58.355562Z","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-08-01T15:57:58.387794Z","title":"57th Annual Symposium on Foundations of Computer Science (FOCS 2016) , pages=","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2607.18168","last_updated":"2026-07-23T04:00:01Z","snapshot_observed_at":"2026-08-01T15:57:55.164511Z","submitted_at":"2026-07-20T17:11:02Z","title":"A Forward-Backward Weight Analysis of INW for Permutation Branching Programs","version":2},"reference_index":37,"source":"arxiv_source","source_observed_at":"2026-08-01T15:57:58.387794Z"},"links":{"citing_paper":"/paper/2607.18168"},"observation_digest":"sha256:3eb31aa24bc932c5c79650dc8adf4cee7665925714c3be46090b5515d8b40ce7","observation_id":"54ecaf57-9ddd-4116-b22b-2da5979fb43b","resolution":{"observed_at":"2026-08-01T15:57:58.387794Z","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-08-01T15:57:58.443092Z","title":"Solving directed","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2607.18168","last_updated":"2026-07-23T04:00:01Z","snapshot_observed_at":"2026-08-01T15:57:55.164511Z","submitted_at":"2026-07-20T17:11:02Z","title":"A Forward-Backward Weight Analysis of INW for Permutation Branching Programs","version":2},"reference_index":38,"source":"arxiv_source","source_observed_at":"2026-08-01T15:57:58.443092Z"},"links":{"citing_paper":"/paper/2607.18168"},"observation_digest":"sha256:a7cf6a80f8fbafb366a009feecb31e356d9c9d558f8cef54f9e92fdf3b795ccc","observation_id":"1a1993e7-45b4-403e-9c8e-e081a1407d4f","resolution":{"observed_at":"2026-08-01T15:57:58.443092Z","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-08-01T15:57:58.502099Z","title":"Almost-linear-time algorithms for","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.18168","last_updated":"2026-07-23T04:00:01Z","snapshot_observed_at":"2026-08-01T15:57:55.164511Z","submitted_at":"2026-07-20T17:11:02Z","title":"A Forward-Backward Weight Analysis of INW for Permutation Branching Programs","version":2},"reference_index":39,"source":"arxiv_source","source_observed_at":"2026-08-01T15:57:58.502099Z"},"links":{"citing_paper":"/paper/2607.18168"},"observation_digest":"sha256:224a2331a46b140d0f4ddf8a6c0de204b723e8c9eeaf561302ecae4ee2d306fb","observation_id":"2104bc1b-42c5-4b95-bdef-e9142061950d","resolution":{"observed_at":"2026-08-01T15:57:58.502099Z","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-08-01T15:57:58.572601Z","title":"Electronic Colloquium on Computational Complexity (ECCC) , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.18168","last_updated":"2026-07-23T04:00:01Z","snapshot_observed_at":"2026-08-01T15:57:55.164511Z","submitted_at":"2026-07-20T17:11:02Z","title":"A Forward-Backward Weight Analysis of INW for Permutation Branching Programs","version":2},"reference_index":40,"source":"arxiv_source","source_observed_at":"2026-08-01T15:57:58.572601Z"},"links":{"citing_paper":"/paper/2607.18168"},"observation_digest":"sha256:dfc198264df2862934e897a63e7071c90184c0efe72753dc3116dd3abb3c2424","observation_id":"889b709b-a80e-4f3c-a2a8-035be97e0fe1","resolution":{"observed_at":"2026-08-01T15:57:58.572601Z","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-08-01T15:57:58.609567Z","title":"IEEE Transactions on Information Theory , volume=","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2607.18168","last_updated":"2026-07-23T04:00:01Z","snapshot_observed_at":"2026-08-01T15:57:55.164511Z","submitted_at":"2026-07-20T17:11:02Z","title":"A Forward-Backward Weight Analysis of INW for Permutation Branching Programs","version":2},"reference_index":41,"source":"arxiv_source","source_observed_at":"2026-08-01T15:57:58.609567Z"},"links":{"citing_paper":"/paper/2607.18168"},"observation_digest":"sha256:be45b6a76a6c186e581ea31b80c980852d488a983fd546e4f03ce9870d659211","observation_id":"bc9e2b2a-bead-4753-aab6-950a2a116039","resolution":{"observed_at":"2026-08-01T15:57:58.609567Z","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-08-01T15:57:58.648282Z","title":"SIAM Journal on Matrix Analysis and Applications , volume=","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2607.18168","last_updated":"2026-07-23T04:00:01Z","snapshot_observed_at":"2026-08-01T15:57:55.164511Z","submitted_at":"2026-07-20T17:11:02Z","title":"A Forward-Backward Weight Analysis of INW for Permutation Branching Programs","version":2},"reference_index":42,"source":"arxiv_source","source_observed_at":"2026-08-01T15:57:58.648282Z"},"links":{"citing_paper":"/paper/2607.18168"},"observation_digest":"sha256:d96189b642602f4d0754025a5d6b8dc89ca2130aed16b4860752d3fed46eb260","observation_id":"cc90acf3-b196-4840-9919-a90691324944","resolution":{"observed_at":"2026-08-01T15:57:58.648282Z","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-08-01T15:57:58.710063Z","title":"SIAM Journal on Computing , volume=","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2607.18168","last_updated":"2026-07-23T04:00:01Z","snapshot_observed_at":"2026-08-01T15:57:55.164511Z","submitted_at":"2026-07-20T17:11:02Z","title":"A Forward-Backward Weight Analysis of INW for Permutation Branching Programs","version":2},"reference_index":43,"source":"arxiv_source","source_observed_at":"2026-08-01T15:57:58.710063Z"},"links":{"citing_paper":"/paper/2607.18168"},"observation_digest":"sha256:3912b69add1f343100db9f5fb8909d75d29500c36d65bdf5fce9742542241d5f","observation_id":"d6110a57-c948-4de3-bea1-2d96398a15e9","resolution":{"observed_at":"2026-08-01T15:57:58.710063Z","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-08-01T15:57:58.760645Z","title":"53rd Annual Symposium on Theory of Computing (STOC 2021) , pages=","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2607.18168","last_updated":"2026-07-23T04:00:01Z","snapshot_observed_at":"2026-08-01T15:57:55.164511Z","submitted_at":"2026-07-20T17:11:02Z","title":"A Forward-Backward Weight Analysis of INW for Permutation Branching Programs","version":2},"reference_index":44,"source":"arxiv_source","source_observed_at":"2026-08-01T15:57:58.760645Z"},"links":{"citing_paper":"/paper/2607.18168"},"observation_digest":"sha256:984361b9d94a8fc1d9506d806ca29396c91ded17caea6bf38d3255444c310022","observation_id":"a302c465-c8c5-4f2a-99d9-2b94e2aafb5f","resolution":{"observed_at":"2026-08-01T15:57:58.760645Z","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-08-01T15:57:58.816070Z","title":"Journal of the ACM (JACM) , volume=","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2607.18168","last_updated":"2026-07-23T04:00:01Z","snapshot_observed_at":"2026-08-01T15:57:55.164511Z","submitted_at":"2026-07-20T17:11:02Z","title":"A Forward-Backward Weight Analysis of INW for Permutation Branching Programs","version":2},"reference_index":45,"source":"arxiv_source","source_observed_at":"2026-08-01T15:57:58.816070Z"},"links":{"citing_paper":"/paper/2607.18168"},"observation_digest":"sha256:139e96f01aaa3190ef638bb7b33a737ccae79b35a0415c2d2a12ecdfdefa5f41","observation_id":"2488f5c3-933c-40e9-b9f2-fa55aa74a49b","resolution":{"observed_at":"2026-08-01T15:57:58.816070Z","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":"10.4086/toc.2022.v018a021","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Theory of Computing , volume =","venue":"Theory of Computing","work_id":"c5401841-7bde-4832-9e82-802e80cb0228","year":2022},"citing_paper":{"arxiv_id":"2607.18168","last_updated":"2026-07-23T04:00:01Z","snapshot_observed_at":"2026-08-01T15:57:55.164511Z","submitted_at":"2026-07-20T17:11:02Z","title":"A Forward-Backward Weight Analysis of INW for Permutation Branching Programs","version":2},"reference_index":46,"source":"arxiv_source","source_observed_at":"2026-08-01T15:57:58.881647Z"},"links":{"citing_paper":"/paper/2607.18168"},"observation_digest":"sha256:a9aedfbaf503340320ce5d72504f752c5b8c15dab3a79179228a2fe3e4f67bb7","observation_id":"db0931db-4044-4c92-b7b6-fa6188eb5f49","resolution":{"observed_at":"2026-08-01T15:58:23.561176Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-08-01T15:57:58.970548Z","title":"Simple optimal hitting sets for small-success","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2607.18168","last_updated":"2026-07-23T04:00:01Z","snapshot_observed_at":"2026-08-01T15:57:55.164511Z","submitted_at":"2026-07-20T17:11:02Z","title":"A Forward-Backward Weight Analysis of INW for Permutation Branching Programs","version":2},"reference_index":47,"source":"arxiv_source","source_observed_at":"2026-08-01T15:57:58.970548Z"},"links":{"citing_paper":"/paper/2607.18168"},"observation_digest":"sha256:d896c45e5a9a47872bac00b273fbe8b4ca95efb6029a7cf5c0198e70e20c7597","observation_id":"0883a78b-d5c7-4408-bb20-507b452b405b","resolution":{"observed_at":"2026-08-01T15:57:58.970548Z","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-08-01T15:57:59.061433Z","title":"34th Computational Complexity Conference (CCC 2019) , year=","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2607.18168","last_updated":"2026-07-23T04:00:01Z","snapshot_observed_at":"2026-08-01T15:57:55.164511Z","submitted_at":"2026-07-20T17:11:02Z","title":"A Forward-Backward Weight Analysis of INW for Permutation Branching Programs","version":2},"reference_index":48,"source":"arxiv_source","source_observed_at":"2026-08-01T15:57:59.061433Z"},"links":{"citing_paper":"/paper/2607.18168"},"observation_digest":"sha256:8ee9f265f8f007a5064fe1369eac6423be93a7be8f6552558a1a672aec4dc8d9","observation_id":"51ca3909-f16e-43c4-8f5a-2227322efe86","resolution":{"observed_at":"2026-08-01T15:57:59.061433Z","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-08-01T15:57:59.116135Z","title":"SIAM Journal on Computing , volume=","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2607.18168","last_updated":"2026-07-23T04:00:01Z","snapshot_observed_at":"2026-08-01T15:57:55.164511Z","submitted_at":"2026-07-20T17:11:02Z","title":"A Forward-Backward Weight Analysis of INW for Permutation Branching Programs","version":2},"reference_index":49,"source":"arxiv_source","source_observed_at":"2026-08-01T15:57:59.116135Z"},"links":{"citing_paper":"/paper/2607.18168"},"observation_digest":"sha256:c5676ab24d49ee5db5fb99a634c9cc3a1fa9749246293676e7eb87f09fa21c5d","observation_id":"e448318a-d8d2-40ea-93b4-b01bef7d4e92","resolution":{"observed_at":"2026-08-01T15:57:59.116135Z","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-08-01T15:57:59.188747Z","title":"Theory of Cryptography Conference , pages=","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2607.18168","last_updated":"2026-07-23T04:00:01Z","snapshot_observed_at":"2026-08-01T15:57:55.164511Z","submitted_at":"2026-07-20T17:11:02Z","title":"A Forward-Backward Weight Analysis of INW for Permutation Branching Programs","version":2},"reference_index":50,"source":"arxiv_source","source_observed_at":"2026-08-01T15:57:59.188747Z"},"links":{"citing_paper":"/paper/2607.18168"},"observation_digest":"sha256:ec58d6e7463ce668e0db49f8637a8ca6f20297b43c2e878cb0a3474b12583890","observation_id":"432ea334-d019-4399-af7a-0cdae5bc9a2d","resolution":{"observed_at":"2026-08-01T15:57:59.188747Z","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-08-01T15:57:59.332833Z","title":"SIAM Journal on Computing , volume=","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2607.18168","last_updated":"2026-07-23T04:00:01Z","snapshot_observed_at":"2026-08-01T15:57:55.164511Z","submitted_at":"2026-07-20T17:11:02Z","title":"A Forward-Backward Weight Analysis of INW for Permutation Branching Programs","version":2},"reference_index":51,"source":"arxiv_source","source_observed_at":"2026-08-01T15:57:59.332833Z"},"links":{"citing_paper":"/paper/2607.18168"},"observation_digest":"sha256:d1e5d9ec2152a8ec2ca452427d709f2bb21abd6e74fc26f97f463abd93ae3839","observation_id":"7f9fd6af-fa1c-4199-a968-6c85b5470668","resolution":{"observed_at":"2026-08-01T15:57:59.332833Z","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-08-01T15:57:59.434083Z","title":"31st Annual Symposium on Foundations of Computer Science (FOCS 1990) , pages=","venue":null,"work_id":null,"year":1990},"citing_paper":{"arxiv_id":"2607.18168","last_updated":"2026-07-23T04:00:01Z","snapshot_observed_at":"2026-08-01T15:57:55.164511Z","submitted_at":"2026-07-20T17:11:02Z","title":"A Forward-Backward Weight Analysis of INW for Permutation Branching Programs","version":2},"reference_index":52,"source":"arxiv_source","source_observed_at":"2026-08-01T15:57:59.434083Z"},"links":{"citing_paper":"/paper/2607.18168"},"observation_digest":"sha256:0ba2830020b2c1249a205c7a2d9ca656b1f5836a441bf804c85c71e5b16cc9b8","observation_id":"3a2d5945-6c41-4a13-8b53-6e3f9b9626e8","resolution":{"observed_at":"2026-08-01T15:57:59.434083Z","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-08-01T15:57:59.616384Z","title":"Annual Symposium on Theory of Computing (STOC) , pages=","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2607.18168","last_updated":"2026-07-23T04:00:01Z","snapshot_observed_at":"2026-08-01T15:57:55.164511Z","submitted_at":"2026-07-20T17:11:02Z","title":"A Forward-Backward Weight Analysis of INW for Permutation Branching Programs","version":2},"reference_index":53,"source":"arxiv_source","source_observed_at":"2026-08-01T15:57:59.616384Z"},"links":{"citing_paper":"/paper/2607.18168"},"observation_digest":"sha256:71f9ba7cb3b636075c0357dcf54cc32d45949d9c1dc743effc7b040438e0d6e9","observation_id":"215547f1-2bcc-46bf-9555-2495bd04ddc3","resolution":{"observed_at":"2026-08-01T15:57:59.616384Z","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-08-01T15:57:59.737040Z","title":"Approximation, Randomization, and Combinatorial Optimization","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.18168","last_updated":"2026-07-23T04:00:01Z","snapshot_observed_at":"2026-08-01T15:57:55.164511Z","submitted_at":"2026-07-20T17:11:02Z","title":"A Forward-Backward Weight Analysis of INW for Permutation Branching Programs","version":2},"reference_index":54,"source":"arxiv_source","source_observed_at":"2026-08-01T15:57:59.737040Z"},"links":{"citing_paper":"/paper/2607.18168"},"observation_digest":"sha256:547cbfcbab4062a0619a05fff799224c3ccf7df860360a6737293892c8a139a2","observation_id":"e8b168e9-8444-4d98-8f94-41b62570fd8c","resolution":{"observed_at":"2026-08-01T15:57:59.737040Z","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-08-01T15:57:59.865752Z","title":"Annual International Conference on the Theory and Applications of Cryptographic Techniques , pages=","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2607.18168","last_updated":"2026-07-23T04:00:01Z","snapshot_observed_at":"2026-08-01T15:57:55.164511Z","submitted_at":"2026-07-20T17:11:02Z","title":"A Forward-Backward Weight Analysis of INW for Permutation Branching Programs","version":2},"reference_index":55,"source":"arxiv_source","source_observed_at":"2026-08-01T15:57:59.865752Z"},"links":{"citing_paper":"/paper/2607.18168"},"observation_digest":"sha256:7eda0164c7629d0fe775c75142fd6a0ebf91e34ea43d1489a7ba8758c986be6a","observation_id":"5f7d4137-66ed-40f2-9e65-a34aff7e0387","resolution":{"observed_at":"2026-08-01T15:57:59.865752Z","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-08-01T15:57:59.998623Z","title":"50th Annual Symposium on Foundations of Computer Science (FOCS 2009) , pages=","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2607.18168","last_updated":"2026-07-23T04:00:01Z","snapshot_observed_at":"2026-08-01T15:57:55.164511Z","submitted_at":"2026-07-20T17:11:02Z","title":"A Forward-Backward Weight Analysis of INW for Permutation Branching Programs","version":2},"reference_index":56,"source":"arxiv_source","source_observed_at":"2026-08-01T15:57:59.998623Z"},"links":{"citing_paper":"/paper/2607.18168"},"observation_digest":"sha256:949d7d0ee6b5019214815f2c16df53f84c56e912ac4deac99c9cc94111733c80","observation_id":"9d57b7ed-48c1-4dcd-a566-9432c7fa7afa","resolution":{"observed_at":"2026-08-01T15:57:59.998623Z","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-08-01T15:58:00.170696Z","title":"International Conference on Cryptology in India , pages=","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2607.18168","last_updated":"2026-07-23T04:00:01Z","snapshot_observed_at":"2026-08-01T15:57:55.164511Z","submitted_at":"2026-07-20T17:11:02Z","title":"A Forward-Backward Weight Analysis of INW for Permutation Branching Programs","version":2},"reference_index":57,"source":"arxiv_source","source_observed_at":"2026-08-01T15:58:00.170696Z"},"links":{"citing_paper":"/paper/2607.18168"},"observation_digest":"sha256:4e45c98d1b182280b960513f9c985e789a1cac9ca15467e833b2e64c5cc66e03","observation_id":"04919218-f4db-4418-97b2-08bf0920c81d","resolution":{"observed_at":"2026-08-01T15:58:00.170696Z","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-08-01T15:58:00.319042Z","title":"48th Annual Symposium on Theory of Computing (STOC 2016) , pages=","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2607.18168","last_updated":"2026-07-23T04:00:01Z","snapshot_observed_at":"2026-08-01T15:57:55.164511Z","submitted_at":"2026-07-20T17:11:02Z","title":"A Forward-Backward Weight Analysis of INW for Permutation Branching Programs","version":2},"reference_index":58,"source":"arxiv_source","source_observed_at":"2026-08-01T15:58:00.319042Z"},"links":{"citing_paper":"/paper/2607.18168"},"observation_digest":"sha256:6d7dc63c719be4d5bb238f469bce66658406e891ea09238962a52cc2861cec03","observation_id":"67a1094d-3db5-4661-b074-2a0483581b93","resolution":{"observed_at":"2026-08-01T15:58:00.319042Z","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-08-01T15:58:00.437884Z","title":"50th Annual Symposium on Theory of Computing (STOC 2018) , pages=","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2607.18168","last_updated":"2026-07-23T04:00:01Z","snapshot_observed_at":"2026-08-01T15:57:55.164511Z","submitted_at":"2026-07-20T17:11:02Z","title":"A Forward-Backward Weight Analysis of INW for Permutation Branching Programs","version":2},"reference_index":59,"source":"arxiv_source","source_observed_at":"2026-08-01T15:58:00.437884Z"},"links":{"citing_paper":"/paper/2607.18168"},"observation_digest":"sha256:837fd40157c138fa4226cfca2693a0b398dda381e44f76ba314e42f94ff1a32b","observation_id":"8aa27116-d154-4494-9ae3-2556e93cfb33","resolution":{"observed_at":"2026-08-01T15:58:00.437884Z","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-08-01T15:58:00.587558Z","title":"Theory of Cryptography Conference , pages=","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2607.18168","last_updated":"2026-07-23T04:00:01Z","snapshot_observed_at":"2026-08-01T15:57:55.164511Z","submitted_at":"2026-07-20T17:11:02Z","title":"A Forward-Backward Weight Analysis of INW for Permutation Branching Programs","version":2},"reference_index":60,"source":"arxiv_source","source_observed_at":"2026-08-01T15:58:00.587558Z"},"links":{"citing_paper":"/paper/2607.18168"},"observation_digest":"sha256:3d8af4fc01f798d89509044be383721a8bcf76e046998b9c06d1e2b7b38d6df8","observation_id":"8da8304b-7f4a-4b87-b0e1-e87afd24ccf5","resolution":{"observed_at":"2026-08-01T15:58:00.587558Z","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-08-01T15:58:00.710384Z","title":"Journal of Cryptology , volume=","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2607.18168","last_updated":"2026-07-23T04:00:01Z","snapshot_observed_at":"2026-08-01T15:57:55.164511Z","submitted_at":"2026-07-20T17:11:02Z","title":"A Forward-Backward Weight Analysis of INW for Permutation Branching Programs","version":2},"reference_index":61,"source":"arxiv_source","source_observed_at":"2026-08-01T15:58:00.710384Z"},"links":{"citing_paper":"/paper/2607.18168"},"observation_digest":"sha256:88f924558776a75dd537e38237ed6a920820c774de99264422201206139e04a0","observation_id":"74120219-2d65-4a17-8e86-02d28e887536","resolution":{"observed_at":"2026-08-01T15:58:00.710384Z","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-08-01T15:58:00.833647Z","title":"SIAM Journal on Computing , volume =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.18168","last_updated":"2026-07-23T04:00:01Z","snapshot_observed_at":"2026-08-01T15:57:55.164511Z","submitted_at":"2026-07-20T17:11:02Z","title":"A Forward-Backward Weight Analysis of INW for Permutation Branching Programs","version":2},"reference_index":62,"source":"arxiv_source","source_observed_at":"2026-08-01T15:58:00.833647Z"},"links":{"citing_paper":"/paper/2607.18168"},"observation_digest":"sha256:ec36fed13acceb9477199c99a90c310b891cd0cd30536bda7c461dba400f5f78","observation_id":"f2134b3c-995e-4a6a-afe9-4b5468cd9b04","resolution":{"observed_at":"2026-08-01T15:58:00.833647Z","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-08-01T15:58:00.948892Z","title":", author=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.18168","last_updated":"2026-07-23T04:00:01Z","snapshot_observed_at":"2026-08-01T15:57:55.164511Z","submitted_at":"2026-07-20T17:11:02Z","title":"A Forward-Backward Weight Analysis of INW for Permutation Branching Programs","version":2},"reference_index":63,"source":"arxiv_source","source_observed_at":"2026-08-01T15:58:00.948892Z"},"links":{"citing_paper":"/paper/2607.18168"},"observation_digest":"sha256:e141fcdc5d7798d8a387bea2427c6733bdc2d33b1c180d54b3fcd9d48fe0a3ba","observation_id":"ba162da9-505e-49ec-9eec-d10c92779e17","resolution":{"observed_at":"2026-08-01T15:58:00.948892Z","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":"10.1137/1.9781611978971.124","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"2026 , ISBN =","venue":"Society for Industrial and Applied Mathematics eBooks","work_id":"9599556f-9f06-4720-86d6-29b72dfce84f","year":2026},"citing_paper":{"arxiv_id":"2607.18168","last_updated":"2026-07-23T04:00:01Z","snapshot_observed_at":"2026-08-01T15:57:55.164511Z","submitted_at":"2026-07-20T17:11:02Z","title":"A Forward-Backward Weight Analysis of INW for Permutation Branching Programs","version":2},"reference_index":64,"source":"arxiv_source","source_observed_at":"2026-08-01T15:58:01.087198Z"},"links":{"citing_paper":"/paper/2607.18168"},"observation_digest":"sha256:bdc68d877374d0781139953622198f465a689b7fcb1745cfdcec861303b1fe42","observation_id":"8f17df6d-aa63-45cf-9899-f486505925e1","resolution":{"observed_at":"2026-08-01T15:58:23.446467Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-08-01T15:58:01.228672Z","title":"Error reduction for weighted","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.18168","last_updated":"2026-07-23T04:00:01Z","snapshot_observed_at":"2026-08-01T15:57:55.164511Z","submitted_at":"2026-07-20T17:11:02Z","title":"A Forward-Backward Weight Analysis of INW for Permutation Branching Programs","version":2},"reference_index":65,"source":"arxiv_source","source_observed_at":"2026-08-01T15:58:01.228672Z"},"links":{"citing_paper":"/paper/2607.18168"},"observation_digest":"sha256:e1b63edafbb1c95fe1b8d145f24ee4aba061a78bea67dd0572c80492f139e441","observation_id":"b2771c37-63a7-4290-839a-605b1177e98b","resolution":{"observed_at":"2026-08-01T15:58:01.228672Z","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-08-01T15:58:01.314306Z","title":"Approximation, Randomization, and Combinatorial Optimization","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.18168","last_updated":"2026-07-23T04:00:01Z","snapshot_observed_at":"2026-08-01T15:57:55.164511Z","submitted_at":"2026-07-20T17:11:02Z","title":"A Forward-Backward Weight Analysis of INW for Permutation Branching Programs","version":2},"reference_index":66,"source":"arxiv_source","source_observed_at":"2026-08-01T15:58:01.314306Z"},"links":{"citing_paper":"/paper/2607.18168"},"observation_digest":"sha256:c9115d054f44315eb03322d0785db88f1d4bef3819af3bb4875913c7d35994e8","observation_id":"48770e95-a2d3-4409-9dcc-98c44a95fa19","resolution":{"observed_at":"2026-08-01T15:58:01.314306Z","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-08-01T15:58:01.343163Z","title":"Computational Complexity Conference (CCC) , pages =","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2607.18168","last_updated":"2026-07-23T04:00:01Z","snapshot_observed_at":"2026-08-01T15:57:55.164511Z","submitted_at":"2026-07-20T17:11:02Z","title":"A Forward-Backward Weight Analysis of INW for Permutation Branching Programs","version":2},"reference_index":67,"source":"arxiv_source","source_observed_at":"2026-08-01T15:58:01.343163Z"},"links":{"citing_paper":"/paper/2607.18168"},"observation_digest":"sha256:96f24e0b93fbf6e5dc7091b73c52037818c9eddd323bb1833c98bc0091748044","observation_id":"e19ee9e7-1a72-4840-8128-b16be47be340","resolution":{"observed_at":"2026-08-01T15:58:01.343163Z","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-08-01T15:58:01.442831Z","title":"Approximation, Randomization, and Combinatorial Optimization","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.18168","last_updated":"2026-07-23T04:00:01Z","snapshot_observed_at":"2026-08-01T15:57:55.164511Z","submitted_at":"2026-07-20T17:11:02Z","title":"A Forward-Backward Weight Analysis of INW for Permutation Branching Programs","version":2},"reference_index":68,"source":"arxiv_source","source_observed_at":"2026-08-01T15:58:01.442831Z"},"links":{"citing_paper":"/paper/2607.18168"},"observation_digest":"sha256:be2c2ab25d6339102d654c2ff0e3862c4a0e30e336c3aa4a9a2152c02b1396d6","observation_id":"8b7addb9-1080-4f81-9318-1fe125cd64e3","resolution":{"observed_at":"2026-08-01T15:58:01.442831Z","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-08-01T15:58:01.517886Z","title":"Annual Cryptology Conference , pages=","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2607.18168","last_updated":"2026-07-23T04:00:01Z","snapshot_observed_at":"2026-08-01T15:57:55.164511Z","submitted_at":"2026-07-20T17:11:02Z","title":"A Forward-Backward Weight Analysis of INW for Permutation Branching Programs","version":2},"reference_index":69,"source":"arxiv_source","source_observed_at":"2026-08-01T15:58:01.517886Z"},"links":{"citing_paper":"/paper/2607.18168"},"observation_digest":"sha256:d610397f93cfb6dd7a01597453cc2119cc02ae27c6102a71143e4cb8fd8b8078","observation_id":"3910098d-60e4-43f7-9f3d-ee9fd493eb68","resolution":{"observed_at":"2026-08-01T15:58:01.517886Z","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-08-01T15:58:01.541143Z","title":"55th Annual Symposium on Foundations of Computer Science (FOCS 2014) , pages=","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2607.18168","last_updated":"2026-07-23T04:00:01Z","snapshot_observed_at":"2026-08-01T15:57:55.164511Z","submitted_at":"2026-07-20T17:11:02Z","title":"A Forward-Backward Weight Analysis of INW for Permutation Branching Programs","version":2},"reference_index":70,"source":"arxiv_source","source_observed_at":"2026-08-01T15:58:01.541143Z"},"links":{"citing_paper":"/paper/2607.18168"},"observation_digest":"sha256:45888f2b63d497de1121443534d956d9524657fbd51732c596a12b3d2fd4405b","observation_id":"68629f30-9ec5-4cfd-bae2-84cf335b4531","resolution":{"observed_at":"2026-08-01T15:58:01.541143Z","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-08-01T15:58:01.582863Z","title":"49th Annual Symposium on Theory of Computing (STOC 2017) , pages=","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2607.18168","last_updated":"2026-07-23T04:00:01Z","snapshot_observed_at":"2026-08-01T15:57:55.164511Z","submitted_at":"2026-07-20T17:11:02Z","title":"A Forward-Backward Weight Analysis of INW for Permutation Branching Programs","version":2},"reference_index":71,"source":"arxiv_source","source_observed_at":"2026-08-01T15:58:01.582863Z"},"links":{"citing_paper":"/paper/2607.18168"},"observation_digest":"sha256:d2ca152edbb0c61f899a71437769cce1ea66f000a503feff40f0af9e71eb1f2c","observation_id":"71b33fab-eedd-4ac9-9910-9c367404b3ed","resolution":{"observed_at":"2026-08-01T15:58:01.582863Z","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-08-01T15:58:01.628833Z","title":"and Zuckerman, David , TITLE =","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2607.18168","last_updated":"2026-07-23T04:00:01Z","snapshot_observed_at":"2026-08-01T15:57:55.164511Z","submitted_at":"2026-07-20T17:11:02Z","title":"A Forward-Backward Weight Analysis of INW for Permutation Branching Programs","version":2},"reference_index":72,"source":"arxiv_source","source_observed_at":"2026-08-01T15:58:01.628833Z"},"links":{"citing_paper":"/paper/2607.18168"},"observation_digest":"sha256:28ca0c90c475748367bc42f755c5a24811c85c420612498240750c0f9fe04ed5","observation_id":"548c26e5-0658-40f8-9701-2cf093e9e68d","resolution":{"observed_at":"2026-08-01T15:58:01.628833Z","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-08-01T15:58:01.682220Z","title":"Towards optimal two-source extractors and","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2607.18168","last_updated":"2026-07-23T04:00:01Z","snapshot_observed_at":"2026-08-01T15:57:55.164511Z","submitted_at":"2026-07-20T17:11:02Z","title":"A Forward-Backward Weight Analysis of INW for Permutation Branching Programs","version":2},"reference_index":73,"source":"arxiv_source","source_observed_at":"2026-08-01T15:58:01.682220Z"},"links":{"citing_paper":"/paper/2607.18168"},"observation_digest":"sha256:8425ae50f10b806c708802b8b7f692f6e27e5b6d0190335f4f30b16c2f5816cf","observation_id":"8c2820b6-048d-4de1-9d94-1427c8e33330","resolution":{"observed_at":"2026-08-01T15:58:01.682220Z","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-08-01T15:58:01.748057Z","title":"SIAM Journal on Computing , pages=","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2607.18168","last_updated":"2026-07-23T04:00:01Z","snapshot_observed_at":"2026-08-01T15:57:55.164511Z","submitted_at":"2026-07-20T17:11:02Z","title":"A Forward-Backward Weight Analysis of INW for Permutation Branching Programs","version":2},"reference_index":74,"source":"arxiv_source","source_observed_at":"2026-08-01T15:58:01.748057Z"},"links":{"citing_paper":"/paper/2607.18168"},"observation_digest":"sha256:4bb329d08cd83fc6809c40a0422635cf74002a8a183d3ae87cc0b358933c8e5a","observation_id":"edcba34e-566a-493f-b253-598d03ca84e9","resolution":{"observed_at":"2026-08-01T15:58:01.748057Z","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":"10.1109/ccc.2012.21","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":null,"venue":null,"work_id":"2f2a2cf9-a644-4ab6-b959-4a41799b4de8","year":2012},"citing_paper":{"arxiv_id":"2607.18168","last_updated":"2026-07-23T04:00:01Z","snapshot_observed_at":"2026-08-01T15:57:55.164511Z","submitted_at":"2026-07-20T17:11:02Z","title":"A Forward-Backward Weight Analysis of INW for Permutation Branching Programs","version":2},"reference_index":75,"source":"arxiv_source","source_observed_at":"2026-08-01T15:58:01.778526Z"},"links":{"citing_paper":"/paper/2607.18168"},"observation_digest":"sha256:a4797c7a58ca5432ab613ba826ece2115d1858cbccd9e52f59fa738fc5dddcd5","observation_id":"3433ffda-8538-4a3f-b1a5-2c4941f79d02","resolution":{"observed_at":"2026-08-01T15:58:23.356980Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-08-01T15:58:01.820566Z","title":"Information Processing Letters , volume=","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2607.18168","last_updated":"2026-07-23T04:00:01Z","snapshot_observed_at":"2026-08-01T15:57:55.164511Z","submitted_at":"2026-07-20T17:11:02Z","title":"A Forward-Backward Weight Analysis of INW for Permutation Branching Programs","version":2},"reference_index":76,"source":"arxiv_source","source_observed_at":"2026-08-01T15:58:01.820566Z"},"links":{"citing_paper":"/paper/2607.18168"},"observation_digest":"sha256:30dfbd8107361155ea3bff070512f720c8195fd4e66f49f57e760ab4aed362cb","observation_id":"d71f0c4b-4d22-4967-a32d-aa5acc2f08df","resolution":{"observed_at":"2026-08-01T15:58:01.820566Z","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-08-01T15:58:01.917051Z","title":", author=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.18168","last_updated":"2026-07-23T04:00:01Z","snapshot_observed_at":"2026-08-01T15:57:55.164511Z","submitted_at":"2026-07-20T17:11:02Z","title":"A Forward-Backward Weight Analysis of INW for Permutation Branching Programs","version":2},"reference_index":77,"source":"arxiv_source","source_observed_at":"2026-08-01T15:58:01.917051Z"},"links":{"citing_paper":"/paper/2607.18168"},"observation_digest":"sha256:f2f32c7bc6fe2a3c5cf0606af8f588daf46da82428437ffa82b8497481731716","observation_id":"3055534c-247f-476c-8ff7-3e39214abd00","resolution":{"observed_at":"2026-08-01T15:58:01.917051Z","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-08-01T15:58:01.984234Z","title":"47th International Colloquium on Automata, Languages, and Programming (ICALP 2020) , volume =","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2607.18168","last_updated":"2026-07-23T04:00:01Z","snapshot_observed_at":"2026-08-01T15:57:55.164511Z","submitted_at":"2026-07-20T17:11:02Z","title":"A Forward-Backward Weight Analysis of INW for Permutation Branching Programs","version":2},"reference_index":78,"source":"arxiv_source","source_observed_at":"2026-08-01T15:58:01.984234Z"},"links":{"citing_paper":"/paper/2607.18168"},"observation_digest":"sha256:e00eee251e5937e5d9709e3cc418134faeda5076f668eef3d8b955d3e5f26c62","observation_id":"975953d5-14c0-4b27-b591-e4cc8854a5be","resolution":{"observed_at":"2026-08-01T15:58:01.984234Z","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-08-01T15:58:02.038991Z","title":"Mathematika , volume=","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2607.18168","last_updated":"2026-07-23T04:00:01Z","snapshot_observed_at":"2026-08-01T15:57:55.164511Z","submitted_at":"2026-07-20T17:11:02Z","title":"A Forward-Backward Weight Analysis of INW for Permutation Branching Programs","version":2},"reference_index":79,"source":"arxiv_source","source_observed_at":"2026-08-01T15:58:02.038991Z"},"links":{"citing_paper":"/paper/2607.18168"},"observation_digest":"sha256:b751200ee5f743a6888b4cfc51fd0717775ce379ca31735f820f5c3135a159ff","observation_id":"4a12f8ca-fe9e-4be2-bbd0-a19d1d350b8c","resolution":{"observed_at":"2026-08-01T15:58:02.038991Z","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-08-01T15:58:02.121032Z","title":"Proceedings., 33rd Annual Symposium on Foundations of Computer Science , title=","venue":null,"work_id":null,"year":1992},"citing_paper":{"arxiv_id":"2607.18168","last_updated":"2026-07-23T04:00:01Z","snapshot_observed_at":"2026-08-01T15:57:55.164511Z","submitted_at":"2026-07-20T17:11:02Z","title":"A Forward-Backward Weight Analysis of INW for Permutation Branching Programs","version":2},"reference_index":80,"source":"arxiv_source","source_observed_at":"2026-08-01T15:58:02.121032Z"},"links":{"citing_paper":"/paper/2607.18168"},"observation_digest":"sha256:5f2c037e34f17943c6fc89fbb6e44e136eb6eb537f89fa11b882a1121d1fdc4d","observation_id":"6c087cca-cac2-4abf-9504-f12e534f2729","resolution":{"observed_at":"2026-08-01T15:58:02.121032Z","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-08-01T15:58:02.160082Z","title":"Pseudorandom generators for group products , BOOKTITLE =","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2607.18168","last_updated":"2026-07-23T04:00:01Z","snapshot_observed_at":"2026-08-01T15:57:55.164511Z","submitted_at":"2026-07-20T17:11:02Z","title":"A Forward-Backward Weight Analysis of INW for Permutation Branching Programs","version":2},"reference_index":81,"source":"arxiv_source","source_observed_at":"2026-08-01T15:58:02.160082Z"},"links":{"citing_paper":"/paper/2607.18168"},"observation_digest":"sha256:772b0ddff26b5a5f80966b85d2ceffb24f39382c7701b930e21a3e47211763c9","observation_id":"22af019e-825a-43de-b440-1fbf612c9c02","resolution":{"observed_at":"2026-08-01T15:58:02.160082Z","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-08-01T15:58:02.237647Z","title":"An efficient parallel solver for","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2607.18168","last_updated":"2026-07-23T04:00:01Z","snapshot_observed_at":"2026-08-01T15:57:55.164511Z","submitted_at":"2026-07-20T17:11:02Z","title":"A Forward-Backward Weight Analysis of INW for Permutation Branching Programs","version":2},"reference_index":82,"source":"arxiv_source","source_observed_at":"2026-08-01T15:58:02.237647Z"},"links":{"citing_paper":"/paper/2607.18168"},"observation_digest":"sha256:9e565be6d69c8a058d0b538e9d8f3fd60eb4f30f6cef792f11f21326a19b21bc","observation_id":"4b29a853-f106-4e9b-a351-b3ebdbae5cf3","resolution":{"observed_at":"2026-08-01T15:58:02.237647Z","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-08-01T15:58:02.269315Z","title":"IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.18168","last_updated":"2026-07-23T04:00:01Z","snapshot_observed_at":"2026-08-01T15:57:55.164511Z","submitted_at":"2026-07-20T17:11:02Z","title":"A Forward-Backward Weight Analysis of INW for Permutation Branching Programs","version":2},"reference_index":83,"source":"arxiv_source","source_observed_at":"2026-08-01T15:58:02.269315Z"},"links":{"citing_paper":"/paper/2607.18168"},"observation_digest":"sha256:1cc450541512af2f0a1aef27e6f4e05532b0c15ba350bb8a2f26a6919e5e23b1","observation_id":"e9f2132e-36a4-4b8e-bc3b-435be0b01d62","resolution":{"observed_at":"2026-08-01T15:58:02.269315Z","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-08-01T15:58:02.311228Z","title":"2008 , publisher=","venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2607.18168","last_updated":"2026-07-23T04:00:01Z","snapshot_observed_at":"2026-08-01T15:57:55.164511Z","submitted_at":"2026-07-20T17:11:02Z","title":"A Forward-Backward Weight Analysis of INW for Permutation Branching Programs","version":2},"reference_index":84,"source":"arxiv_source","source_observed_at":"2026-08-01T15:58:02.311228Z"},"links":{"citing_paper":"/paper/2607.18168"},"observation_digest":"sha256:1bab431378d4299f611b8b17fb0adf7362ab53ddf959d4ca43375e3b43903dae","observation_id":"3ae4a7e1-a371-4c77-a064-1990f1c12367","resolution":{"observed_at":"2026-08-01T15:58:02.311228Z","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-08-01T15:58:02.393590Z","title":"Proceedings of the Twenty-Ninth Annual ACM Symposium on Theory of Computing , pages =","venue":null,"work_id":null,"year":1997},"citing_paper":{"arxiv_id":"2607.18168","last_updated":"2026-07-23T04:00:01Z","snapshot_observed_at":"2026-08-01T15:57:55.164511Z","submitted_at":"2026-07-20T17:11:02Z","title":"A Forward-Backward Weight Analysis of INW for Permutation Branching Programs","version":2},"reference_index":85,"source":"arxiv_source","source_observed_at":"2026-08-01T15:58:02.393590Z"},"links":{"citing_paper":"/paper/2607.18168"},"observation_digest":"sha256:c6c652f44747ce72c442d143679ea504510be418be251f7aed549cd069ea86b9","observation_id":"fe30d621-0b71-42b3-b812-a2fcfb778f46","resolution":{"observed_at":"2026-08-01T15:58:02.393590Z","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-08-01T15:58:02.497591Z","title":"SIAM Journal on Computing , pages=","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2607.18168","last_updated":"2026-07-23T04:00:01Z","snapshot_observed_at":"2026-08-01T15:57:55.164511Z","submitted_at":"2026-07-20T17:11:02Z","title":"A Forward-Backward Weight Analysis of INW for Permutation Branching Programs","version":2},"reference_index":86,"source":"arxiv_source","source_observed_at":"2026-08-01T15:58:02.497591Z"},"links":{"citing_paper":"/paper/2607.18168"},"observation_digest":"sha256:fff081d4e134cbf1b91b42c464d71ca52d733959145c4c48c7085f99b219eb54","observation_id":"4310f00f-22d1-44c2-b63e-c8e1cf51d5d1","resolution":{"observed_at":"2026-08-01T15:58:02.497591Z","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-08-01T15:58:02.540822Z","title":"SIAM Journal on Computing , volume=","venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2607.18168","last_updated":"2026-07-23T04:00:01Z","snapshot_observed_at":"2026-08-01T15:57:55.164511Z","submitted_at":"2026-07-20T17:11:02Z","title":"A Forward-Backward Weight Analysis of INW for Permutation Branching Programs","version":2},"reference_index":87,"source":"arxiv_source","source_observed_at":"2026-08-01T15:58:02.540822Z"},"links":{"citing_paper":"/paper/2607.18168"},"observation_digest":"sha256:75586aad7671801cfba2fd723aee39086f3938a168cfaf6e4e2ed98abb32d80b","observation_id":"52fc4092-82ad-42bd-8b2e-5f0a619b4440","resolution":{"observed_at":"2026-08-01T15:58:02.540822Z","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-08-01T15:58:02.590433Z","title":"2011 , publisher=","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2607.18168","last_updated":"2026-07-23T04:00:01Z","snapshot_observed_at":"2026-08-01T15:57:55.164511Z","submitted_at":"2026-07-20T17:11:02Z","title":"A Forward-Backward Weight Analysis of INW for Permutation Branching Programs","version":2},"reference_index":88,"source":"arxiv_source","source_observed_at":"2026-08-01T15:58:02.590433Z"},"links":{"citing_paper":"/paper/2607.18168"},"observation_digest":"sha256:b44e1f740b5335914849bca07bcb2ce4458bc464071e766d3ca6841d71dcb407","observation_id":"8137e809-80f5-4847-b9e1-ccaf1a5e82b3","resolution":{"observed_at":"2026-08-01T15:58:02.590433Z","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-08-01T15:58:02.655182Z","title":"Proving that","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2607.18168","last_updated":"2026-07-23T04:00:01Z","snapshot_observed_at":"2026-08-01T15:57:55.164511Z","submitted_at":"2026-07-20T17:11:02Z","title":"A Forward-Backward Weight Analysis of INW for Permutation Branching Programs","version":2},"reference_index":89,"source":"arxiv_source","source_observed_at":"2026-08-01T15:58:02.655182Z"},"links":{"citing_paper":"/paper/2607.18168"},"observation_digest":"sha256:af6c517942b2d4507ca49eca177bc36c3d3f8a9a97f0f77f104d4c0efda5982a","observation_id":"fd209ebb-cb7e-4bff-8373-3adeb91c9f28","resolution":{"observed_at":"2026-08-01T15:58:02.655182Z","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-08-01T15:58:02.718725Z","title":"computational complexity , volume=","venue":null,"work_id":null,"year":2004},"citing_paper":{"arxiv_id":"2607.18168","last_updated":"2026-07-23T04:00:01Z","snapshot_observed_at":"2026-08-01T15:57:55.164511Z","submitted_at":"2026-07-20T17:11:02Z","title":"A Forward-Backward Weight Analysis of INW for Permutation Branching Programs","version":2},"reference_index":90,"source":"arxiv_source","source_observed_at":"2026-08-01T15:58:02.718725Z"},"links":{"citing_paper":"/paper/2607.18168"},"observation_digest":"sha256:808031f101c4c97722a4c6d2fb8198cd97bdab499cc9cc93fb24f9905ec3e644","observation_id":"36e953ba-7d30-44e4-93ab-4fe02206405b","resolution":{"observed_at":"2026-08-01T15:58:02.718725Z","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-08-01T15:58:02.798930Z","title":"34th Computational Complexity Conference (CCC 2019) , pages =","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2607.18168","last_updated":"2026-07-23T04:00:01Z","snapshot_observed_at":"2026-08-01T15:57:55.164511Z","submitted_at":"2026-07-20T17:11:02Z","title":"A Forward-Backward Weight Analysis of INW for Permutation Branching Programs","version":2},"reference_index":91,"source":"arxiv_source","source_observed_at":"2026-08-01T15:58:02.798930Z"},"links":{"citing_paper":"/paper/2607.18168"},"observation_digest":"sha256:a25f8f9922fbc9954319a46a4c6fbe35838dc358e0cf6ae159817562c4bd467b","observation_id":"e6356585-6bdf-4872-a122-48238bc45535","resolution":{"observed_at":"2026-08-01T15:58:02.798930Z","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-08-01T15:58:02.838038Z","title":"Annual Symposium on Theory of Computing (STOC) , pages=","venue":null,"work_id":null,"year":1999},"citing_paper":{"arxiv_id":"2607.18168","last_updated":"2026-07-23T04:00:01Z","snapshot_observed_at":"2026-08-01T15:57:55.164511Z","submitted_at":"2026-07-20T17:11:02Z","title":"A Forward-Backward Weight Analysis of INW for Permutation Branching Programs","version":2},"reference_index":92,"source":"arxiv_source","source_observed_at":"2026-08-01T15:58:02.838038Z"},"links":{"citing_paper":"/paper/2607.18168"},"observation_digest":"sha256:d67e4aff00d8189af59c0546ea54ac9a01bf2761dff72198182ae99db5349f87","observation_id":"3ab036e3-dd92-4f0e-b6ca-00d3642794ef","resolution":{"observed_at":"2026-08-01T15:58:02.838038Z","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-08-01T15:58:02.887366Z","title":"Proceedings of the forty-fifth annual ACM symposium on Theory of computing , pages=","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2607.18168","last_updated":"2026-07-23T04:00:01Z","snapshot_observed_at":"2026-08-01T15:57:55.164511Z","submitted_at":"2026-07-20T17:11:02Z","title":"A Forward-Backward Weight Analysis of INW for Permutation Branching Programs","version":2},"reference_index":93,"source":"arxiv_source","source_observed_at":"2026-08-01T15:58:02.887366Z"},"links":{"citing_paper":"/paper/2607.18168"},"observation_digest":"sha256:6b0ec89f27f04ef7d9f5c92ce017018edc733d702ada843be78d8d4d96ba51aa","observation_id":"85f35688-a859-4e39-862a-f32083ca8cbb","resolution":{"observed_at":"2026-08-01T15:58:02.887366Z","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-08-01T15:58:02.986757Z","title":"Approximation, Randomization, and Combinatorial Optimization","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.18168","last_updated":"2026-07-23T04:00:01Z","snapshot_observed_at":"2026-08-01T15:57:55.164511Z","submitted_at":"2026-07-20T17:11:02Z","title":"A Forward-Backward Weight Analysis of INW for Permutation Branching Programs","version":2},"reference_index":94,"source":"arxiv_source","source_observed_at":"2026-08-01T15:58:02.986757Z"},"links":{"citing_paper":"/paper/2607.18168"},"observation_digest":"sha256:062d549808a3e661256e704bc707d802a7229dcebebe85eb00cb8d197853c968","observation_id":"5ab16c4a-85d4-4d4c-955f-941b41696408","resolution":{"observed_at":"2026-08-01T15:58:02.986757Z","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-08-01T15:58:03.023062Z","title":"36th Computational Complexity Conference (CCC 2021) , pages =","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2607.18168","last_updated":"2026-07-23T04:00:01Z","snapshot_observed_at":"2026-08-01T15:57:55.164511Z","submitted_at":"2026-07-20T17:11:02Z","title":"A Forward-Backward Weight Analysis of INW for Permutation Branching Programs","version":2},"reference_index":95,"source":"arxiv_source","source_observed_at":"2026-08-01T15:58:03.023062Z"},"links":{"citing_paper":"/paper/2607.18168"},"observation_digest":"sha256:796b1c5dabba13f2ecb84bc152ed773f6188dbf82f58b129ada62eca185a07f0","observation_id":"a3441bf1-d245-47a8-9245-95d55592a31f","resolution":{"observed_at":"2026-08-01T15:58:03.023062Z","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-08-01T15:58:03.101135Z","title":"Theory of Cryptography Conference , pages=","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2607.18168","last_updated":"2026-07-23T04:00:01Z","snapshot_observed_at":"2026-08-01T15:57:55.164511Z","submitted_at":"2026-07-20T17:11:02Z","title":"A Forward-Backward Weight Analysis of INW for Permutation Branching Programs","version":2},"reference_index":96,"source":"arxiv_source","source_observed_at":"2026-08-01T15:58:03.101135Z"},"links":{"citing_paper":"/paper/2607.18168"},"observation_digest":"sha256:6b39025e0133aa3f519d4a9de8a0e3b6d43bf69ed7900e5d5f4d6058c8eed83e","observation_id":"c7791fed-9f01-42d0-b0cb-5567f21f6c88","resolution":{"observed_at":"2026-08-01T15:58:03.101135Z","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-08-01T15:58:03.151259Z","title":"Computational Complexity Conference (CCC , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.18168","last_updated":"2026-07-23T04:00:01Z","snapshot_observed_at":"2026-08-01T15:57:55.164511Z","submitted_at":"2026-07-20T17:11:02Z","title":"A Forward-Backward Weight Analysis of INW for Permutation Branching Programs","version":2},"reference_index":97,"source":"arxiv_source","source_observed_at":"2026-08-01T15:58:03.151259Z"},"links":{"citing_paper":"/paper/2607.18168"},"observation_digest":"sha256:338bfda999acf162a2accb2b8e9481eceb8992e45b22b6dc21dffedcd475c22b","observation_id":"ac0dd753-9bec-458b-a77f-c6cd6c031b53","resolution":{"observed_at":"2026-08-01T15:58:03.151259Z","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-08-01T15:58:03.256444Z","title":"Theory of Computing , volume =","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2607.18168","last_updated":"2026-07-23T04:00:01Z","snapshot_observed_at":"2026-08-01T15:57:55.164511Z","submitted_at":"2026-07-20T17:11:02Z","title":"A Forward-Backward Weight Analysis of INW for Permutation Branching Programs","version":2},"reference_index":98,"source":"arxiv_source","source_observed_at":"2026-08-01T15:58:03.256444Z"},"links":{"citing_paper":"/paper/2607.18168"},"observation_digest":"sha256:d201cc43c8acc053f0fa5d976f63970453558d0877a7052338854d19e70cbb7c","observation_id":"895132fd-b755-42d8-8e9e-86bbf8c9c784","resolution":{"observed_at":"2026-08-01T15:58:03.256444Z","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-08-01T15:58:03.336609Z","title":"and Lv, Zelin , TITLE =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.18168","last_updated":"2026-07-23T04:00:01Z","snapshot_observed_at":"2026-08-01T15:57:55.164511Z","submitted_at":"2026-07-20T17:11:02Z","title":"A Forward-Backward Weight Analysis of INW for Permutation Branching Programs","version":2},"reference_index":99,"source":"arxiv_source","source_observed_at":"2026-08-01T15:58:03.336609Z"},"links":{"citing_paper":"/paper/2607.18168"},"observation_digest":"sha256:488566b186c77d4441419a2d6c404993a906b4eb017f375c7e98cd57eaea73da","observation_id":"e08ba27f-f306-4035-adcf-39255be87551","resolution":{"observed_at":"2026-08-01T15:58:03.336609Z","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-08-01T15:58:03.420588Z","title":"35th Computational Complexity Conference (CCC 2020) , pages =","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2607.18168","last_updated":"2026-07-23T04:00:01Z","snapshot_observed_at":"2026-08-01T15:57:55.164511Z","submitted_at":"2026-07-20T17:11:02Z","title":"A Forward-Backward Weight Analysis of INW for Permutation Branching Programs","version":2},"reference_index":100,"source":"arxiv_source","source_observed_at":"2026-08-01T15:58:03.420588Z"},"links":{"citing_paper":"/paper/2607.18168"},"observation_digest":"sha256:79f33ca087bcbe37250d321cd927a16770f63423960b5e4638de13882c6181b8","observation_id":"a01684b0-794f-4616-90cc-a18281888315","resolution":{"observed_at":"2026-08-01T15:58:03.420588Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2607.18168","last_updated":"2026-07-23T04:00:01Z","latest_version":2,"primary_category":"cs.CC","snapshot_observed_at":"2026-08-01T15:57:55.164511Z","submitted_at":"2026-07-20T17:11:02Z","title":"A Forward-Backward Weight Analysis of INW for Permutation Branching Programs"},"reference_resolution":{"displayed":100,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":89,"verified_exact":11,"verified_fuzzy":0},"total_outbound_references":300},"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-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"thesis":"As of 12 August 2026, this Paper Citation Record lists 100 of 300 outbound references and 0 inbound Pith citation observations for arXiv:2607.18168."}