{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:KZRUTOMIQ7QUQZVJNH3EQZ6RXG","short_pith_number":"pith:KZRUTOMI","canonical_record":{"source":{"id":"1212.2178","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2012-12-10T19:44:11Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"9d7173f1c0bce9743b249ed57f0f2255b8852c53610f2fab364d001b201cd333","abstract_canon_sha256":"3c72367a4288743b62cb5d537c6041bbc1166a76e3e64664b3a2ab3cd85f4914"},"schema_version":"1.0"},"canonical_sha256":"566349b98887e14866a969f64867d1b9b756b4db0ecec6aeed4fa9643ffa9a5c","source":{"kind":"arxiv","id":"1212.2178","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1212.2178","created_at":"2026-05-18T00:31:00Z"},{"alias_kind":"arxiv_version","alias_value":"1212.2178v4","created_at":"2026-05-18T00:31:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1212.2178","created_at":"2026-05-18T00:31:00Z"},{"alias_kind":"pith_short_12","alias_value":"KZRUTOMIQ7QU","created_at":"2026-05-18T12:27:11Z"},{"alias_kind":"pith_short_16","alias_value":"KZRUTOMIQ7QUQZVJ","created_at":"2026-05-18T12:27:11Z"},{"alias_kind":"pith_short_8","alias_value":"KZRUTOMI","created_at":"2026-05-18T12:27:11Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:KZRUTOMIQ7QUQZVJNH3EQZ6RXG","target":"record","payload":{"canonical_record":{"source":{"id":"1212.2178","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2012-12-10T19:44:11Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"9d7173f1c0bce9743b249ed57f0f2255b8852c53610f2fab364d001b201cd333","abstract_canon_sha256":"3c72367a4288743b62cb5d537c6041bbc1166a76e3e64664b3a2ab3cd85f4914"},"schema_version":"1.0"},"canonical_sha256":"566349b98887e14866a969f64867d1b9b756b4db0ecec6aeed4fa9643ffa9a5c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:31:00.782258Z","signature_b64":"bys8PW62r7gFTNLc0GF1WHWjFwmK4YvY5IgN2i6B+8Euk4O7375eMP3369XYvAqaunNxUCF02DFLS+0H91SQBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"566349b98887e14866a969f64867d1b9b756b4db0ecec6aeed4fa9643ffa9a5c","last_reissued_at":"2026-05-18T00:31:00.781618Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:31:00.781618Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1212.2178","source_version":4,"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-05-18T00:31:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MpCP3RK8dvO9snHpO2wbZ44qaO2HOllWbw7tBUJRShg5Sh40qPijyae/CwQuoqNQpFu4Fs/Woc8y/pE9n8IUCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T08:51:17.669895Z"},"content_sha256":"c61cd2c90fd8c8d8add44290e4e9ab6c7acab6caf41bc43ca406e278b4ae767d","schema_version":"1.0","event_id":"sha256:c61cd2c90fd8c8d8add44290e4e9ab6c7acab6caf41bc43ca406e278b4ae767d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:KZRUTOMIQ7QUQZVJNH3EQZ6RXG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Egalitarian Graph Orientations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Antonio Ochoa, Glencora Borradaile, Gordon Wilfong, Jennifer Iglesias, Lisa Zhang, Theresa Migler","submitted_at":"2012-12-10T19:44:11Z","abstract_excerpt":"Given an undirected graph, one can assign directions to each of the edges of the graph, thus orienting the graph. To be as egalitarian as possible, one may wish to find an orientation such that no vertex is unfairly hit with too many arcs directed into it. We discuss how this objective arises in problems resulting from telecommunications. We give optimal, polynomial-time algorithms for: finding an orientation that minimizes the lexicographic order of the indegrees and finding a strongly-connected orientation that minimizes the maximum indegree. We show that minimizing the lexicographic order o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1212.2178","kind":"arxiv","version":4},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"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-05-18T00:31:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9vV+llaJur66G3IwB8YLKfKm+EvPfV/CXMqRi+KHKQ2DHSM+B5Bmd6WPRr5enXRhaRSastpa9eBHpjYpJYR5BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T08:51:17.670480Z"},"content_sha256":"ad4e9da658381c80ae8b5adfbf998475b242a28c7019b2512ba1cc7cf47c9d24","schema_version":"1.0","event_id":"sha256:ad4e9da658381c80ae8b5adfbf998475b242a28c7019b2512ba1cc7cf47c9d24"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KZRUTOMIQ7QUQZVJNH3EQZ6RXG/bundle.json","state_url":"https://pith.science/pith/KZRUTOMIQ7QUQZVJNH3EQZ6RXG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KZRUTOMIQ7QUQZVJNH3EQZ6RXG/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-05-28T08:51:17Z","links":{"resolver":"https://pith.science/pith/KZRUTOMIQ7QUQZVJNH3EQZ6RXG","bundle":"https://pith.science/pith/KZRUTOMIQ7QUQZVJNH3EQZ6RXG/bundle.json","state":"https://pith.science/pith/KZRUTOMIQ7QUQZVJNH3EQZ6RXG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KZRUTOMIQ7QUQZVJNH3EQZ6RXG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:KZRUTOMIQ7QUQZVJNH3EQZ6RXG","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":"3c72367a4288743b62cb5d537c6041bbc1166a76e3e64664b3a2ab3cd85f4914","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2012-12-10T19:44:11Z","title_canon_sha256":"9d7173f1c0bce9743b249ed57f0f2255b8852c53610f2fab364d001b201cd333"},"schema_version":"1.0","source":{"id":"1212.2178","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1212.2178","created_at":"2026-05-18T00:31:00Z"},{"alias_kind":"arxiv_version","alias_value":"1212.2178v4","created_at":"2026-05-18T00:31:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1212.2178","created_at":"2026-05-18T00:31:00Z"},{"alias_kind":"pith_short_12","alias_value":"KZRUTOMIQ7QU","created_at":"2026-05-18T12:27:11Z"},{"alias_kind":"pith_short_16","alias_value":"KZRUTOMIQ7QUQZVJ","created_at":"2026-05-18T12:27:11Z"},{"alias_kind":"pith_short_8","alias_value":"KZRUTOMI","created_at":"2026-05-18T12:27:11Z"}],"graph_snapshots":[{"event_id":"sha256:ad4e9da658381c80ae8b5adfbf998475b242a28c7019b2512ba1cc7cf47c9d24","target":"graph","created_at":"2026-05-18T00:31:00Z","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"},"paper":{"abstract_excerpt":"Given an undirected graph, one can assign directions to each of the edges of the graph, thus orienting the graph. To be as egalitarian as possible, one may wish to find an orientation such that no vertex is unfairly hit with too many arcs directed into it. We discuss how this objective arises in problems resulting from telecommunications. We give optimal, polynomial-time algorithms for: finding an orientation that minimizes the lexicographic order of the indegrees and finding a strongly-connected orientation that minimizes the maximum indegree. We show that minimizing the lexicographic order o","authors_text":"Antonio Ochoa, Glencora Borradaile, Gordon Wilfong, Jennifer Iglesias, Lisa Zhang, Theresa Migler","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2012-12-10T19:44:11Z","title":"Egalitarian Graph Orientations"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1212.2178","kind":"arxiv","version":4},"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:c61cd2c90fd8c8d8add44290e4e9ab6c7acab6caf41bc43ca406e278b4ae767d","target":"record","created_at":"2026-05-18T00:31:00Z","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":"3c72367a4288743b62cb5d537c6041bbc1166a76e3e64664b3a2ab3cd85f4914","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2012-12-10T19:44:11Z","title_canon_sha256":"9d7173f1c0bce9743b249ed57f0f2255b8852c53610f2fab364d001b201cd333"},"schema_version":"1.0","source":{"id":"1212.2178","kind":"arxiv","version":4}},"canonical_sha256":"566349b98887e14866a969f64867d1b9b756b4db0ecec6aeed4fa9643ffa9a5c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"566349b98887e14866a969f64867d1b9b756b4db0ecec6aeed4fa9643ffa9a5c","first_computed_at":"2026-05-18T00:31:00.781618Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:31:00.781618Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"bys8PW62r7gFTNLc0GF1WHWjFwmK4YvY5IgN2i6B+8Euk4O7375eMP3369XYvAqaunNxUCF02DFLS+0H91SQBw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:31:00.782258Z","signed_message":"canonical_sha256_bytes"},"source_id":"1212.2178","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c61cd2c90fd8c8d8add44290e4e9ab6c7acab6caf41bc43ca406e278b4ae767d","sha256:ad4e9da658381c80ae8b5adfbf998475b242a28c7019b2512ba1cc7cf47c9d24"],"state_sha256":"85acd01eb69ac1140e751253d18d691111fc2a0e91c8ad5bc49d1837f5a038fe"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6GSWZoxikvkTBdGjoi549n05+ZCbGV8FY30fDbTKPNpI80P9e7inGDt0eAsJlg0LqWALxYfhcukI6RWr2zLjBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T08:51:17.673355Z","bundle_sha256":"02c917a7717b2c9526817dd812a231aee3b6c8cbf16eb6aa1ef00d771fc1099c"}}