{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:3ZHW7KZZ3JMTGZHZP3EANNVCHD","short_pith_number":"pith:3ZHW7KZZ","schema_version":"1.0","canonical_sha256":"de4f6fab39da593364f97ec806b6a238df45ac370db85f3556cfcc8c6a16428d","source":{"kind":"arxiv","id":"1205.0128","version":1},"attestation_state":"computed","paper":{"title":"It was not known about simple cycles","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"R.R. Kamalian","submitted_at":"2012-05-01T10:38:18Z","abstract_excerpt":"A proper edge $t$-coloring of a graph is a coloring of its edges with colors $1,2,...,t$ such that all colors are used, and no two adjacent edges receive the same color. For any integer $n\\geq 3$, all possible values of $t$ are found, for which there exists such a proper edge $t$-coloring of the simple cycle C(n), which uses for each pair of adjacent edges either consecutive colors or the first and the last ones."},"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":"1205.0128","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2012-05-01T10:38:18Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"154259ea96ae0e0873e28f62b3662fd58c311c95b325a4566565522a6f0bfe28","abstract_canon_sha256":"1c6932f94655a0922629f68082b4165edde144cf9ebfbd3fac72818bb66067ab"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:56:35.808576Z","signature_b64":"uqlGsct4C91KrlhmYZzPH8r3TBfY8x8ZxrnoMqwaaWLKQhcFy7bvg+uJbhZyfwgzWzOzTd787LlEurDo1vy1CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"de4f6fab39da593364f97ec806b6a238df45ac370db85f3556cfcc8c6a16428d","last_reissued_at":"2026-05-18T03:56:35.808068Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:56:35.808068Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"It was not known about simple cycles","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"R.R. Kamalian","submitted_at":"2012-05-01T10:38:18Z","abstract_excerpt":"A proper edge $t$-coloring of a graph is a coloring of its edges with colors $1,2,...,t$ such that all colors are used, and no two adjacent edges receive the same color. For any integer $n\\geq 3$, all possible values of $t$ are found, for which there exists such a proper edge $t$-coloring of the simple cycle C(n), which uses for each pair of adjacent edges either consecutive colors or the first and the last ones."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1205.0128","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":"1205.0128","created_at":"2026-05-18T03:56:35.808143+00:00"},{"alias_kind":"arxiv_version","alias_value":"1205.0128v1","created_at":"2026-05-18T03:56:35.808143+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1205.0128","created_at":"2026-05-18T03:56:35.808143+00:00"},{"alias_kind":"pith_short_12","alias_value":"3ZHW7KZZ3JMT","created_at":"2026-05-18T12:26:53.410803+00:00"},{"alias_kind":"pith_short_16","alias_value":"3ZHW7KZZ3JMTGZHZ","created_at":"2026-05-18T12:26:53.410803+00:00"},{"alias_kind":"pith_short_8","alias_value":"3ZHW7KZZ","created_at":"2026-05-18T12:26:53.410803+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/3ZHW7KZZ3JMTGZHZP3EANNVCHD","json":"https://pith.science/pith/3ZHW7KZZ3JMTGZHZP3EANNVCHD.json","graph_json":"https://pith.science/api/pith-number/3ZHW7KZZ3JMTGZHZP3EANNVCHD/graph.json","events_json":"https://pith.science/api/pith-number/3ZHW7KZZ3JMTGZHZP3EANNVCHD/events.json","paper":"https://pith.science/paper/3ZHW7KZZ"},"agent_actions":{"view_html":"https://pith.science/pith/3ZHW7KZZ3JMTGZHZP3EANNVCHD","download_json":"https://pith.science/pith/3ZHW7KZZ3JMTGZHZP3EANNVCHD.json","view_paper":"https://pith.science/paper/3ZHW7KZZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1205.0128&json=true","fetch_graph":"https://pith.science/api/pith-number/3ZHW7KZZ3JMTGZHZP3EANNVCHD/graph.json","fetch_events":"https://pith.science/api/pith-number/3ZHW7KZZ3JMTGZHZP3EANNVCHD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3ZHW7KZZ3JMTGZHZP3EANNVCHD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3ZHW7KZZ3JMTGZHZP3EANNVCHD/action/storage_attestation","attest_author":"https://pith.science/pith/3ZHW7KZZ3JMTGZHZP3EANNVCHD/action/author_attestation","sign_citation":"https://pith.science/pith/3ZHW7KZZ3JMTGZHZP3EANNVCHD/action/citation_signature","submit_replication":"https://pith.science/pith/3ZHW7KZZ3JMTGZHZP3EANNVCHD/action/replication_record"}},"created_at":"2026-05-18T03:56:35.808143+00:00","updated_at":"2026-05-18T03:56:35.808143+00:00"}