{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:ETKQWKE4Z7YJHKATKKTU5FFUWI","short_pith_number":"pith:ETKQWKE4","canonical_record":{"source":{"id":"1601.03503","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-01-14T06:44:04Z","cross_cats_sorted":[],"title_canon_sha256":"17a32efdb1be22cb6897841c832980d0304bc625c5617ef94b38731997bcf9a2","abstract_canon_sha256":"eedf4d73b43e4416bee2646b4fea09fcd0eca2849bc69667f6f697e76aa45fca"},"schema_version":"1.0"},"canonical_sha256":"24d50b289ccff093a81352a74e94b4b23ab1a2ae19bd8c1d1b433e761bb4c784","source":{"kind":"arxiv","id":"1601.03503","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1601.03503","created_at":"2026-05-18T01:22:53Z"},{"alias_kind":"arxiv_version","alias_value":"1601.03503v1","created_at":"2026-05-18T01:22:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.03503","created_at":"2026-05-18T01:22:53Z"},{"alias_kind":"pith_short_12","alias_value":"ETKQWKE4Z7YJ","created_at":"2026-05-18T12:30:15Z"},{"alias_kind":"pith_short_16","alias_value":"ETKQWKE4Z7YJHKAT","created_at":"2026-05-18T12:30:15Z"},{"alias_kind":"pith_short_8","alias_value":"ETKQWKE4","created_at":"2026-05-18T12:30:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:ETKQWKE4Z7YJHKATKKTU5FFUWI","target":"record","payload":{"canonical_record":{"source":{"id":"1601.03503","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-01-14T06:44:04Z","cross_cats_sorted":[],"title_canon_sha256":"17a32efdb1be22cb6897841c832980d0304bc625c5617ef94b38731997bcf9a2","abstract_canon_sha256":"eedf4d73b43e4416bee2646b4fea09fcd0eca2849bc69667f6f697e76aa45fca"},"schema_version":"1.0"},"canonical_sha256":"24d50b289ccff093a81352a74e94b4b23ab1a2ae19bd8c1d1b433e761bb4c784","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:22:53.295952Z","signature_b64":"DoxUkE2MmIg0N8qDfQZgkFw8z/FWBIgcnmOgjZvwL6ojZWhfp5o94E0/PJOPYzDhCLV5S5e0f/p1TteaBHH7Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"24d50b289ccff093a81352a74e94b4b23ab1a2ae19bd8c1d1b433e761bb4c784","last_reissued_at":"2026-05-18T01:22:53.295447Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:22:53.295447Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1601.03503","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-18T01:22:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hWLQarTX721b5XKjvhyDe46/OJZxBma59rqPfE3tPDcxup6+Yl7WJ+V30oWRlhPEf9hAt7wk9Rrn5U8wCVKpBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T23:39:00.391462Z"},"content_sha256":"c74c8b7f33115279b098fcb4eb76c383260313aee4236b64fa68c583d07c23c7","schema_version":"1.0","event_id":"sha256:c74c8b7f33115279b098fcb4eb76c383260313aee4236b64fa68c583d07c23c7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:ETKQWKE4Z7YJHKATKKTU5FFUWI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The $k$-proper index of graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jinfeng Liu, Lin Chen, Xueliang Li","submitted_at":"2016-01-14T06:44:04Z","abstract_excerpt":"A tree $T$ in an edge-colored graph is a \\emph{proper tree} if any two adjacent edges of $T$ are colored with different colors. Let $G$ be a graph of order $n$ and $k$ be a fixed integer with $2\\leq k\\leq n$. For a vertex set $S\\subseteq V(G)$, a tree containing the vertices of $S$ in $G$ is called an \\emph{$S$-tree}. An edge-coloring of $G$ is called a \\emph{$k$-proper coloring} if for every set $S$ of $k$ vertices in $G$, there exists a proper $S$-tree in $G$. The \\emph{$k$-proper index} of a nontrivial connected graph $G$, denoted by $px_k(G)$, is the smallest number of colors needed in a $"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.03503","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-18T01:22:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"unUlUTvP0xgO8sbQlFEXc0vgQDEWUAlbSbeKxxBEmefsTzrhLFdPOHNFhCKsBRBTmXewYnhPUIYxDBB5jk8YDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T23:39:00.392037Z"},"content_sha256":"f0c10f42e5e04f7c30374bfc0676558e970a4483d2839397a41e0e3042fe30a0","schema_version":"1.0","event_id":"sha256:f0c10f42e5e04f7c30374bfc0676558e970a4483d2839397a41e0e3042fe30a0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ETKQWKE4Z7YJHKATKKTU5FFUWI/bundle.json","state_url":"https://pith.science/pith/ETKQWKE4Z7YJHKATKKTU5FFUWI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ETKQWKE4Z7YJHKATKKTU5FFUWI/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-05-31T23:39:00Z","links":{"resolver":"https://pith.science/pith/ETKQWKE4Z7YJHKATKKTU5FFUWI","bundle":"https://pith.science/pith/ETKQWKE4Z7YJHKATKKTU5FFUWI/bundle.json","state":"https://pith.science/pith/ETKQWKE4Z7YJHKATKKTU5FFUWI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ETKQWKE4Z7YJHKATKKTU5FFUWI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:ETKQWKE4Z7YJHKATKKTU5FFUWI","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":"eedf4d73b43e4416bee2646b4fea09fcd0eca2849bc69667f6f697e76aa45fca","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-01-14T06:44:04Z","title_canon_sha256":"17a32efdb1be22cb6897841c832980d0304bc625c5617ef94b38731997bcf9a2"},"schema_version":"1.0","source":{"id":"1601.03503","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1601.03503","created_at":"2026-05-18T01:22:53Z"},{"alias_kind":"arxiv_version","alias_value":"1601.03503v1","created_at":"2026-05-18T01:22:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.03503","created_at":"2026-05-18T01:22:53Z"},{"alias_kind":"pith_short_12","alias_value":"ETKQWKE4Z7YJ","created_at":"2026-05-18T12:30:15Z"},{"alias_kind":"pith_short_16","alias_value":"ETKQWKE4Z7YJHKAT","created_at":"2026-05-18T12:30:15Z"},{"alias_kind":"pith_short_8","alias_value":"ETKQWKE4","created_at":"2026-05-18T12:30:15Z"}],"graph_snapshots":[{"event_id":"sha256:f0c10f42e5e04f7c30374bfc0676558e970a4483d2839397a41e0e3042fe30a0","target":"graph","created_at":"2026-05-18T01:22:53Z","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":"A tree $T$ in an edge-colored graph is a \\emph{proper tree} if any two adjacent edges of $T$ are colored with different colors. Let $G$ be a graph of order $n$ and $k$ be a fixed integer with $2\\leq k\\leq n$. For a vertex set $S\\subseteq V(G)$, a tree containing the vertices of $S$ in $G$ is called an \\emph{$S$-tree}. An edge-coloring of $G$ is called a \\emph{$k$-proper coloring} if for every set $S$ of $k$ vertices in $G$, there exists a proper $S$-tree in $G$. The \\emph{$k$-proper index} of a nontrivial connected graph $G$, denoted by $px_k(G)$, is the smallest number of colors needed in a $","authors_text":"Jinfeng Liu, Lin Chen, Xueliang Li","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-01-14T06:44:04Z","title":"The $k$-proper index of graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.03503","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:c74c8b7f33115279b098fcb4eb76c383260313aee4236b64fa68c583d07c23c7","target":"record","created_at":"2026-05-18T01:22:53Z","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":"eedf4d73b43e4416bee2646b4fea09fcd0eca2849bc69667f6f697e76aa45fca","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-01-14T06:44:04Z","title_canon_sha256":"17a32efdb1be22cb6897841c832980d0304bc625c5617ef94b38731997bcf9a2"},"schema_version":"1.0","source":{"id":"1601.03503","kind":"arxiv","version":1}},"canonical_sha256":"24d50b289ccff093a81352a74e94b4b23ab1a2ae19bd8c1d1b433e761bb4c784","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"24d50b289ccff093a81352a74e94b4b23ab1a2ae19bd8c1d1b433e761bb4c784","first_computed_at":"2026-05-18T01:22:53.295447Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:22:53.295447Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"DoxUkE2MmIg0N8qDfQZgkFw8z/FWBIgcnmOgjZvwL6ojZWhfp5o94E0/PJOPYzDhCLV5S5e0f/p1TteaBHH7Ag==","signature_status":"signed_v1","signed_at":"2026-05-18T01:22:53.295952Z","signed_message":"canonical_sha256_bytes"},"source_id":"1601.03503","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c74c8b7f33115279b098fcb4eb76c383260313aee4236b64fa68c583d07c23c7","sha256:f0c10f42e5e04f7c30374bfc0676558e970a4483d2839397a41e0e3042fe30a0"],"state_sha256":"3c1eda7e93db8e620fbd96b94f8e8511fc55c16e4b4bd77dfb1bef178c839033"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jc70zHGu9CdcbWnX5FTAAIXDV7xWqg/oYreORdDjy5C2zkndLnfAVgqt00iixCg+qpTBCSQgaHdorrLO6ySYDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T23:39:00.395825Z","bundle_sha256":"57d5126d0e8c98aa162b4ac55b9d69b9e7d1897a501e902bbf689375e2fd85e8"}}