{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:YHCUVTAMARJTMXAPK2NPIGDLRC","short_pith_number":"pith:YHCUVTAM","schema_version":"1.0","canonical_sha256":"c1c54acc0c0453365c0f569af4186b88b3e04d232aa28d85faae936facf6505e","source":{"kind":"arxiv","id":"1202.5721","version":1},"attestation_state":"computed","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."},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1202.5721","created_at":"2026-05-18T04:01:24.877493+00:00"},{"alias_kind":"arxiv_version","alias_value":"1202.5721v1","created_at":"2026-05-18T04:01:24.877493+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1202.5721","created_at":"2026-05-18T04:01:24.877493+00:00"},{"alias_kind":"pith_short_12","alias_value":"YHCUVTAMARJT","created_at":"2026-05-18T12:27:27.928770+00:00"},{"alias_kind":"pith_short_16","alias_value":"YHCUVTAMARJTMXAP","created_at":"2026-05-18T12:27:27.928770+00:00"},{"alias_kind":"pith_short_8","alias_value":"YHCUVTAM","created_at":"2026-05-18T12:27:27.928770+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/YHCUVTAMARJTMXAPK2NPIGDLRC","json":"https://pith.science/pith/YHCUVTAMARJTMXAPK2NPIGDLRC.json","graph_json":"https://pith.science/api/pith-number/YHCUVTAMARJTMXAPK2NPIGDLRC/graph.json","events_json":"https://pith.science/api/pith-number/YHCUVTAMARJTMXAPK2NPIGDLRC/events.json","paper":"https://pith.science/paper/YHCUVTAM"},"agent_actions":{"view_html":"https://pith.science/pith/YHCUVTAMARJTMXAPK2NPIGDLRC","download_json":"https://pith.science/pith/YHCUVTAMARJTMXAPK2NPIGDLRC.json","view_paper":"https://pith.science/paper/YHCUVTAM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1202.5721&json=true","fetch_graph":"https://pith.science/api/pith-number/YHCUVTAMARJTMXAPK2NPIGDLRC/graph.json","fetch_events":"https://pith.science/api/pith-number/YHCUVTAMARJTMXAPK2NPIGDLRC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YHCUVTAMARJTMXAPK2NPIGDLRC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YHCUVTAMARJTMXAPK2NPIGDLRC/action/storage_attestation","attest_author":"https://pith.science/pith/YHCUVTAMARJTMXAPK2NPIGDLRC/action/author_attestation","sign_citation":"https://pith.science/pith/YHCUVTAMARJTMXAPK2NPIGDLRC/action/citation_signature","submit_replication":"https://pith.science/pith/YHCUVTAMARJTMXAPK2NPIGDLRC/action/replication_record"}},"created_at":"2026-05-18T04:01:24.877493+00:00","updated_at":"2026-05-18T04:01:24.877493+00:00"}