{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:7IWQ5SCM53CFBJZEWPXTCW5GVD","short_pith_number":"pith:7IWQ5SCM","schema_version":"1.0","canonical_sha256":"fa2d0ec84ceec450a724b3ef315ba6a8de9b404cc5f2e8d44e97d5e1f69af4c0","source":{"kind":"arxiv","id":"1608.00105","version":3},"attestation_state":"computed","paper":{"title":"The $k$-proper index of complete bipartite and complete multipartite graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jingshu Zhang, Wenjing Li, Xueliang Li","submitted_at":"2016-07-30T11:53:08Z","abstract_excerpt":"Let $G$ be a nontrivial connected graph of order $n$ with an edge-coloring $c:E(G)\\rightarrow\\{1,2,\\dots,t\\}$,$t\\in\\mathbb{N}$, where adjacent edges may be colored with the same color. A tree $T$ in $G$ is a \\emph{proper tree} if no two adjacent edges of it are assigned the same color. Let $k$ be a fixed integer with $2\\leq k\\leq n$. For a vertex subset $S\\subseteq V(G)$ with $|S|\\geq 2$, a tree is called an \\emph{$S$-tree} if it connects $S$ in $G$ . A \\emph{$k$-proper coloring} of $G$ is an edge-coloring of $G$ having the property that for every set $S$ of $k$ vertices of $G$, there exists a"},"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":"1608.00105","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-07-30T11:53:08Z","cross_cats_sorted":[],"title_canon_sha256":"018c3f11ebaaff529adec9a811360f4aeba61235b4b0cdea479219b51a687592","abstract_canon_sha256":"53851c240b485f5367d0285abcd8f1f10fd779d5dc97b8339433d008147bc67f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:55:51.836682Z","signature_b64":"zJUvGYk6NtEGxUjTUo52DBPqXVYGEZYliX/BMkqfW0A53fAv3Ko6AdWuDOkvwb6uFfjDJxOZgrbbqPtSX7fwAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fa2d0ec84ceec450a724b3ef315ba6a8de9b404cc5f2e8d44e97d5e1f69af4c0","last_reissued_at":"2026-05-18T00:55:51.836188Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:55:51.836188Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The $k$-proper index of complete bipartite and complete multipartite graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jingshu Zhang, Wenjing Li, Xueliang Li","submitted_at":"2016-07-30T11:53:08Z","abstract_excerpt":"Let $G$ be a nontrivial connected graph of order $n$ with an edge-coloring $c:E(G)\\rightarrow\\{1,2,\\dots,t\\}$,$t\\in\\mathbb{N}$, where adjacent edges may be colored with the same color. A tree $T$ in $G$ is a \\emph{proper tree} if no two adjacent edges of it are assigned the same color. Let $k$ be a fixed integer with $2\\leq k\\leq n$. For a vertex subset $S\\subseteq V(G)$ with $|S|\\geq 2$, a tree is called an \\emph{$S$-tree} if it connects $S$ in $G$ . A \\emph{$k$-proper coloring} of $G$ is an edge-coloring of $G$ having the property that for every set $S$ of $k$ vertices of $G$, there exists a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.00105","kind":"arxiv","version":3},"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":"1608.00105","created_at":"2026-05-18T00:55:51.836270+00:00"},{"alias_kind":"arxiv_version","alias_value":"1608.00105v3","created_at":"2026-05-18T00:55:51.836270+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.00105","created_at":"2026-05-18T00:55:51.836270+00:00"},{"alias_kind":"pith_short_12","alias_value":"7IWQ5SCM53CF","created_at":"2026-05-18T12:30:04.600751+00:00"},{"alias_kind":"pith_short_16","alias_value":"7IWQ5SCM53CFBJZE","created_at":"2026-05-18T12:30:04.600751+00:00"},{"alias_kind":"pith_short_8","alias_value":"7IWQ5SCM","created_at":"2026-05-18T12:30:04.600751+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/7IWQ5SCM53CFBJZEWPXTCW5GVD","json":"https://pith.science/pith/7IWQ5SCM53CFBJZEWPXTCW5GVD.json","graph_json":"https://pith.science/api/pith-number/7IWQ5SCM53CFBJZEWPXTCW5GVD/graph.json","events_json":"https://pith.science/api/pith-number/7IWQ5SCM53CFBJZEWPXTCW5GVD/events.json","paper":"https://pith.science/paper/7IWQ5SCM"},"agent_actions":{"view_html":"https://pith.science/pith/7IWQ5SCM53CFBJZEWPXTCW5GVD","download_json":"https://pith.science/pith/7IWQ5SCM53CFBJZEWPXTCW5GVD.json","view_paper":"https://pith.science/paper/7IWQ5SCM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1608.00105&json=true","fetch_graph":"https://pith.science/api/pith-number/7IWQ5SCM53CFBJZEWPXTCW5GVD/graph.json","fetch_events":"https://pith.science/api/pith-number/7IWQ5SCM53CFBJZEWPXTCW5GVD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7IWQ5SCM53CFBJZEWPXTCW5GVD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7IWQ5SCM53CFBJZEWPXTCW5GVD/action/storage_attestation","attest_author":"https://pith.science/pith/7IWQ5SCM53CFBJZEWPXTCW5GVD/action/author_attestation","sign_citation":"https://pith.science/pith/7IWQ5SCM53CFBJZEWPXTCW5GVD/action/citation_signature","submit_replication":"https://pith.science/pith/7IWQ5SCM53CFBJZEWPXTCW5GVD/action/replication_record"}},"created_at":"2026-05-18T00:55:51.836270+00:00","updated_at":"2026-05-18T00:55:51.836270+00:00"}