{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:5OCL5A5NF7Q2S2CJNJ4CL2BTL7","short_pith_number":"pith:5OCL5A5N","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"},"canonical_sha256":"eb84be83ad2fe1a968496a7825e8335fd44e5c88e2c2d4dfebc8e1cceb4fe5ed","source":{"kind":"arxiv","id":"2501.02136","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2501.02136","created_at":"2026-07-05T09:57:02Z"},{"alias_kind":"arxiv_version","alias_value":"2501.02136v1","created_at":"2026-07-05T09:57:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2501.02136","created_at":"2026-07-05T09:57:02Z"},{"alias_kind":"pith_short_12","alias_value":"5OCL5A5NF7Q2","created_at":"2026-07-05T09:57:02Z"},{"alias_kind":"pith_short_16","alias_value":"5OCL5A5NF7Q2S2CJ","created_at":"2026-07-05T09:57:02Z"},{"alias_kind":"pith_short_8","alias_value":"5OCL5A5N","created_at":"2026-07-05T09:57:02Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:5OCL5A5NF7Q2S2CJNJ4CL2BTL7","target":"record","payload":{"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"},"canonical_sha256":"eb84be83ad2fe1a968496a7825e8335fd44e5c88e2c2d4dfebc8e1cceb4fe5ed","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"},"source_kind":"arxiv","source_id":"2501.02136","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T09:57:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IB8YRO9R1rFDCa9mEnvAy3hnyE06aiD2Fak7EC/m6cNdJoIBzm0J2C34e1uO9M3DTC8kmyDndvmFNvqUVvy2Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-12T05:52:20.311536Z"},"content_sha256":"0aaf5253efdb0e012ac33725ea55756929ce773363993e1178c6c250b747f04d","schema_version":"1.0","event_id":"sha256:0aaf5253efdb0e012ac33725ea55756929ce773363993e1178c6c250b747f04d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:5OCL5A5NF7Q2S2CJNJ4CL2BTL7","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T09:57:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aaBfwpb//9WypHN5LXe5Nj+jAfb/uW0Sp9shDDpw8M5BPdfZvbFdIzAtSImNf/6ZCxwyPpVLrIH3yPRwmS2VBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-12T05:52:20.312425Z"},"content_sha256":"e058511db441a4993621bc238b790bd8b0998d7388516f9454f66bbcbbef9af3","schema_version":"1.0","event_id":"sha256:e058511db441a4993621bc238b790bd8b0998d7388516f9454f66bbcbbef9af3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5OCL5A5NF7Q2S2CJNJ4CL2BTL7/bundle.json","state_url":"https://pith.science/pith/5OCL5A5NF7Q2S2CJNJ4CL2BTL7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5OCL5A5NF7Q2S2CJNJ4CL2BTL7/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-12T05:52:20Z","links":{"resolver":"https://pith.science/pith/5OCL5A5NF7Q2S2CJNJ4CL2BTL7","bundle":"https://pith.science/pith/5OCL5A5NF7Q2S2CJNJ4CL2BTL7/bundle.json","state":"https://pith.science/pith/5OCL5A5NF7Q2S2CJNJ4CL2BTL7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5OCL5A5NF7Q2S2CJNJ4CL2BTL7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:5OCL5A5NF7Q2S2CJNJ4CL2BTL7","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"bad58f1b34af0873f24d636f59a2aacc9a17ef20a294b3c41c1dfc0354586e23","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2025-01-03T23:03:29Z","title_canon_sha256":"67cc7753c33b8ef172af438e54c8c04770400e7affbac549cdd961617ae67826"},"schema_version":"1.0","source":{"id":"2501.02136","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2501.02136","created_at":"2026-07-05T09:57:02Z"},{"alias_kind":"arxiv_version","alias_value":"2501.02136v1","created_at":"2026-07-05T09:57:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2501.02136","created_at":"2026-07-05T09:57:02Z"},{"alias_kind":"pith_short_12","alias_value":"5OCL5A5NF7Q2","created_at":"2026-07-05T09:57:02Z"},{"alias_kind":"pith_short_16","alias_value":"5OCL5A5NF7Q2S2CJ","created_at":"2026-07-05T09:57:02Z"},{"alias_kind":"pith_short_8","alias_value":"5OCL5A5N","created_at":"2026-07-05T09:57:02Z"}],"graph_snapshots":[{"event_id":"sha256:e058511db441a4993621bc238b790bd8b0998d7388516f9454f66bbcbbef9af3","target":"graph","created_at":"2026-07-05T09:57:02Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2501.02136/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Mihir Singhal, Ronitt Rubinfeld, Slobodan Mitrovi\\'c","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2025-01-03T23:03:29Z","title":"Locally computing edge orientations"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2501.02136","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:0aaf5253efdb0e012ac33725ea55756929ce773363993e1178c6c250b747f04d","target":"record","created_at":"2026-07-05T09:57:02Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"bad58f1b34af0873f24d636f59a2aacc9a17ef20a294b3c41c1dfc0354586e23","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2025-01-03T23:03:29Z","title_canon_sha256":"67cc7753c33b8ef172af438e54c8c04770400e7affbac549cdd961617ae67826"},"schema_version":"1.0","source":{"id":"2501.02136","kind":"arxiv","version":1}},"canonical_sha256":"eb84be83ad2fe1a968496a7825e8335fd44e5c88e2c2d4dfebc8e1cceb4fe5ed","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"eb84be83ad2fe1a968496a7825e8335fd44e5c88e2c2d4dfebc8e1cceb4fe5ed","first_computed_at":"2026-07-05T09:57:02.721775Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:57:02.721775Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ERtnnTeE6aTBX/S1bWRB+qdaaCPdkfr/j43x1DUIh0G/9P+W+9iX5G1WYLXSMJDM8MIDzBNrm8CdHC3H2VtsCw==","signature_status":"signed_v1","signed_at":"2026-07-05T09:57:02.722221Z","signed_message":"canonical_sha256_bytes"},"source_id":"2501.02136","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0aaf5253efdb0e012ac33725ea55756929ce773363993e1178c6c250b747f04d","sha256:e058511db441a4993621bc238b790bd8b0998d7388516f9454f66bbcbbef9af3"],"state_sha256":"482597c9322ac6f67ff08512aa63c8c42b4bf998344e65c7c2b9ab37e645bce0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RGyfd3KczDCZeIN3uYRMsSEz1cih0vDeqH0RknNV38dLYx9TG+6ubT19e5ms/EMeGw2V8aH1wixDJcT1soA9Cg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-12T05:52:20.323608Z","bundle_sha256":"6f76bc948223175979dd997fa0978c78280814164a3f4f54aa62cda650e8ddba"}}