{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:YHCUVTAMARJTMXAPK2NPIGDLRC","short_pith_number":"pith:YHCUVTAM","canonical_record":{"source":{"id":"1202.5721","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-02-26T03:23:38Z","cross_cats_sorted":[],"title_canon_sha256":"c5eeba8bee70c25bebe461610780dfcc607454c042b3a87d529d9d15c582b359","abstract_canon_sha256":"ec6f04622ea38ea2ab205e90e94050179e5319d553cbe35cb98df891fa925d82"},"schema_version":"1.0"},"canonical_sha256":"c1c54acc0c0453365c0f569af4186b88b3e04d232aa28d85faae936facf6505e","source":{"kind":"arxiv","id":"1202.5721","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1202.5721","created_at":"2026-05-18T04:01:24Z"},{"alias_kind":"arxiv_version","alias_value":"1202.5721v1","created_at":"2026-05-18T04:01:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1202.5721","created_at":"2026-05-18T04:01:24Z"},{"alias_kind":"pith_short_12","alias_value":"YHCUVTAMARJT","created_at":"2026-05-18T12:27:27Z"},{"alias_kind":"pith_short_16","alias_value":"YHCUVTAMARJTMXAP","created_at":"2026-05-18T12:27:27Z"},{"alias_kind":"pith_short_8","alias_value":"YHCUVTAM","created_at":"2026-05-18T12:27:27Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:YHCUVTAMARJTMXAPK2NPIGDLRC","target":"record","payload":{"canonical_record":{"source":{"id":"1202.5721","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-02-26T03:23:38Z","cross_cats_sorted":[],"title_canon_sha256":"c5eeba8bee70c25bebe461610780dfcc607454c042b3a87d529d9d15c582b359","abstract_canon_sha256":"ec6f04622ea38ea2ab205e90e94050179e5319d553cbe35cb98df891fa925d82"},"schema_version":"1.0"},"canonical_sha256":"c1c54acc0c0453365c0f569af4186b88b3e04d232aa28d85faae936facf6505e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:01:24.878098Z","signature_b64":"XWpZA1kCA+5pA4Sa+4awTmOeNWVgA/DgvPmGhuJYXkZXmBUlfKISC4hC3w617kBjSlWznYpyq6sCX8YCQYPVCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c1c54acc0c0453365c0f569af4186b88b3e04d232aa28d85faae936facf6505e","last_reissued_at":"2026-05-18T04:01:24.877379Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:01:24.877379Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1202.5721","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-18T04:01:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pH4/v1U8pq0ZkVAXqp+CDxAFMmFAk4iuVUC+2+Lva3gNyNFdiuHboLLTfYrVczdSuIH02lRulw5cy3B0SlGdCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T15:22:17.583342Z"},"content_sha256":"d79129ba2948d661ea22235f53bcf586753714f8fcf2b8aab357f69cf59b3076","schema_version":"1.0","event_id":"sha256:d79129ba2948d661ea22235f53bcf586753714f8fcf2b8aab357f69cf59b3076"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:YHCUVTAMARJTMXAPK2NPIGDLRC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Full Orientability of the Square of a Cycle","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Fengwei Xu, Ko-Wei Lih, Weifan Wang","submitted_at":"2012-02-26T03:23:38Z","abstract_excerpt":"Let D be an acyclic orientation of a simple graph G. An arc of D is called dependent if its reversal creates a directed cycle. Let d(D) denote the number of dependent arcs in D. Define m and M to be the minimum and the maximum number of d(D) over all acyclic orientations D of G. We call G fully orientable if G has an acyclic orientation with exactly k dependent arcs for every k satisfying m <= k <= M. In this paper, we prove that the square of a cycle C_n of length n is fully orientable except n=6."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1202.5721","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-18T04:01:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"u2WCXsRNs2CceE0R1D39VqrMZFQOI3znuI+CHnyxomjzgRe+CZFKGj9QVugkQ8ibyqV5GA7vGi1APjePxj67AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T15:22:17.584018Z"},"content_sha256":"549990ef96f32efcc1112e5e12efd3d2bc3655299d8939aeadc33d5b7153423e","schema_version":"1.0","event_id":"sha256:549990ef96f32efcc1112e5e12efd3d2bc3655299d8939aeadc33d5b7153423e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YHCUVTAMARJTMXAPK2NPIGDLRC/bundle.json","state_url":"https://pith.science/pith/YHCUVTAMARJTMXAPK2NPIGDLRC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YHCUVTAMARJTMXAPK2NPIGDLRC/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-31T15:22:17Z","links":{"resolver":"https://pith.science/pith/YHCUVTAMARJTMXAPK2NPIGDLRC","bundle":"https://pith.science/pith/YHCUVTAMARJTMXAPK2NPIGDLRC/bundle.json","state":"https://pith.science/pith/YHCUVTAMARJTMXAPK2NPIGDLRC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YHCUVTAMARJTMXAPK2NPIGDLRC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:YHCUVTAMARJTMXAPK2NPIGDLRC","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":"ec6f04622ea38ea2ab205e90e94050179e5319d553cbe35cb98df891fa925d82","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-02-26T03:23:38Z","title_canon_sha256":"c5eeba8bee70c25bebe461610780dfcc607454c042b3a87d529d9d15c582b359"},"schema_version":"1.0","source":{"id":"1202.5721","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1202.5721","created_at":"2026-05-18T04:01:24Z"},{"alias_kind":"arxiv_version","alias_value":"1202.5721v1","created_at":"2026-05-18T04:01:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1202.5721","created_at":"2026-05-18T04:01:24Z"},{"alias_kind":"pith_short_12","alias_value":"YHCUVTAMARJT","created_at":"2026-05-18T12:27:27Z"},{"alias_kind":"pith_short_16","alias_value":"YHCUVTAMARJTMXAP","created_at":"2026-05-18T12:27:27Z"},{"alias_kind":"pith_short_8","alias_value":"YHCUVTAM","created_at":"2026-05-18T12:27:27Z"}],"graph_snapshots":[{"event_id":"sha256:549990ef96f32efcc1112e5e12efd3d2bc3655299d8939aeadc33d5b7153423e","target":"graph","created_at":"2026-05-18T04:01:24Z","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":"Let D be an acyclic orientation of a simple graph G. An arc of D is called dependent if its reversal creates a directed cycle. Let d(D) denote the number of dependent arcs in D. Define m and M to be the minimum and the maximum number of d(D) over all acyclic orientations D of G. We call G fully orientable if G has an acyclic orientation with exactly k dependent arcs for every k satisfying m <= k <= M. In this paper, we prove that the square of a cycle C_n of length n is fully orientable except n=6.","authors_text":"Fengwei Xu, Ko-Wei Lih, Weifan Wang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-02-26T03:23:38Z","title":"Full Orientability of the Square of a Cycle"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1202.5721","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:d79129ba2948d661ea22235f53bcf586753714f8fcf2b8aab357f69cf59b3076","target":"record","created_at":"2026-05-18T04:01:24Z","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":"ec6f04622ea38ea2ab205e90e94050179e5319d553cbe35cb98df891fa925d82","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-02-26T03:23:38Z","title_canon_sha256":"c5eeba8bee70c25bebe461610780dfcc607454c042b3a87d529d9d15c582b359"},"schema_version":"1.0","source":{"id":"1202.5721","kind":"arxiv","version":1}},"canonical_sha256":"c1c54acc0c0453365c0f569af4186b88b3e04d232aa28d85faae936facf6505e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c1c54acc0c0453365c0f569af4186b88b3e04d232aa28d85faae936facf6505e","first_computed_at":"2026-05-18T04:01:24.877379Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:01:24.877379Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"XWpZA1kCA+5pA4Sa+4awTmOeNWVgA/DgvPmGhuJYXkZXmBUlfKISC4hC3w617kBjSlWznYpyq6sCX8YCQYPVCg==","signature_status":"signed_v1","signed_at":"2026-05-18T04:01:24.878098Z","signed_message":"canonical_sha256_bytes"},"source_id":"1202.5721","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d79129ba2948d661ea22235f53bcf586753714f8fcf2b8aab357f69cf59b3076","sha256:549990ef96f32efcc1112e5e12efd3d2bc3655299d8939aeadc33d5b7153423e"],"state_sha256":"92ace674fb34f2725167c2333874a2e66daef8ea8a25ef317683a352fab29d78"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XFiunurQBDxvhuuJkgdi21kohgsCTAqK1l0DlXKPsNZaCXYBl4Yix0R62xyA6UYmfK7/K5YjIklddTe4tAOzBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T15:22:17.589181Z","bundle_sha256":"780714e29f413de135a1e02429459365a9320342d2b045537184bf41fde3b247"}}