{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:5OCL5A5NF7Q2S2CJNJ4CL2BTL7","short_pith_number":"pith:5OCL5A5N","schema_version":"1.0","canonical_sha256":"eb84be83ad2fe1a968496a7825e8335fd44e5c88e2c2d4dfebc8e1cceb4fe5ed","source":{"kind":"arxiv","id":"2501.02136","version":1},"attestation_state":"computed","paper":{"title":"Locally computing edge orientations","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Mihir Singhal, Ronitt Rubinfeld, Slobodan Mitrovi\\'c","submitted_at":"2025-01-03T23:03:29Z","abstract_excerpt":"We consider the question of orienting the edges in a graph $G$ such that every vertex has bounded out-degree. For graphs of arboricity $\\alpha$, there is an orientation in which every vertex has out-degree at most $\\alpha$ and, moreover, the best possible maximum out-degree of an orientation is at least $\\alpha - 1$. We are thus interested in algorithms that can achieve a maximum out-degree of close to $\\alpha$. A widely studied approach for this problem in the distributed algorithms setting is a ``peeling algorithm'' that provides an orientation with maximum out-degree $\\alpha(2+\\epsilon)$ in"},"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":"2501.02136","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2025-01-03T23:03:29Z","cross_cats_sorted":[],"title_canon_sha256":"67cc7753c33b8ef172af438e54c8c04770400e7affbac549cdd961617ae67826","abstract_canon_sha256":"bad58f1b34af0873f24d636f59a2aacc9a17ef20a294b3c41c1dfc0354586e23"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:57:02.722221Z","signature_b64":"ERtnnTeE6aTBX/S1bWRB+qdaaCPdkfr/j43x1DUIh0G/9P+W+9iX5G1WYLXSMJDM8MIDzBNrm8CdHC3H2VtsCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"eb84be83ad2fe1a968496a7825e8335fd44e5c88e2c2d4dfebc8e1cceb4fe5ed","last_reissued_at":"2026-07-05T09:57:02.721775Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:57:02.721775Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Locally computing edge orientations","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Mihir Singhal, Ronitt Rubinfeld, Slobodan Mitrovi\\'c","submitted_at":"2025-01-03T23:03:29Z","abstract_excerpt":"We consider the question of orienting the edges in a graph $G$ such that every vertex has bounded out-degree. For graphs of arboricity $\\alpha$, there is an orientation in which every vertex has out-degree at most $\\alpha$ and, moreover, the best possible maximum out-degree of an orientation is at least $\\alpha - 1$. We are thus interested in algorithms that can achieve a maximum out-degree of close to $\\alpha$. A widely studied approach for this problem in the distributed algorithms setting is a ``peeling algorithm'' that provides an orientation with maximum out-degree $\\alpha(2+\\epsilon)$ in"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2501.02136","kind":"arxiv","version":1},"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/2501.02136/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":"2501.02136","created_at":"2026-07-05T09:57:02.721827+00:00"},{"alias_kind":"arxiv_version","alias_value":"2501.02136v1","created_at":"2026-07-05T09:57:02.721827+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2501.02136","created_at":"2026-07-05T09:57:02.721827+00:00"},{"alias_kind":"pith_short_12","alias_value":"5OCL5A5NF7Q2","created_at":"2026-07-05T09:57:02.721827+00:00"},{"alias_kind":"pith_short_16","alias_value":"5OCL5A5NF7Q2S2CJ","created_at":"2026-07-05T09:57:02.721827+00:00"},{"alias_kind":"pith_short_8","alias_value":"5OCL5A5N","created_at":"2026-07-05T09:57:02.721827+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/5OCL5A5NF7Q2S2CJNJ4CL2BTL7","json":"https://pith.science/pith/5OCL5A5NF7Q2S2CJNJ4CL2BTL7.json","graph_json":"https://pith.science/api/pith-number/5OCL5A5NF7Q2S2CJNJ4CL2BTL7/graph.json","events_json":"https://pith.science/api/pith-number/5OCL5A5NF7Q2S2CJNJ4CL2BTL7/events.json","paper":"https://pith.science/paper/5OCL5A5N"},"agent_actions":{"view_html":"https://pith.science/pith/5OCL5A5NF7Q2S2CJNJ4CL2BTL7","download_json":"https://pith.science/pith/5OCL5A5NF7Q2S2CJNJ4CL2BTL7.json","view_paper":"https://pith.science/paper/5OCL5A5N","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2501.02136&json=true","fetch_graph":"https://pith.science/api/pith-number/5OCL5A5NF7Q2S2CJNJ4CL2BTL7/graph.json","fetch_events":"https://pith.science/api/pith-number/5OCL5A5NF7Q2S2CJNJ4CL2BTL7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5OCL5A5NF7Q2S2CJNJ4CL2BTL7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5OCL5A5NF7Q2S2CJNJ4CL2BTL7/action/storage_attestation","attest_author":"https://pith.science/pith/5OCL5A5NF7Q2S2CJNJ4CL2BTL7/action/author_attestation","sign_citation":"https://pith.science/pith/5OCL5A5NF7Q2S2CJNJ4CL2BTL7/action/citation_signature","submit_replication":"https://pith.science/pith/5OCL5A5NF7Q2S2CJNJ4CL2BTL7/action/replication_record"}},"created_at":"2026-07-05T09:57:02.721827+00:00","updated_at":"2026-07-05T09:57:02.721827+00:00"}