{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:AEG4FNTLEYSSNZRCHZIPWZL33Y","short_pith_number":"pith:AEG4FNTL","canonical_record":{"source":{"id":"1708.02690","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-08-09T01:37:09Z","cross_cats_sorted":[],"title_canon_sha256":"87f7b8f4f07d605b3bb642f37778366efdd84bea7daf974a8376f19c10d2b02a","abstract_canon_sha256":"27651ddda1d23e6ccfb0ec60c87e7f7ef7f2f345f8c471a4c6c145fcc7350176"},"schema_version":"1.0"},"canonical_sha256":"010dc2b66b262526e6223e50fb657bde3bf37366c74065b1507f72eaa933f9c3","source":{"kind":"arxiv","id":"1708.02690","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.02690","created_at":"2026-05-18T00:38:19Z"},{"alias_kind":"arxiv_version","alias_value":"1708.02690v1","created_at":"2026-05-18T00:38:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.02690","created_at":"2026-05-18T00:38:19Z"},{"alias_kind":"pith_short_12","alias_value":"AEG4FNTLEYSS","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_16","alias_value":"AEG4FNTLEYSSNZRC","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_8","alias_value":"AEG4FNTL","created_at":"2026-05-18T12:31:05Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:AEG4FNTLEYSSNZRCHZIPWZL33Y","target":"record","payload":{"canonical_record":{"source":{"id":"1708.02690","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-08-09T01:37:09Z","cross_cats_sorted":[],"title_canon_sha256":"87f7b8f4f07d605b3bb642f37778366efdd84bea7daf974a8376f19c10d2b02a","abstract_canon_sha256":"27651ddda1d23e6ccfb0ec60c87e7f7ef7f2f345f8c471a4c6c145fcc7350176"},"schema_version":"1.0"},"canonical_sha256":"010dc2b66b262526e6223e50fb657bde3bf37366c74065b1507f72eaa933f9c3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:38:19.904919Z","signature_b64":"uN0wMf/AdEvNVYEMtmEVwWAwGmYHLNTFhFm8UEbxb+xut46gvASp5cEiH4OxIj2ggLT7NfO+o5epIPRPB8dcCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"010dc2b66b262526e6223e50fb657bde3bf37366c74065b1507f72eaa933f9c3","last_reissued_at":"2026-05-18T00:38:19.904142Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:38:19.904142Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1708.02690","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-18T00:38:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tTxH4OE3iK+6aG/3V1IyoRdqU+Zkvhx2qGOyBR+6F/uthTFGFIA3DkcvID+2iZCnNG+cVGkNi89I8kyVX5LZBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T15:25:41.245830Z"},"content_sha256":"4b089cd9bb19c7312c55355891fb07ab83d4eb045ce59b2f6c33f3739243f974","schema_version":"1.0","event_id":"sha256:4b089cd9bb19c7312c55355891fb07ab83d4eb045ce59b2f6c33f3739243f974"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:AEG4FNTLEYSSNZRCHZIPWZL33Y","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the number of proper paths between vertices in edge-colored hypercubes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Lina Xue, Shurong Zhang, Weihua Yang","submitted_at":"2017-08-09T01:37:09Z","abstract_excerpt":"Given an integer $1\\leq j <n$, define the $(j)$-coloring of a $n$-dimensional hypercube $H_{n}$ to be the $2$-coloring of the edges of $H_{n}$ in which all edges in dimension $i$, $1\\leq i \\leq j$, have color $1$ and all other edges have color $2$. Cheng et al.\n  [Proper distance in edge-colored hypercubes, Applied Mathematics and Computation 313 (2017) 384-391.] determined the number of distinct shortest properly colored paths between a pair of vertices for the $(1)$-colored hypercubes. It is natural to consider the number for $(j)$-coloring, $j\\geq 2$. In this note, we determine the number o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.02690","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-18T00:38:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"knW4clJVMcQQNN7AxuGmT83MiQU2YFLy/wWgzFOqC7Uac5uImnTsnsoHZiwgzHUnXQRyEcmBj/Rr/Gc3jcGtBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T15:25:41.246166Z"},"content_sha256":"c7ceb8c7767e2d2d9c60d20e331ca7971bdea4511971dc42dc3f11cf84de46ce","schema_version":"1.0","event_id":"sha256:c7ceb8c7767e2d2d9c60d20e331ca7971bdea4511971dc42dc3f11cf84de46ce"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/AEG4FNTLEYSSNZRCHZIPWZL33Y/bundle.json","state_url":"https://pith.science/pith/AEG4FNTLEYSSNZRCHZIPWZL33Y/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/AEG4FNTLEYSSNZRCHZIPWZL33Y/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-06-01T15:25:41Z","links":{"resolver":"https://pith.science/pith/AEG4FNTLEYSSNZRCHZIPWZL33Y","bundle":"https://pith.science/pith/AEG4FNTLEYSSNZRCHZIPWZL33Y/bundle.json","state":"https://pith.science/pith/AEG4FNTLEYSSNZRCHZIPWZL33Y/state.json","well_known_bundle":"https://pith.science/.well-known/pith/AEG4FNTLEYSSNZRCHZIPWZL33Y/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:AEG4FNTLEYSSNZRCHZIPWZL33Y","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":"27651ddda1d23e6ccfb0ec60c87e7f7ef7f2f345f8c471a4c6c145fcc7350176","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-08-09T01:37:09Z","title_canon_sha256":"87f7b8f4f07d605b3bb642f37778366efdd84bea7daf974a8376f19c10d2b02a"},"schema_version":"1.0","source":{"id":"1708.02690","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.02690","created_at":"2026-05-18T00:38:19Z"},{"alias_kind":"arxiv_version","alias_value":"1708.02690v1","created_at":"2026-05-18T00:38:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.02690","created_at":"2026-05-18T00:38:19Z"},{"alias_kind":"pith_short_12","alias_value":"AEG4FNTLEYSS","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_16","alias_value":"AEG4FNTLEYSSNZRC","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_8","alias_value":"AEG4FNTL","created_at":"2026-05-18T12:31:05Z"}],"graph_snapshots":[{"event_id":"sha256:c7ceb8c7767e2d2d9c60d20e331ca7971bdea4511971dc42dc3f11cf84de46ce","target":"graph","created_at":"2026-05-18T00:38:19Z","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 integer $1\\leq j <n$, define the $(j)$-coloring of a $n$-dimensional hypercube $H_{n}$ to be the $2$-coloring of the edges of $H_{n}$ in which all edges in dimension $i$, $1\\leq i \\leq j$, have color $1$ and all other edges have color $2$. Cheng et al.\n  [Proper distance in edge-colored hypercubes, Applied Mathematics and Computation 313 (2017) 384-391.] determined the number of distinct shortest properly colored paths between a pair of vertices for the $(1)$-colored hypercubes. It is natural to consider the number for $(j)$-coloring, $j\\geq 2$. In this note, we determine the number o","authors_text":"Lina Xue, Shurong Zhang, Weihua Yang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-08-09T01:37:09Z","title":"On the number of proper paths between vertices in edge-colored hypercubes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.02690","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:4b089cd9bb19c7312c55355891fb07ab83d4eb045ce59b2f6c33f3739243f974","target":"record","created_at":"2026-05-18T00:38:19Z","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":"27651ddda1d23e6ccfb0ec60c87e7f7ef7f2f345f8c471a4c6c145fcc7350176","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-08-09T01:37:09Z","title_canon_sha256":"87f7b8f4f07d605b3bb642f37778366efdd84bea7daf974a8376f19c10d2b02a"},"schema_version":"1.0","source":{"id":"1708.02690","kind":"arxiv","version":1}},"canonical_sha256":"010dc2b66b262526e6223e50fb657bde3bf37366c74065b1507f72eaa933f9c3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"010dc2b66b262526e6223e50fb657bde3bf37366c74065b1507f72eaa933f9c3","first_computed_at":"2026-05-18T00:38:19.904142Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:38:19.904142Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"uN0wMf/AdEvNVYEMtmEVwWAwGmYHLNTFhFm8UEbxb+xut46gvASp5cEiH4OxIj2ggLT7NfO+o5epIPRPB8dcCg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:38:19.904919Z","signed_message":"canonical_sha256_bytes"},"source_id":"1708.02690","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4b089cd9bb19c7312c55355891fb07ab83d4eb045ce59b2f6c33f3739243f974","sha256:c7ceb8c7767e2d2d9c60d20e331ca7971bdea4511971dc42dc3f11cf84de46ce"],"state_sha256":"39a603dcdb845d8eb5d5b418985c1012c7d523b82ad262355bca8c6179dc0661"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4Ep900HpqA96DRCq7uinU/72dH4ZeN0RfVifT27ut0rvq1lUXyZnNdwV0Y/pjiAxzofLtctt3rtgPjWA92KECA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T15:25:41.248178Z","bundle_sha256":"d57d22ffd5d56cad26ff1cb3f3b3491fffcb61ed8b7156586f04b84024ea601a"}}