{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:WMH6CRNYM5DEHQK7FOSDHMX2KM","short_pith_number":"pith:WMH6CRNY","canonical_record":{"source":{"id":"1410.8154","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2014-10-29T20:31:33Z","cross_cats_sorted":[],"title_canon_sha256":"a1816b303d1b845cfc927a7106c3ccd0fc1d52db3838c4a6f71e278e61b6a450","abstract_canon_sha256":"80e744dfba4cf622f18a20b0ef50477bf979aee86999b018f80ae133d022a727"},"schema_version":"1.0"},"canonical_sha256":"b30fe145b8674643c15f2ba433b2fa531d91f9c63ba5c7ebf616b822d394ee7b","source":{"kind":"arxiv","id":"1410.8154","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1410.8154","created_at":"2026-05-18T02:39:00Z"},{"alias_kind":"arxiv_version","alias_value":"1410.8154v1","created_at":"2026-05-18T02:39:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.8154","created_at":"2026-05-18T02:39:00Z"},{"alias_kind":"pith_short_12","alias_value":"WMH6CRNYM5DE","created_at":"2026-05-18T12:28:54Z"},{"alias_kind":"pith_short_16","alias_value":"WMH6CRNYM5DEHQK7","created_at":"2026-05-18T12:28:54Z"},{"alias_kind":"pith_short_8","alias_value":"WMH6CRNY","created_at":"2026-05-18T12:28:54Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:WMH6CRNYM5DEHQK7FOSDHMX2KM","target":"record","payload":{"canonical_record":{"source":{"id":"1410.8154","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2014-10-29T20:31:33Z","cross_cats_sorted":[],"title_canon_sha256":"a1816b303d1b845cfc927a7106c3ccd0fc1d52db3838c4a6f71e278e61b6a450","abstract_canon_sha256":"80e744dfba4cf622f18a20b0ef50477bf979aee86999b018f80ae133d022a727"},"schema_version":"1.0"},"canonical_sha256":"b30fe145b8674643c15f2ba433b2fa531d91f9c63ba5c7ebf616b822d394ee7b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:39:00.520103Z","signature_b64":"/ReCFYRxheXmOnRuUeGzoc++qO1QxTiNZ9DUzjPfor3Kjw6+/jGVdPJDua8y2yXQ6dcTZXqc1bZB3purxYeeCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b30fe145b8674643c15f2ba433b2fa531d91f9c63ba5c7ebf616b822d394ee7b","last_reissued_at":"2026-05-18T02:39:00.519668Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:39:00.519668Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1410.8154","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-05-18T02:39:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WE8gsPTywgrnvcciPXISyLdGW6JFGCXG44nZh45a8ahbDhumJU59XlY4hx+igZ/x4SbNtJ+Bfl//c37MdH7GAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T08:30:54.921406Z"},"content_sha256":"1ea42e0094b64b7d7dee542b78dc30b64ba6ca4ae95a2a0e5614c349459c5365","schema_version":"1.0","event_id":"sha256:1ea42e0094b64b7d7dee542b78dc30b64ba6ca4ae95a2a0e5614c349459c5365"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:WMH6CRNYM5DEHQK7FOSDHMX2KM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On finding orientations with fewest number of vartices with small out-degree","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Kaveh Khoshkhah","submitted_at":"2014-10-29T20:31:33Z","abstract_excerpt":"Given an undirected graph, each of the two end-vertices of an edge can own the edge. Call a vertex poor, if it owns at most one edge. We give a polynomial time algorithm for the problem of finding an assignment of owners to the edges which minimizes the number of poor vertices. In the terminology of graph orientation, this means finding an orientation for the edges of a graph minimizing the number of edges with out-degree at most 1, and answers a question of Asahiro Jansson, Miyano, Ono (2014)."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.8154","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":""},"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-18T02:39:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yZuPgoIAw+I5jpCvEhU5c3w9xktTyIR/RP64sykfOb4nS1jAMUSqkX47D1JD7HYvHLU/VI16sQObrLcrj7ivDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T08:30:54.921765Z"},"content_sha256":"5b00f9fafa18294ec199d173e66fc4cc4a172d2aa9034340b6aeb466e678ebbb","schema_version":"1.0","event_id":"sha256:5b00f9fafa18294ec199d173e66fc4cc4a172d2aa9034340b6aeb466e678ebbb"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WMH6CRNYM5DEHQK7FOSDHMX2KM/bundle.json","state_url":"https://pith.science/pith/WMH6CRNYM5DEHQK7FOSDHMX2KM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WMH6CRNYM5DEHQK7FOSDHMX2KM/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-06-04T08:30:54Z","links":{"resolver":"https://pith.science/pith/WMH6CRNYM5DEHQK7FOSDHMX2KM","bundle":"https://pith.science/pith/WMH6CRNYM5DEHQK7FOSDHMX2KM/bundle.json","state":"https://pith.science/pith/WMH6CRNYM5DEHQK7FOSDHMX2KM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WMH6CRNYM5DEHQK7FOSDHMX2KM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:WMH6CRNYM5DEHQK7FOSDHMX2KM","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":"80e744dfba4cf622f18a20b0ef50477bf979aee86999b018f80ae133d022a727","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2014-10-29T20:31:33Z","title_canon_sha256":"a1816b303d1b845cfc927a7106c3ccd0fc1d52db3838c4a6f71e278e61b6a450"},"schema_version":"1.0","source":{"id":"1410.8154","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1410.8154","created_at":"2026-05-18T02:39:00Z"},{"alias_kind":"arxiv_version","alias_value":"1410.8154v1","created_at":"2026-05-18T02:39:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.8154","created_at":"2026-05-18T02:39:00Z"},{"alias_kind":"pith_short_12","alias_value":"WMH6CRNYM5DE","created_at":"2026-05-18T12:28:54Z"},{"alias_kind":"pith_short_16","alias_value":"WMH6CRNYM5DEHQK7","created_at":"2026-05-18T12:28:54Z"},{"alias_kind":"pith_short_8","alias_value":"WMH6CRNY","created_at":"2026-05-18T12:28:54Z"}],"graph_snapshots":[{"event_id":"sha256:5b00f9fafa18294ec199d173e66fc4cc4a172d2aa9034340b6aeb466e678ebbb","target":"graph","created_at":"2026-05-18T02:39: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, each of the two end-vertices of an edge can own the edge. Call a vertex poor, if it owns at most one edge. We give a polynomial time algorithm for the problem of finding an assignment of owners to the edges which minimizes the number of poor vertices. In the terminology of graph orientation, this means finding an orientation for the edges of a graph minimizing the number of edges with out-degree at most 1, and answers a question of Asahiro Jansson, Miyano, Ono (2014).","authors_text":"Kaveh Khoshkhah","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2014-10-29T20:31:33Z","title":"On finding orientations with fewest number of vartices with small out-degree"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.8154","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:1ea42e0094b64b7d7dee542b78dc30b64ba6ca4ae95a2a0e5614c349459c5365","target":"record","created_at":"2026-05-18T02:39: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":"80e744dfba4cf622f18a20b0ef50477bf979aee86999b018f80ae133d022a727","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2014-10-29T20:31:33Z","title_canon_sha256":"a1816b303d1b845cfc927a7106c3ccd0fc1d52db3838c4a6f71e278e61b6a450"},"schema_version":"1.0","source":{"id":"1410.8154","kind":"arxiv","version":1}},"canonical_sha256":"b30fe145b8674643c15f2ba433b2fa531d91f9c63ba5c7ebf616b822d394ee7b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b30fe145b8674643c15f2ba433b2fa531d91f9c63ba5c7ebf616b822d394ee7b","first_computed_at":"2026-05-18T02:39:00.519668Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:39:00.519668Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"/ReCFYRxheXmOnRuUeGzoc++qO1QxTiNZ9DUzjPfor3Kjw6+/jGVdPJDua8y2yXQ6dcTZXqc1bZB3purxYeeCw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:39:00.520103Z","signed_message":"canonical_sha256_bytes"},"source_id":"1410.8154","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1ea42e0094b64b7d7dee542b78dc30b64ba6ca4ae95a2a0e5614c349459c5365","sha256:5b00f9fafa18294ec199d173e66fc4cc4a172d2aa9034340b6aeb466e678ebbb"],"state_sha256":"277afc1278340bc31f49cda9ae2dce19c88c5403a7feba352d3a165aa173e229"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JJvKiDL/z57rfXzzM4UOsxpBrp19eEc6UsxSCgqYS+LnbPladpzQlWCcemczcYSEi7lewNoTg4llAnziwzrKBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T08:30:54.923740Z","bundle_sha256":"fa7f033b85f9c4faf1f81e53f5fa83e4ff009e2e8fd9c8d06bdf207373a7fdde"}}