{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:IX4AMC6VDLN5VJ4KKBKM6VBOTX","short_pith_number":"pith:IX4AMC6V","schema_version":"1.0","canonical_sha256":"45f8060bd51adbdaa78a5054cf542e9de367f07bc061ceec5eaae29c1012c35a","source":{"kind":"arxiv","id":"1606.03872","version":2},"attestation_state":"computed","paper":{"title":"The $(k,\\ell)$-proper index of graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Colton Magnant, Hong Chang, Xueliang Li, Zhongmei Qin","submitted_at":"2016-06-13T09:30:48Z","abstract_excerpt":"A tree $T$ in an edge-colored graph is called a {\\it proper tree} if no two adjacent edges of $T$ receive the same color. Let $G$ be a connected graph of order $n$ and $k$ be an integer with $2\\leq k \\leq n$. For $S\\subseteq V(G)$ and $|S| \\ge 2$, an $S$-tree is a tree containing the vertices of $S$ in $G$. Suppose $\\{T_1,T_2,\\ldots,T_\\ell\\}$ is a set of $S$-trees, they are called \\emph{internally disjoint} if $E(T_i)\\cap E(T_j)=\\emptyset$ and $V(T_i)\\cap V(T_j)=S$ for $1\\leq i\\neq j\\leq \\ell$. For a set $S$ of $k$ vertices of $G$, the maximum number of internally disjoint $S$-trees in $G$ is "},"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":"1606.03872","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-06-13T09:30:48Z","cross_cats_sorted":[],"title_canon_sha256":"d0a5043793f62bd30cd2268a88e76e8e28028b494b16caaf16da2a3495120771","abstract_canon_sha256":"966a8f257a66458785654374a357f54218bbde69b6ab82cb28de47fa12dcb3a6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:12:19.647874Z","signature_b64":"Tq4inmp21zqP2iQ7Mo97APNLe0TzFROxct4L8AIuRZqg9HBRWS6RWdLdBEwq9WmxLsDcbjat8pchmTA4aNowBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"45f8060bd51adbdaa78a5054cf542e9de367f07bc061ceec5eaae29c1012c35a","last_reissued_at":"2026-05-18T01:12:19.647523Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:12:19.647523Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The $(k,\\ell)$-proper index of graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Colton Magnant, Hong Chang, Xueliang Li, Zhongmei Qin","submitted_at":"2016-06-13T09:30:48Z","abstract_excerpt":"A tree $T$ in an edge-colored graph is called a {\\it proper tree} if no two adjacent edges of $T$ receive the same color. Let $G$ be a connected graph of order $n$ and $k$ be an integer with $2\\leq k \\leq n$. For $S\\subseteq V(G)$ and $|S| \\ge 2$, an $S$-tree is a tree containing the vertices of $S$ in $G$. Suppose $\\{T_1,T_2,\\ldots,T_\\ell\\}$ is a set of $S$-trees, they are called \\emph{internally disjoint} if $E(T_i)\\cap E(T_j)=\\emptyset$ and $V(T_i)\\cap V(T_j)=S$ for $1\\leq i\\neq j\\leq \\ell$. For a set $S$ of $k$ vertices of $G$, the maximum number of internally disjoint $S$-trees in $G$ is "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.03872","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":"1606.03872","created_at":"2026-05-18T01:12:19.647577+00:00"},{"alias_kind":"arxiv_version","alias_value":"1606.03872v2","created_at":"2026-05-18T01:12:19.647577+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.03872","created_at":"2026-05-18T01:12:19.647577+00:00"},{"alias_kind":"pith_short_12","alias_value":"IX4AMC6VDLN5","created_at":"2026-05-18T12:30:22.444734+00:00"},{"alias_kind":"pith_short_16","alias_value":"IX4AMC6VDLN5VJ4K","created_at":"2026-05-18T12:30:22.444734+00:00"},{"alias_kind":"pith_short_8","alias_value":"IX4AMC6V","created_at":"2026-05-18T12:30:22.444734+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/IX4AMC6VDLN5VJ4KKBKM6VBOTX","json":"https://pith.science/pith/IX4AMC6VDLN5VJ4KKBKM6VBOTX.json","graph_json":"https://pith.science/api/pith-number/IX4AMC6VDLN5VJ4KKBKM6VBOTX/graph.json","events_json":"https://pith.science/api/pith-number/IX4AMC6VDLN5VJ4KKBKM6VBOTX/events.json","paper":"https://pith.science/paper/IX4AMC6V"},"agent_actions":{"view_html":"https://pith.science/pith/IX4AMC6VDLN5VJ4KKBKM6VBOTX","download_json":"https://pith.science/pith/IX4AMC6VDLN5VJ4KKBKM6VBOTX.json","view_paper":"https://pith.science/paper/IX4AMC6V","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1606.03872&json=true","fetch_graph":"https://pith.science/api/pith-number/IX4AMC6VDLN5VJ4KKBKM6VBOTX/graph.json","fetch_events":"https://pith.science/api/pith-number/IX4AMC6VDLN5VJ4KKBKM6VBOTX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IX4AMC6VDLN5VJ4KKBKM6VBOTX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IX4AMC6VDLN5VJ4KKBKM6VBOTX/action/storage_attestation","attest_author":"https://pith.science/pith/IX4AMC6VDLN5VJ4KKBKM6VBOTX/action/author_attestation","sign_citation":"https://pith.science/pith/IX4AMC6VDLN5VJ4KKBKM6VBOTX/action/citation_signature","submit_replication":"https://pith.science/pith/IX4AMC6VDLN5VJ4KKBKM6VBOTX/action/replication_record"}},"created_at":"2026-05-18T01:12:19.647577+00:00","updated_at":"2026-05-18T01:12:19.647577+00:00"}