{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:E2W53QG47S44IVUA3YA7SVJC2G","short_pith_number":"pith:E2W53QG4","schema_version":"1.0","canonical_sha256":"26adddc0dcfcb9c45680de01f95522d197f48dd9b99990a0d6362cb3036c3e94","source":{"kind":"arxiv","id":"1707.00477","version":2},"attestation_state":"computed","paper":{"title":"Efficient Generation of One-Factorizations through Hill Climbing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Maya Dotan, Nati Linial","submitted_at":"2017-07-03T10:47:14Z","abstract_excerpt":"It is well known that for every even integer $n$, the complete graph $K_{n}$ has a one-factorization, namely a proper edge coloring with $n-1$ colors. Unfortunately, not much is known about the possible structure of large one-factorizations. Also, at present we have only woefully few explicit constructions of one-factorizations. Specifically, we know essentially nothing about the {\\em typical} properties of one-factorizations for large $n$.\n  Suppose that $\\cal C_{\\rm n}$ is a graph whose vertex set includes the set of all order-$n$ one-factorizations and that $\\Psi: V(\\cal C_{\\rm n})\\to \\math"},"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":"1707.00477","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-07-03T10:47:14Z","cross_cats_sorted":[],"title_canon_sha256":"4e09e9ed99baaf9d8a40bb9e391ec22599feaa22e865a61565f5c56ffa383544","abstract_canon_sha256":"210c364f28ef042d9aa6d63f876d97795f0e6b3e5e199f5650712f42ad027841"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:34:15.036949Z","signature_b64":"y+mkX26i+TwY6EThWJB3R5/8UCcq5wsUlrj0qJdRlSQ6+ObgCaO0+I7bNYP0bsCaTQb2H0aa7xLWXjbNuLPaDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"26adddc0dcfcb9c45680de01f95522d197f48dd9b99990a0d6362cb3036c3e94","last_reissued_at":"2026-05-18T00:34:15.036271Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:34:15.036271Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Efficient Generation of One-Factorizations through Hill Climbing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Maya Dotan, Nati Linial","submitted_at":"2017-07-03T10:47:14Z","abstract_excerpt":"It is well known that for every even integer $n$, the complete graph $K_{n}$ has a one-factorization, namely a proper edge coloring with $n-1$ colors. Unfortunately, not much is known about the possible structure of large one-factorizations. Also, at present we have only woefully few explicit constructions of one-factorizations. Specifically, we know essentially nothing about the {\\em typical} properties of one-factorizations for large $n$.\n  Suppose that $\\cal C_{\\rm n}$ is a graph whose vertex set includes the set of all order-$n$ one-factorizations and that $\\Psi: V(\\cal C_{\\rm n})\\to \\math"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.00477","kind":"arxiv","version":2},"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":"1707.00477","created_at":"2026-05-18T00:34:15.036384+00:00"},{"alias_kind":"arxiv_version","alias_value":"1707.00477v2","created_at":"2026-05-18T00:34:15.036384+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.00477","created_at":"2026-05-18T00:34:15.036384+00:00"},{"alias_kind":"pith_short_12","alias_value":"E2W53QG47S44","created_at":"2026-05-18T12:31:12.930513+00:00"},{"alias_kind":"pith_short_16","alias_value":"E2W53QG47S44IVUA","created_at":"2026-05-18T12:31:12.930513+00:00"},{"alias_kind":"pith_short_8","alias_value":"E2W53QG4","created_at":"2026-05-18T12:31:12.930513+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/E2W53QG47S44IVUA3YA7SVJC2G","json":"https://pith.science/pith/E2W53QG47S44IVUA3YA7SVJC2G.json","graph_json":"https://pith.science/api/pith-number/E2W53QG47S44IVUA3YA7SVJC2G/graph.json","events_json":"https://pith.science/api/pith-number/E2W53QG47S44IVUA3YA7SVJC2G/events.json","paper":"https://pith.science/paper/E2W53QG4"},"agent_actions":{"view_html":"https://pith.science/pith/E2W53QG47S44IVUA3YA7SVJC2G","download_json":"https://pith.science/pith/E2W53QG47S44IVUA3YA7SVJC2G.json","view_paper":"https://pith.science/paper/E2W53QG4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1707.00477&json=true","fetch_graph":"https://pith.science/api/pith-number/E2W53QG47S44IVUA3YA7SVJC2G/graph.json","fetch_events":"https://pith.science/api/pith-number/E2W53QG47S44IVUA3YA7SVJC2G/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/E2W53QG47S44IVUA3YA7SVJC2G/action/timestamp_anchor","attest_storage":"https://pith.science/pith/E2W53QG47S44IVUA3YA7SVJC2G/action/storage_attestation","attest_author":"https://pith.science/pith/E2W53QG47S44IVUA3YA7SVJC2G/action/author_attestation","sign_citation":"https://pith.science/pith/E2W53QG47S44IVUA3YA7SVJC2G/action/citation_signature","submit_replication":"https://pith.science/pith/E2W53QG47S44IVUA3YA7SVJC2G/action/replication_record"}},"created_at":"2026-05-18T00:34:15.036384+00:00","updated_at":"2026-05-18T00:34:15.036384+00:00"}