{"as_of":"2026-08-14T17:55:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:bfa75d209f59a94cae36244606948ad2fedf8e63e9586565b62e878f2a178461","coverage":[{"denominator":48,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":48,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-11T18:47:32.309516Z","state":"measured"},{"denominator":49,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":49,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-14T06:32:32.682623+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-10T23:01:35.181204Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"pith","source_observed_at":"2026-08-10T23:01:35.450183Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2412.07685","last_updated":"2024-12-10T17:20:19Z","snapshot_observed_at":"2026-08-11T18:34:35.477586Z","submitted_at":"2024-12-10T17:20:19Z","title":"Automated Discovery of Branching Rules with Optimal Complexity for the Maximum Independent Set Problem","version":1},"cited_work":{"arxiv_id":"2412.07685","doi":null,"metadata_source":"pith","pith_arxiv_id":"2412.07685","snapshot_observed_at":"2026-08-10T23:01:35.450183Z","title":"Automated Discovery of Branching Rules with Optimal Complexity for the Maximum Independent Set Problem","venue":"math.OC","work_id":"f7fabc9d-0a0e-4dd1-944b-d982f2f2172e","year":2024},"citing_paper":{"arxiv_id":"2501.00227","last_updated":"2024-12-31T02:30:34Z","snapshot_observed_at":"2026-08-12T18:50:04.066832Z","submitted_at":"2024-12-31T02:30:34Z","title":"Programming guide for solving constraint satisfaction problems with tensor networks","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-10T23:01:35.181204Z"},"links":{"cited_paper":"/paper/2412.07685","citing_paper":"/paper/2501.00227"},"observation_digest":"sha256:a3e5fcb3bee8096ac4a116e797097a33cd89bde37deff61498d5235b2d0dd3a1","observation_id":"2323bdad-dc0c-4f72-8024-5e2f09e5f049","resolution":{"observed_at":"2026-08-10T23:01:35.457335Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2412.07685/citation-record","integrity":"/paper/2412.07685/integrity","json":"/paper/2412.07685/citation-record.json","paper":"/paper/2412.07685"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.3233/sat190104","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T18:47:32.786461Z","title":"Abrame and D","venue":null,"work_id":"7a6c7d79-1bb7-4244-9da5-7a05454fdaeb","year":2015},"citing_paper":{"arxiv_id":"2412.07685","last_updated":"2024-12-10T17:20:19Z","snapshot_observed_at":"2026-08-11T18:34:35.477586Z","submitted_at":"2024-12-10T17:20:19Z","title":"Automated Discovery of Branching Rules with Optimal Complexity for the Maximum Independent Set Problem","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-11T18:47:32.044550Z"},"links":{"citing_paper":"/paper/2412.07685"},"observation_digest":"sha256:aaab17d9cf6c3aa4f68e530de15edadc732dd47af7bc3a572ac6a18198f63a4a","observation_id":"1a92184e-7c8f-4196-9608-ab7237dd7047","resolution":{"observed_at":"2026-08-11T18:47:32.792157Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T18:47:32.051140Z","title":"Achterberg , SCIP: Solving constraint integer programs, Math","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2412.07685","last_updated":"2024-12-10T17:20:19Z","snapshot_observed_at":"2026-08-11T18:34:35.477586Z","submitted_at":"2024-12-10T17:20:19Z","title":"Automated Discovery of Branching Rules with Optimal Complexity for the Maximum Independent Set Problem","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-11T18:47:32.051140Z"},"links":{"citing_paper":"/paper/2412.07685"},"observation_digest":"sha256:85d65e2d632bc7aebb4b4a9abea0938feeeeeddf1bc73f46887c52ed4cf44d4e","observation_id":"bf576412-4721-435c-86bf-06f2c3325034","resolution":{"observed_at":"2026-08-11T18:47:32.051140Z","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.1007/978-3-540-68155-7_4","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-13T11:03:48.094449Z","title":"Achterberg, T","venue":"Lecture notes in computer science","work_id":"7d5c6b55-d3dc-4cff-ae1a-8d2880df5f68","year":2008},"citing_paper":{"arxiv_id":"2412.07685","last_updated":"2024-12-10T17:20:19Z","snapshot_observed_at":"2026-08-11T18:34:35.477586Z","submitted_at":"2024-12-10T17:20:19Z","title":"Automated Discovery of Branching Rules with Optimal Complexity for the Maximum Independent Set Problem","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-11T18:47:32.057306Z"},"links":{"citing_paper":"/paper/2412.07685"},"observation_digest":"sha256:37bcfeb22fcf330cb8c8f5592a4e96540244bb365177568f94186cddd1c368ea","observation_id":"8d5e6861-cdc8-4e4c-9c86-4fe4e4228bef","resolution":{"observed_at":"2026-08-11T18:47:32.760272Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T18:47:32.062969Z","title":"Achterberg, T","venue":null,"work_id":null,"year":2005},"citing_paper":{"arxiv_id":"2412.07685","last_updated":"2024-12-10T17:20:19Z","snapshot_observed_at":"2026-08-11T18:34:35.477586Z","submitted_at":"2024-12-10T17:20:19Z","title":"Automated Discovery of Branching Rules with Optimal Complexity for the Maximum Independent Set Problem","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-11T18:47:32.062969Z"},"links":{"citing_paper":"/paper/2412.07685"},"observation_digest":"sha256:8e8fc1deb282c31c06a0ea6c3fed0d7d0fc97cbcae5af874459df1f5ffc69bff","observation_id":"8b3df88a-b814-4b1b-8ece-4055dd398491","resolution":{"observed_at":"2026-08-11T18:47:32.062969Z","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-11T18:47:32.072370Z","title":"Akiba and Y","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2412.07685","last_updated":"2024-12-10T17:20:19Z","snapshot_observed_at":"2026-08-11T18:34:35.477586Z","submitted_at":"2024-12-10T17:20:19Z","title":"Automated Discovery of Branching Rules with Optimal Complexity for the Maximum Independent Set Problem","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-11T18:47:32.072370Z"},"links":{"citing_paper":"/paper/2412.07685"},"observation_digest":"sha256:8554aee9cef2d9b64d509330ff6a385db5f7d6eac8db2ba8c922da27305d617a","observation_id":"c7d845c5-cfc8-44c4-9454-75dbf3083148","resolution":{"observed_at":"2026-08-11T18:47:32.072370Z","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-11T18:47:32.077887Z","title":null,"venue":null,"work_id":null,"year":2005},"citing_paper":{"arxiv_id":"2412.07685","last_updated":"2024-12-10T17:20:19Z","snapshot_observed_at":"2026-08-11T18:34:35.477586Z","submitted_at":"2024-12-10T17:20:19Z","title":"Automated Discovery of Branching Rules with Optimal Complexity for the Maximum Independent Set Problem","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-11T18:47:32.077887Z"},"links":{"citing_paper":"/paper/2412.07685"},"observation_digest":"sha256:e1a207d82762d7fa4c9404ca94f4cb4236fe1e626676d7f496b500621720260a","observation_id":"c1154c95-fa36-4988-ab70-2de36e1b0806","resolution":{"observed_at":"2026-08-11T18:47:32.077887Z","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.3233/978-1-61499-918-8-17","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T18:47:32.714489Z","title":"Argelich, C","venue":null,"work_id":"a4f312ba-a267-4dfd-8b93-b91cb78875a5","year":2018},"citing_paper":{"arxiv_id":"2412.07685","last_updated":"2024-12-10T17:20:19Z","snapshot_observed_at":"2026-08-11T18:34:35.477586Z","submitted_at":"2024-12-10T17:20:19Z","title":"Automated Discovery of Branching Rules with Optimal Complexity for the Maximum Independent Set Problem","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-11T18:47:32.082879Z"},"links":{"citing_paper":"/paper/2412.07685"},"observation_digest":"sha256:0e57db2f312f4ffcb6f8f0fdb47688a62e971e2f404f1bda82a1566753ad6cb8","observation_id":"fb8cec76-8515-43da-99b7-132dc81bf5fe","resolution":{"observed_at":"2026-08-11T18:47:32.720868Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T18:47:33.752353Z","title":"Bezanson, A","venue":null,"work_id":"13910673-f180-4e51-8224-9358bb48e09b","year":2017},"citing_paper":{"arxiv_id":"2412.07685","last_updated":"2024-12-10T17:20:19Z","snapshot_observed_at":"2026-08-11T18:34:35.477586Z","submitted_at":"2024-12-10T17:20:19Z","title":"Automated Discovery of Branching Rules with Optimal Complexity for the Maximum Independent Set Problem","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-11T18:47:32.091051Z"},"links":{"citing_paper":"/paper/2412.07685"},"observation_digest":"sha256:1d3e787c2f771bccc27d5f9bf1e0e02684371663387a6342300cb975954b6b69","observation_id":"1d144168-d31d-4456-ad6c-2e97e53efdff","resolution":{"observed_at":"2026-08-11T18:47:33.757758Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T18:47:33.720068Z","title":"Bourgeois, B","venue":null,"work_id":"1a3578bb-c35a-4e30-baf0-4fae54318582","year":2012},"citing_paper":{"arxiv_id":"2412.07685","last_updated":"2024-12-10T17:20:19Z","snapshot_observed_at":"2026-08-11T18:34:35.477586Z","submitted_at":"2024-12-10T17:20:19Z","title":"Automated Discovery of Branching Rules with Optimal Complexity for the Maximum Independent Set Problem","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-11T18:47:32.096171Z"},"links":{"citing_paper":"/paper/2412.07685"},"observation_digest":"sha256:7c10879db370f66d19629762160f37876c59de40aa70700e005651f7d4e9a93e","observation_id":"336c87c8-bd7e-47ab-b624-08c5903f7e3a","resolution":{"observed_at":"2026-08-11T18:47:33.726720Z","resolver_source":"raw_fallback","status":"malformed_identifier"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T18:47:33.701732Z","title":"Carpaneto and P","venue":null,"work_id":"7d9ce61b-5247-4109-b55a-f49903be086d","year":1980},"citing_paper":{"arxiv_id":"2412.07685","last_updated":"2024-12-10T17:20:19Z","snapshot_observed_at":"2026-08-11T18:34:35.477586Z","submitted_at":"2024-12-10T17:20:19Z","title":"Automated Discovery of Branching Rules with Optimal Complexity for the Maximum Independent Set Problem","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-11T18:47:32.101240Z"},"links":{"citing_paper":"/paper/2412.07685"},"observation_digest":"sha256:d844f6eadc004a8895d3720871ed5e8558ec677727fede79c829f6c6365ff148","observation_id":"c0886879-be0f-4fe8-b32e-128d739b14f2","resolution":{"observed_at":"2026-08-11T18:47:33.708151Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1016/j.dam.2003.03.002","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T18:47:32.697422Z","title":"Chen and I","venue":null,"work_id":"37db4e74-0478-435f-9d4c-acc468115082","year":2004},"citing_paper":{"arxiv_id":"2412.07685","last_updated":"2024-12-10T17:20:19Z","snapshot_observed_at":"2026-08-11T18:34:35.477586Z","submitted_at":"2024-12-10T17:20:19Z","title":"Automated Discovery of Branching Rules with Optimal Complexity for the Maximum Independent Set Problem","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-11T18:47:32.106694Z"},"links":{"citing_paper":"/paper/2412.07685"},"observation_digest":"sha256:3b5ac4b9e2ed819816cc8d571cc22eefe9b72b375f437cb8370cea07d71d6494","observation_id":"dc8623e7-a4c2-4bab-9a82-91b4674c7984","resolution":{"observed_at":"2026-08-11T18:47:32.703242Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T18:47:32.112487Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2412.07685","last_updated":"2024-12-10T17:20:19Z","snapshot_observed_at":"2026-08-11T18:34:35.477586Z","submitted_at":"2024-12-10T17:20:19Z","title":"Automated Discovery of Branching Rules with Optimal Complexity for the Maximum Independent Set Problem","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-11T18:47:32.112487Z"},"links":{"citing_paper":"/paper/2412.07685"},"observation_digest":"sha256:7292f64b94998328ba6a6782733b08b5ef0b1e097fb55a455250db2da200781a","observation_id":"3e7559de-c2e3-4536-a70f-1891eca2691a","resolution":{"observed_at":"2026-08-11T18:47:32.112487Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T18:47:33.682185Z","title":"Cygan, F","venue":null,"work_id":"974a964f-4e24-4180-a851-c7ab23f2e632","year":2015},"citing_paper":{"arxiv_id":"2412.07685","last_updated":"2024-12-10T17:20:19Z","snapshot_observed_at":"2026-08-11T18:34:35.477586Z","submitted_at":"2024-12-10T17:20:19Z","title":"Automated Discovery of Branching Rules with Optimal Complexity for the Maximum Independent Set Problem","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-11T18:47:32.118537Z"},"links":{"citing_paper":"/paper/2412.07685"},"observation_digest":"sha256:e274cd9a6753f2889763a05722518e17e2fc96e869dcce897b237332502d0d4e","observation_id":"d48272aa-5105-4ce1-8e54-117a419cd0f8","resolution":{"observed_at":"2026-08-11T18:47:33.689401Z","resolver_source":"raw_fallback","status":"malformed_identifier"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T18:47:32.123606Z","title":"Dunning, J","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2412.07685","last_updated":"2024-12-10T17:20:19Z","snapshot_observed_at":"2026-08-11T18:34:35.477586Z","submitted_at":"2024-12-10T17:20:19Z","title":"Automated Discovery of Branching Rules with Optimal Complexity for the Maximum Independent Set Problem","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-11T18:47:32.123606Z"},"links":{"citing_paper":"/paper/2412.07685"},"observation_digest":"sha256:c6131aeafa5b945311d0624319621c3d30ecf80f26d8974fedb5b28413e12daf","observation_id":"26efeb4a-1c91-488a-8362-3f39ec21ce94","resolution":{"observed_at":"2026-08-11T18:47:32.123606Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T18:47:33.658879Z","title":"Ebadi, A","venue":null,"work_id":"bb5efd16-96e2-4c6a-95a4-fe42ef854519","year":2022},"citing_paper":{"arxiv_id":"2412.07685","last_updated":"2024-12-10T17:20:19Z","snapshot_observed_at":"2026-08-11T18:34:35.477586Z","submitted_at":"2024-12-10T17:20:19Z","title":"Automated Discovery of Branching Rules with Optimal Complexity for the Maximum Independent Set Problem","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-11T18:47:32.129145Z"},"links":{"citing_paper":"/paper/2412.07685"},"observation_digest":"sha256:6e3544a4f772ec77879de1a8312f0ca16cf5fa8cd1f3a512181b66643777722b","observation_id":"1a3f4533-c526-4489-8a7d-6501dd61f1b9","resolution":{"observed_at":"2026-08-11T18:47:33.665712Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/978-3-540-45078-8_27","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-13T11:03:48.094449Z","title":"Eppstein , The traveling salesman problem for cubic graphs, J","venue":"Lecture notes in computer science","work_id":"305efde2-1172-4905-8196-ef89d9fd010f","year":2003},"citing_paper":{"arxiv_id":"2412.07685","last_updated":"2024-12-10T17:20:19Z","snapshot_observed_at":"2026-08-11T18:34:35.477586Z","submitted_at":"2024-12-10T17:20:19Z","title":"Automated Discovery of Branching Rules with Optimal Complexity for the Maximum Independent Set Problem","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-11T18:47:32.133944Z"},"links":{"citing_paper":"/paper/2412.07685"},"observation_digest":"sha256:93bdc9f504ae87f62360f1347ecc9bcc9ca5e5350157b550f2a019b536f25350","observation_id":"86dc1472-d49d-45c3-ae18-4ff26adff41f","resolution":{"observed_at":"2026-08-11T18:47:32.659226Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T18:47:33.640251Z","title":"F airbanks, M","venue":null,"work_id":"493b7a60-adea-4deb-955c-24def315b8a7","year":2021},"citing_paper":{"arxiv_id":"2412.07685","last_updated":"2024-12-10T17:20:19Z","snapshot_observed_at":"2026-08-11T18:34:35.477586Z","submitted_at":"2024-12-10T17:20:19Z","title":"Automated Discovery of Branching Rules with Optimal Complexity for the Maximum Independent Set Problem","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-11T18:47:32.139214Z"},"links":{"citing_paper":"/paper/2412.07685"},"observation_digest":"sha256:479e1dc50cb1214aebf437275ce763b088da84d7f2beffa5c938c5941a6d60a0","observation_id":"14599d84-a594-4057-80a4-bac22c0ae247","resolution":{"observed_at":"2026-08-11T18:47:33.646311Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T18:47:33.615863Z","title":"Fischetti and M","venue":null,"work_id":"7feae2d2-de83-492b-adcf-c8e60dae23fe","year":2011},"citing_paper":{"arxiv_id":"2412.07685","last_updated":"2024-12-10T17:20:19Z","snapshot_observed_at":"2026-08-11T18:34:35.477586Z","submitted_at":"2024-12-10T17:20:19Z","title":"Automated Discovery of Branching Rules with Optimal Complexity for the Maximum Independent Set Problem","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-11T18:47:32.144076Z"},"links":{"citing_paper":"/paper/2412.07685"},"observation_digest":"sha256:1809f28bf444c561b54e3d9fb4cc4a35cad44ad9b59d08e1bc997ee5baf163f2","observation_id":"5e55e8ca-ee22-4ed6-ba52-fadbc5ca8a60","resolution":{"observed_at":"2026-08-11T18:47:33.625269Z","resolver_source":"raw_fallback","status":"malformed_identifier"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T18:47:32.149016Z","title":null,"venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2412.07685","last_updated":"2024-12-10T17:20:19Z","snapshot_observed_at":"2026-08-11T18:34:35.477586Z","submitted_at":"2024-12-10T17:20:19Z","title":"Automated Discovery of Branching Rules with Optimal Complexity for the Maximum Independent Set Problem","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-11T18:47:32.149016Z"},"links":{"citing_paper":"/paper/2412.07685"},"observation_digest":"sha256:0af168d50085b060475a9dc23225243eaac192f92ac8de24803cb721a294c93b","observation_id":"c2d8d61b-b4f2-4b30-a0ad-b13013ba4f13","resolution":{"observed_at":"2026-08-11T18:47:32.149016Z","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/j.ipl.2005.10.012","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T18:47:32.635733Z","title":null,"venue":null,"work_id":"42cf3acf-7881-4c57-9127-8e871c4a18b1","year":2006},"citing_paper":{"arxiv_id":"2412.07685","last_updated":"2024-12-10T17:20:19Z","snapshot_observed_at":"2026-08-11T18:34:35.477586Z","submitted_at":"2024-12-10T17:20:19Z","title":"Automated Discovery of Branching Rules with Optimal Complexity for the Maximum Independent Set Problem","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-11T18:47:32.153684Z"},"links":{"citing_paper":"/paper/2412.07685"},"observation_digest":"sha256:c6e462506dea35fe58789ed0fdc3969cd87daa2584a9826aa7cd6600ff4444f3","observation_id":"96ae9f61-503e-4932-a813-e96e48f5affb","resolution":{"observed_at":"2026-08-11T18:47:32.642331Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"8556.24285","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T18:47:33.290081Z","title":null,"venue":null,"work_id":"db1fbe19-b78d-453e-9b28-72445468de70","year":2013},"citing_paper":{"arxiv_id":"2412.07685","last_updated":"2024-12-10T17:20:19Z","snapshot_observed_at":"2026-08-11T18:34:35.477586Z","submitted_at":"2024-12-10T17:20:19Z","title":"Automated Discovery of Branching Rules with Optimal Complexity for the Maximum Independent Set Problem","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-11T18:47:32.158958Z"},"links":{"citing_paper":"/paper/2412.07685"},"observation_digest":"sha256:3a85e81149d247f2185bef29a876942e2dbfab6b2ba048f0b91176c8cb55af3d","observation_id":"71c75b04-a066-4f99-8049-284bee0a6d35","resolution":{"observed_at":"2026-08-11T18:47:33.299381Z","resolver_source":"raw_fallback","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T18:47:32.164949Z","title":"Gamrath and C","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2412.07685","last_updated":"2024-12-10T17:20:19Z","snapshot_observed_at":"2026-08-11T18:34:35.477586Z","submitted_at":"2024-12-10T17:20:19Z","title":"Automated Discovery of Branching Rules with Optimal Complexity for the Maximum Independent Set Problem","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-11T18:47:32.164949Z"},"links":{"citing_paper":"/paper/2412.07685"},"observation_digest":"sha256:7ffb61a14dc869ced32b61b4a8924f9c9dbbda8a2371a2f99b0cd0e5d15a7fda","observation_id":"0e219b49-cedd-4037-9c3c-025e0eebc963","resolution":{"observed_at":"2026-08-11T18:47:32.164949Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T18:47:33.590450Z","title":null,"venue":null,"work_id":"b649880c-3ac9-4b7d-9f57-ccda1e94691c","year":2024},"citing_paper":{"arxiv_id":"2412.07685","last_updated":"2024-12-10T17:20:19Z","snapshot_observed_at":"2026-08-11T18:34:35.477586Z","submitted_at":"2024-12-10T17:20:19Z","title":"Automated Discovery of Branching Rules with Optimal Complexity for the Maximum Independent Set Problem","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-11T18:47:32.169983Z"},"links":{"citing_paper":"/paper/2412.07685"},"observation_digest":"sha256:b62b79a45982798acc1686d09cd34110f8a584299f3f79a96f49cd063e548f0b","observation_id":"23b8ac6c-f65f-4b84-a76d-64d723e4f8bb","resolution":{"observed_at":"2026-08-11T18:47:33.601223Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T18:47:32.174578Z","title":"Hespe, S","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2412.07685","last_updated":"2024-12-10T17:20:19Z","snapshot_observed_at":"2026-08-11T18:34:35.477586Z","submitted_at":"2024-12-10T17:20:19Z","title":"Automated Discovery of Branching Rules with Optimal Complexity for the Maximum Independent Set Problem","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-11T18:47:32.174578Z"},"links":{"citing_paper":"/paper/2412.07685"},"observation_digest":"sha256:cc1e17ef47be374dec19510d4f7237b42c244875c7e03b3c35c359cef3aa5708","observation_id":"25978e3a-dda8-40ae-b1ca-7c809bd4e497","resolution":{"observed_at":"2026-08-11T18:47:32.174578Z","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-11T18:47:32.179535Z","title":"Huangfu and J","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2412.07685","last_updated":"2024-12-10T17:20:19Z","snapshot_observed_at":"2026-08-11T18:34:35.477586Z","submitted_at":"2024-12-10T17:20:19Z","title":"Automated Discovery of Branching Rules with Optimal Complexity for the Maximum Independent Set Problem","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-11T18:47:32.179535Z"},"links":{"citing_paper":"/paper/2412.07685"},"observation_digest":"sha256:9153382b7685cdecfe0504687ffe6bf554fb2510ab7bba3654e5bc4ed62cd8e3","observation_id":"6ad17a47-9e3c-4d4a-8ae5-8d26ccfc1dc8","resolution":{"observed_at":"2026-08-11T18:47:32.179535Z","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-11T18:47:32.185522Z","title":"Impagliazzo and R","venue":null,"work_id":null,"year":2001},"citing_paper":{"arxiv_id":"2412.07685","last_updated":"2024-12-10T17:20:19Z","snapshot_observed_at":"2026-08-11T18:34:35.477586Z","submitted_at":"2024-12-10T17:20:19Z","title":"Automated Discovery of Branching Rules with Optimal Complexity for the Maximum Independent Set Problem","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-11T18:47:32.185522Z"},"links":{"citing_paper":"/paper/2412.07685"},"observation_digest":"sha256:a9890573923189f188e0286e82c93fa59d063bb15ac6f0930e2a6e109ddcdee5","observation_id":"7a1232f2-f334-4fd0-85fa-091c9c995ab1","resolution":{"observed_at":"2026-08-11T18:47:32.185522Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1308.1351","last_updated":"2022-06-17T12:09:17Z","snapshot_observed_at":"2026-08-10T08:29:28.269708Z","submitted_at":"2013-08-06T17:08:50Z","title":"An $O^*(1.0821^n)$-Time Algorithm for Computing Maximum Independent Set in Graphs with Bounded Degree 3","version":4},"cited_work":{"arxiv_id":"1308.1351","doi":"10.48550/arxiv.1308.1351","metadata_source":"pith","pith_arxiv_id":"1308.1351","snapshot_observed_at":"2026-08-12T00:16:22.474752Z","title":"An $O^*(1.0821^n)$-Time Algorithm for Computing Maximum Independent Set in Graphs with Bounded Degree 3","venue":"cs.DS","work_id":"e268e72a-77d4-4ea9-8376-34ff6ef2f54e","year":2013},"citing_paper":{"arxiv_id":"2412.07685","last_updated":"2024-12-10T17:20:19Z","snapshot_observed_at":"2026-08-11T18:34:35.477586Z","submitted_at":"2024-12-10T17:20:19Z","title":"Automated Discovery of Branching Rules with Optimal Complexity for the Maximum Independent Set Problem","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-11T18:47:32.190436Z"},"links":{"cited_paper":"/paper/1308.1351","citing_paper":"/paper/2412.07685"},"observation_digest":"sha256:8fd286def0a409dedfde55f8bc0d325def404be2ac6eacbe8df8ed23ec119703","observation_id":"cece0625-1db9-4b11-ae60-2c75d93c830c","resolution":{"observed_at":"2026-08-11T18:47:32.587071Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T18:47:32.195865Z","title":"Jian, An O(20.304n) algorithm for solving maximum independent set problem, IEEE Trans","venue":null,"work_id":null,"year":1986},"citing_paper":{"arxiv_id":"2412.07685","last_updated":"2024-12-10T17:20:19Z","snapshot_observed_at":"2026-08-11T18:34:35.477586Z","submitted_at":"2024-12-10T17:20:19Z","title":"Automated Discovery of Branching Rules with Optimal Complexity for the Maximum Independent Set Problem","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-11T18:47:32.195865Z"},"links":{"citing_paper":"/paper/2412.07685"},"observation_digest":"sha256:e22b4b45b9f3277a1775ad1f4c792b6a817d50a7fc868f106e9f4e3e54f1c6e5","observation_id":"cee0f75f-6e3b-4060-9f5b-91ab2ef280c9","resolution":{"observed_at":"2026-08-11T18:47:32.195865Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T18:47:33.569111Z","title":"Khalil, P","venue":null,"work_id":"d20a2624-5d6e-4ec0-a603-aa2f6c348b0c","year":2016},"citing_paper":{"arxiv_id":"2412.07685","last_updated":"2024-12-10T17:20:19Z","snapshot_observed_at":"2026-08-11T18:34:35.477586Z","submitted_at":"2024-12-10T17:20:19Z","title":"Automated Discovery of Branching Rules with Optimal Complexity for the Maximum Independent Set Problem","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-11T18:47:32.201299Z"},"links":{"citing_paper":"/paper/2412.07685"},"observation_digest":"sha256:ec9c580436c201489a8936d3f3d8e104d846025606edcc9d8ce8350e71cdebff","observation_id":"aed0bd64-8e34-4791-b930-aef9718454e6","resolution":{"observed_at":"2026-08-11T18:47:33.574742Z","resolver_source":"raw_fallback","status":"malformed_identifier"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2009.2326","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T18:47:33.011775Z","title":"Kneis, A","venue":null,"work_id":"f2fda3ff-83c5-4c84-83e2-783117db1ae3","year":2009},"citing_paper":{"arxiv_id":"2412.07685","last_updated":"2024-12-10T17:20:19Z","snapshot_observed_at":"2026-08-11T18:34:35.477586Z","submitted_at":"2024-12-10T17:20:19Z","title":"Automated Discovery of Branching Rules with Optimal Complexity for the Maximum Independent Set Problem","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-11T18:47:32.205905Z"},"links":{"citing_paper":"/paper/2412.07685"},"observation_digest":"sha256:6b7a34cad41286f0518487940ac3f586053a12182abe292886be143455e613c8","observation_id":"0b66da46-eb08-4a87-94aa-54b7268f7642","resolution":{"observed_at":"2026-08-11T18:47:33.022001Z","resolver_source":"raw_fallback","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T18:47:32.210759Z","title":null,"venue":null,"work_id":null,"year":1960},"citing_paper":{"arxiv_id":"2412.07685","last_updated":"2024-12-10T17:20:19Z","snapshot_observed_at":"2026-08-11T18:34:35.477586Z","submitted_at":"2024-12-10T17:20:19Z","title":"Automated Discovery of Branching Rules with Optimal Complexity for the Maximum Independent Set Problem","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-11T18:47:32.210759Z"},"links":{"citing_paper":"/paper/2412.07685"},"observation_digest":"sha256:908150417a291dadd98acbed9b16172a771e413946bed2e00212b1d89e3369eb","observation_id":"328b1b2a-f53d-4703-9420-67e411ddfc2f","resolution":{"observed_at":"2026-08-11T18:47:32.210759Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T18:47:33.546810Z","title":"Le Bodic and G","venue":null,"work_id":"c6292bac-cbfd-4d2b-880a-ea42374de479","year":2017},"citing_paper":{"arxiv_id":"2412.07685","last_updated":"2024-12-10T17:20:19Z","snapshot_observed_at":"2026-08-11T18:34:35.477586Z","submitted_at":"2024-12-10T17:20:19Z","title":"Automated Discovery of Branching Rules with Optimal Complexity for the Maximum Independent Set Problem","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-11T18:47:32.215953Z"},"links":{"citing_paper":"/paper/2412.07685"},"observation_digest":"sha256:d0f01b7f892ff94598948debde28fe478f05be6a08a5172c157151cf279b118f","observation_id":"493b31ae-ea44-4026-a5c7-7a6a4883af0d","resolution":{"observed_at":"2026-08-11T18:47:33.551943Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T18:47:33.529299Z","title":null,"venue":null,"work_id":"47e895b2-5605-425c-b3f7-bef43befbf14","year":2005},"citing_paper":{"arxiv_id":"2412.07685","last_updated":"2024-12-10T17:20:19Z","snapshot_observed_at":"2026-08-11T18:34:35.477586Z","submitted_at":"2024-12-10T17:20:19Z","title":"Automated Discovery of Branching Rules with Optimal Complexity for the Maximum Independent Set Problem","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-11T18:47:32.221123Z"},"links":{"citing_paper":"/paper/2412.07685"},"observation_digest":"sha256:ff902494bfaa0a7a3471df03c22a4b956dfc3e5a65942bf0880636fca36663cc","observation_id":"07b682a9-4ffa-4cd1-b41b-f159780bf197","resolution":{"observed_at":"2026-08-11T18:47:33.533964Z","resolver_source":"raw_fallback","status":"malformed_identifier"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T18:47:32.226190Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2412.07685","last_updated":"2024-12-10T17:20:19Z","snapshot_observed_at":"2026-08-11T18:34:35.477586Z","submitted_at":"2024-12-10T17:20:19Z","title":"Automated Discovery of Branching Rules with Optimal Complexity for the Maximum Independent Set Problem","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-11T18:47:32.226190Z"},"links":{"citing_paper":"/paper/2412.07685"},"observation_digest":"sha256:916748a25e0d2287fdbb7b135988b7670ce493dacabb1ed1fadbf8d15c524576","observation_id":"365d03be-48dc-480c-985d-273d00dd5855","resolution":{"observed_at":"2026-08-11T18:47:32.226190Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T18:47:33.510433Z","title":null,"venue":null,"work_id":"7d2afc40-3b3c-4469-ba77-86a3f9ff668f","year":2024},"citing_paper":{"arxiv_id":"2412.07685","last_updated":"2024-12-10T17:20:19Z","snapshot_observed_at":"2026-08-11T18:34:35.477586Z","submitted_at":"2024-12-10T17:20:19Z","title":"Automated Discovery of Branching Rules with Optimal Complexity for the Maximum Independent Set Problem","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-11T18:47:32.231845Z"},"links":{"citing_paper":"/paper/2412.07685"},"observation_digest":"sha256:2f169c777b6b91e6df79d27e52a8c16c076c3200863c9aa885035e1c2c3c8f67","observation_id":"29c1eaf1-ab8b-4090-8f69-35a9449179b7","resolution":{"observed_at":"2026-08-11T18:47:33.516074Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T18:47:33.487962Z","title":"Lubin, O","venue":null,"work_id":"c2acf2ec-a3ed-4212-99f0-a5d6574aaeac","year":2023},"citing_paper":{"arxiv_id":"2412.07685","last_updated":"2024-12-10T17:20:19Z","snapshot_observed_at":"2026-08-11T18:34:35.477586Z","submitted_at":"2024-12-10T17:20:19Z","title":"Automated Discovery of Branching Rules with Optimal Complexity for the Maximum Independent Set Problem","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-11T18:47:32.236850Z"},"links":{"citing_paper":"/paper/2412.07685"},"observation_digest":"sha256:8551bc1b8a1bb49c1ce7476955f4a61dd4fb97ef71cfabfc20f3d40d4304228e","observation_id":"0bd093c7-8779-444a-af10-30d70aa28083","resolution":{"observed_at":"2026-08-11T18:47:33.494205Z","resolver_source":"raw_fallback","status":"malformed_identifier"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T18:47:32.241315Z","title":null,"venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2412.07685","last_updated":"2024-12-10T17:20:19Z","snapshot_observed_at":"2026-08-11T18:34:35.477586Z","submitted_at":"2024-12-10T17:20:19Z","title":"Automated Discovery of Branching Rules with Optimal Complexity for the Maximum Independent Set Problem","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-11T18:47:32.241315Z"},"links":{"citing_paper":"/paper/2412.07685"},"observation_digest":"sha256:9dafd29cf78ecf5b65c1eac11fb0810e676ad8176de23d0cca53cfcfeadd3933","observation_id":"ebde626b-a180-4684-8576-1de57d6f4ac6","resolution":{"observed_at":"2026-08-11T18:47:32.241315Z","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-11T18:47:32.245886Z","title":"Moore and S","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2412.07685","last_updated":"2024-12-10T17:20:19Z","snapshot_observed_at":"2026-08-11T18:34:35.477586Z","submitted_at":"2024-12-10T17:20:19Z","title":"Automated Discovery of Branching Rules with Optimal Complexity for the Maximum Independent Set Problem","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-11T18:47:32.245886Z"},"links":{"citing_paper":"/paper/2412.07685"},"observation_digest":"sha256:4af3e7fce1d6b1d5ca0e5a8567ed7cced2a892a8ec72be32d1a57582d13c0fce","observation_id":"22f8dd87-2359-463e-a525-3fd032d7a7e2","resolution":{"observed_at":"2026-08-11T18:47:32.245886Z","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-11T18:47:32.252900Z","title":null,"venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2412.07685","last_updated":"2024-12-10T17:20:19Z","snapshot_observed_at":"2026-08-11T18:34:35.477586Z","submitted_at":"2024-12-10T17:20:19Z","title":"Automated Discovery of Branching Rules with Optimal Complexity for the Maximum Independent Set Problem","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-11T18:47:32.252900Z"},"links":{"citing_paper":"/paper/2412.07685"},"observation_digest":"sha256:194970a3c1b8f62e652e849e5a17447b41acbe5adb2a09e9f31fccb5a72d7f1e","observation_id":"bb1ee3e4-a685-4015-bd7d-8cd41fb94852","resolution":{"observed_at":"2026-08-11T18:47:32.252900Z","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/j.amc.2009.01.013","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T18:47:32.511137Z","title":"Nabli, An overview on the simplex algorithm, Appl","venue":null,"work_id":"1ed1037f-b655-476a-8723-11e804b05bfc","year":2009},"citing_paper":{"arxiv_id":"2412.07685","last_updated":"2024-12-10T17:20:19Z","snapshot_observed_at":"2026-08-11T18:34:35.477586Z","submitted_at":"2024-12-10T17:20:19Z","title":"Automated Discovery of Branching Rules with Optimal Complexity for the Maximum Independent Set Problem","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-11T18:47:32.258225Z"},"links":{"citing_paper":"/paper/2412.07685"},"observation_digest":"sha256:a3a880def97b5f53f16bd194e4afb5391420fe239bf7a6f8d1ef59054d932a87","observation_id":"bc811577-ce15-4e76-ae86-bc987b6d58ce","resolution":{"observed_at":"2026-08-11T18:47:32.515970Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T18:47:32.263743Z","title":"Peres and M","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2412.07685","last_updated":"2024-12-10T17:20:19Z","snapshot_observed_at":"2026-08-11T18:34:35.477586Z","submitted_at":"2024-12-10T17:20:19Z","title":"Automated Discovery of Branching Rules with Optimal Complexity for the Maximum Independent Set Problem","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-11T18:47:32.263743Z"},"links":{"citing_paper":"/paper/2412.07685"},"observation_digest":"sha256:c22aa9dcced6797712f782268cc1c298097e53d6c1c71ffc548ef5c72c360c5d","observation_id":"f916c15c-9ad0-472d-bab4-9e9158a4ec22","resolution":{"observed_at":"2026-08-11T18:47:32.263743Z","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-11T18:47:32.269222Z","title":"Robson, Algorithms for maximum independent sets, J","venue":null,"work_id":null,"year":1986},"citing_paper":{"arxiv_id":"2412.07685","last_updated":"2024-12-10T17:20:19Z","snapshot_observed_at":"2026-08-11T18:34:35.477586Z","submitted_at":"2024-12-10T17:20:19Z","title":"Automated Discovery of Branching Rules with Optimal Complexity for the Maximum Independent Set Problem","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-11T18:47:32.269222Z"},"links":{"citing_paper":"/paper/2412.07685"},"observation_digest":"sha256:231ac30981f7a749f488470108d12bb3366c3e6cd90d5435198f51b2c76c3395","observation_id":"2d57e746-6665-497a-8b49-1ffb2f540b13","resolution":{"observed_at":"2026-08-11T18:47:32.269222Z","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-11T18:47:32.274297Z","title":null,"venue":null,"work_id":null,"year":1977},"citing_paper":{"arxiv_id":"2412.07685","last_updated":"2024-12-10T17:20:19Z","snapshot_observed_at":"2026-08-11T18:34:35.477586Z","submitted_at":"2024-12-10T17:20:19Z","title":"Automated Discovery of Branching Rules with Optimal Complexity for the Maximum Independent Set Problem","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-11T18:47:32.274297Z"},"links":{"citing_paper":"/paper/2412.07685"},"observation_digest":"sha256:662a8a06bc73d14272d60a0e8907481c7b887423a13bf35b22241a48f6a8a612","observation_id":"53fbfeb1-6ae2-4e2b-8ff9-358b3843ffca","resolution":{"observed_at":"2026-08-11T18:47:32.274297Z","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.2307/421131","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T18:47:32.452494Z","title":"Urquhart, The complexity of propositional proofs, Bull","venue":null,"work_id":"e6afcd08-adee-4b0c-aa03-b692a1e32899","year":1995},"citing_paper":{"arxiv_id":"2412.07685","last_updated":"2024-12-10T17:20:19Z","snapshot_observed_at":"2026-08-11T18:34:35.477586Z","submitted_at":"2024-12-10T17:20:19Z","title":"Automated Discovery of Branching Rules with Optimal Complexity for the Maximum Independent Set Problem","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-11T18:47:32.280358Z"},"links":{"citing_paper":"/paper/2412.07685"},"observation_digest":"sha256:cf23433eeec1c98e0669a0d4c21156c02200c00789999947f7e3a1a52dc85952","observation_id":"04419795-d704-44d9-907c-96788f9f0e2f","resolution":{"observed_at":"2026-08-11T18:47:32.458443Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"0904.2712","last_updated":"2009-04-17T14:19:12Z","snapshot_observed_at":"2026-07-06T01:53:52.839980Z","submitted_at":"2009-04-17T14:19:12Z","title":"New Branching Rules: Improvements on Independent Set and Vertex Cover in Sparse Graphs","version":1},"cited_work":{"arxiv_id":"0904.2712","doi":"10.48550/arxiv.0904.2712","metadata_source":"pith","pith_arxiv_id":"0904.2712","snapshot_observed_at":"2026-08-12T00:16:22.474752Z","title":"New Branching Rules: Improvements on Independent Set and Vertex Cover in Sparse Graphs","venue":"cs.DS","work_id":"56038152-a035-4c4b-bbdb-b90c8c8659c6","year":2009},"citing_paper":{"arxiv_id":"2412.07685","last_updated":"2024-12-10T17:20:19Z","snapshot_observed_at":"2026-08-11T18:34:35.477586Z","submitted_at":"2024-12-10T17:20:19Z","title":"Automated Discovery of Branching Rules with Optimal Complexity for the Maximum Independent Set Problem","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-11T18:47:32.287444Z"},"links":{"cited_paper":"/paper/0904.2712","citing_paper":"/paper/2412.07685"},"observation_digest":"sha256:dd18a74226dba5b4659f5ec344b401ac4a347b1025b9471ae6010e1afb816c78","observation_id":"1ca23c28-fa04-4a43-802e-b39c70e4b95c","resolution":{"observed_at":"2026-08-11T18:47:32.437277Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/978-3-642-14031-0_18","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-13T11:03:48.094449Z","title":"Xiao, A note on vertex cover in graphs with maximum degree 3, in Computing and Com- binatorics, Springer, 2010, pp","venue":"Lecture notes in computer science","work_id":"bc61a106-8f66-460e-9be2-af7bca2fc6ec","year":2010},"citing_paper":{"arxiv_id":"2412.07685","last_updated":"2024-12-10T17:20:19Z","snapshot_observed_at":"2026-08-11T18:34:35.477586Z","submitted_at":"2024-12-10T17:20:19Z","title":"Automated Discovery of Branching Rules with Optimal Complexity for the Maximum Independent Set Problem","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-11T18:47:32.294655Z"},"links":{"citing_paper":"/paper/2412.07685"},"observation_digest":"sha256:e116201af1519540af5c42b8e3484ae7a1078ea05047d0d1dfa1b4adbaec86db","observation_id":"5532ffd4-f44a-4c5e-a9ac-3c8a53084471","resolution":{"observed_at":"2026-08-11T18:47:32.400597Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T18:47:32.302920Z","title":"Xiao and H","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2412.07685","last_updated":"2024-12-10T17:20:19Z","snapshot_observed_at":"2026-08-11T18:34:35.477586Z","submitted_at":"2024-12-10T17:20:19Z","title":"Automated Discovery of Branching Rules with Optimal Complexity for the Maximum Independent Set Problem","version":1},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-11T18:47:32.302920Z"},"links":{"citing_paper":"/paper/2412.07685"},"observation_digest":"sha256:d0f3a536096e10b6f29f263e2af91095c2818698e3bdf99f9675b815162d8bf5","observation_id":"edc4d1b8-90ce-42d3-b61a-3c36ff051184","resolution":{"observed_at":"2026-08-11T18:47:32.302920Z","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-11T18:47:32.309516Z","title":"Xiao and H","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2412.07685","last_updated":"2024-12-10T17:20:19Z","snapshot_observed_at":"2026-08-11T18:34:35.477586Z","submitted_at":"2024-12-10T17:20:19Z","title":"Automated Discovery of Branching Rules with Optimal Complexity for the Maximum Independent Set Problem","version":1},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-11T18:47:32.309516Z"},"links":{"citing_paper":"/paper/2412.07685"},"observation_digest":"sha256:c13df984c2a4ab00bb778eb571d7e7d8fb4457b1aef933f36695c8087841c5f8","observation_id":"aa36e7a9-d7e0-40be-8459-7ecf3930910b","resolution":{"observed_at":"2026-08-11T18:47:32.309516Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2412.07685","last_updated":"2024-12-10T17:20:19Z","latest_version":1,"primary_category":"math.OC","snapshot_observed_at":"2026-08-11T18:34:35.477586Z","submitted_at":"2024-12-10T17:20:19Z","title":"Automated Discovery of Branching Rules with Optimal Complexity for the Maximum Independent Set Problem"},"reference_resolution":{"displayed":48,"state_counts":{"malformed_identifier":6,"metadata_mismatch":1,"parse_uncertain":0,"unresolved":24,"verified_exact":12,"verified_fuzzy":5},"total_outbound_references":48},"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-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"thesis":"As of 14 August 2026, this Paper Citation Record lists 48 of 48 outbound references and 1 inbound Pith citation observation for arXiv:2412.07685."}