{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:C5AX35BSCJB4WYVVXJCURP4Z5Q","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":"f175c273b249899e0e9382a837d8c1b8a26dad23df2208420c35a82755cc464b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-08-15T16:43:42Z","title_canon_sha256":"274be8c7ddea0221724adb45e1d765080238fc078c292dd309f84ce96e7cf097"},"schema_version":"1.0","source":{"id":"1508.03751","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1508.03751","created_at":"2026-05-18T01:35:15Z"},{"alias_kind":"arxiv_version","alias_value":"1508.03751v1","created_at":"2026-05-18T01:35:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1508.03751","created_at":"2026-05-18T01:35:15Z"},{"alias_kind":"pith_short_12","alias_value":"C5AX35BSCJB4","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_16","alias_value":"C5AX35BSCJB4WYVV","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_8","alias_value":"C5AX35BS","created_at":"2026-05-18T12:29:14Z"}],"graph_snapshots":[{"event_id":"sha256:db1f924080b3cea4d893c53768d920fba6e5df6675e4d4ee5eb7290d7258ce7f","target":"graph","created_at":"2026-05-18T01:35:15Z","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 $n\\times n$ array $M$ ($n\\ge 7$), where each cell is colored in one of two colors, we give a necessary and sufficient condition for the existence of a partition of $M$ into $n$ diagonals, each containing at least one cell of each color. As a consequence, it follows that if each color appears in at least $2n-1$ cells, then such a partition exists. The proof uses results on completion of partial Latin squares.","authors_text":"Dani Kotlar, Ran Ziv","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-08-15T16:43:42Z","title":"Decomposition of bi-colored square arrays into balanced diagonals"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1508.03751","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:7767ee78d664a4dcf702abe34a6847764be04a56347e746447102536b2b4ea39","target":"record","created_at":"2026-05-18T01:35:15Z","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":"f175c273b249899e0e9382a837d8c1b8a26dad23df2208420c35a82755cc464b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-08-15T16:43:42Z","title_canon_sha256":"274be8c7ddea0221724adb45e1d765080238fc078c292dd309f84ce96e7cf097"},"schema_version":"1.0","source":{"id":"1508.03751","kind":"arxiv","version":1}},"canonical_sha256":"17417df4321243cb62b5ba4548bf99ec2481bec15ea4199470208c0f09527013","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"17417df4321243cb62b5ba4548bf99ec2481bec15ea4199470208c0f09527013","first_computed_at":"2026-05-18T01:35:15.300641Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:35:15.300641Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"T/HqTzwjos3CSYd7BUt3ByaUkkBvK3OJMA/2FIRTGF2a+zGQkI0cGUJzk9lqab7SPAlLEdjGQolGR6/dNEgHBg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:35:15.301101Z","signed_message":"canonical_sha256_bytes"},"source_id":"1508.03751","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7767ee78d664a4dcf702abe34a6847764be04a56347e746447102536b2b4ea39","sha256:db1f924080b3cea4d893c53768d920fba6e5df6675e4d4ee5eb7290d7258ce7f"],"state_sha256":"12f84afa85b71980db86d5c261beb1f850667f6c751c02a075c9dd3e43520886"}