{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:OGKC32P5RM4EBXIWBQTILNNDSL","short_pith_number":"pith:OGKC32P5","schema_version":"1.0","canonical_sha256":"71942de9fd8b3840dd160c2685b5a392c40b4a596fe0413c63716a0a044ef5dc","source":{"kind":"arxiv","id":"2003.12293","version":2},"attestation_state":"computed","paper":{"title":"Large independent sets on random $d$-regular graphs with fixed degree $d$","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Raffaele Marino, Scott Kirkpatrick","submitted_at":"2020-03-27T09:17:48Z","abstract_excerpt":"This paper presents a linear prioritized local algorithm that computes large independent sets on a random $d$-regular graph with small and fixed degree $d$. We studied experimentally the independence ratio obtained by the algorithm when $ d \\in [3,100]$. For all $d \\in [5,100]$, our results are larger than lower bounds calculated by exact methods, thus providing improved estimates of lower bounds."},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2003.12293","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2020-03-27T09:17:48Z","cross_cats_sorted":[],"title_canon_sha256":"ead3f06a0f99bff4bfcd162353e3ea01bcb2b23f22ba9705f05c091393a75b9b","abstract_canon_sha256":"b1490698bf502bcaa86c34e960cdec57212f03018c7640c306036a06aab063af"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:06:10.561141Z","signature_b64":"PjpWZjZTgxju0r9PpYFF4zRXlBBi5VQbjwlT6wDVqpA8C4EIrVPGCZg9qAJSnrjsamjyd34Vk75hPSC7J+laAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"71942de9fd8b3840dd160c2685b5a392c40b4a596fe0413c63716a0a044ef5dc","last_reissued_at":"2026-07-05T03:06:10.560771Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:06:10.560771Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Large independent sets on random $d$-regular graphs with fixed degree $d$","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Raffaele Marino, Scott Kirkpatrick","submitted_at":"2020-03-27T09:17:48Z","abstract_excerpt":"This paper presents a linear prioritized local algorithm that computes large independent sets on a random $d$-regular graph with small and fixed degree $d$. We studied experimentally the independence ratio obtained by the algorithm when $ d \\in [3,100]$. For all $d \\in [5,100]$, our results are larger than lower bounds calculated by exact methods, thus providing improved estimates of lower bounds."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2003.12293","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2003.12293/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"2003.12293","created_at":"2026-07-05T03:06:10.560825+00:00"},{"alias_kind":"arxiv_version","alias_value":"2003.12293v2","created_at":"2026-07-05T03:06:10.560825+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2003.12293","created_at":"2026-07-05T03:06:10.560825+00:00"},{"alias_kind":"pith_short_12","alias_value":"OGKC32P5RM4E","created_at":"2026-07-05T03:06:10.560825+00:00"},{"alias_kind":"pith_short_16","alias_value":"OGKC32P5RM4EBXIW","created_at":"2026-07-05T03:06:10.560825+00:00"},{"alias_kind":"pith_short_8","alias_value":"OGKC32P5","created_at":"2026-07-05T03:06:10.560825+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2607.22372","citing_title":"Quantum-informed surrogate sampling for combinatorial optimization","ref_index":81,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/OGKC32P5RM4EBXIWBQTILNNDSL","json":"https://pith.science/pith/OGKC32P5RM4EBXIWBQTILNNDSL.json","graph_json":"https://pith.science/api/pith-number/OGKC32P5RM4EBXIWBQTILNNDSL/graph.json","events_json":"https://pith.science/api/pith-number/OGKC32P5RM4EBXIWBQTILNNDSL/events.json","paper":"https://pith.science/paper/OGKC32P5"},"agent_actions":{"view_html":"https://pith.science/pith/OGKC32P5RM4EBXIWBQTILNNDSL","download_json":"https://pith.science/pith/OGKC32P5RM4EBXIWBQTILNNDSL.json","view_paper":"https://pith.science/paper/OGKC32P5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2003.12293&json=true","fetch_graph":"https://pith.science/api/pith-number/OGKC32P5RM4EBXIWBQTILNNDSL/graph.json","fetch_events":"https://pith.science/api/pith-number/OGKC32P5RM4EBXIWBQTILNNDSL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OGKC32P5RM4EBXIWBQTILNNDSL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OGKC32P5RM4EBXIWBQTILNNDSL/action/storage_attestation","attest_author":"https://pith.science/pith/OGKC32P5RM4EBXIWBQTILNNDSL/action/author_attestation","sign_citation":"https://pith.science/pith/OGKC32P5RM4EBXIWBQTILNNDSL/action/citation_signature","submit_replication":"https://pith.science/pith/OGKC32P5RM4EBXIWBQTILNNDSL/action/replication_record"}},"created_at":"2026-07-05T03:06:10.560825+00:00","updated_at":"2026-07-05T03:06:10.560825+00:00"}