{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:ISGVJLMX3SPTUDFZQCWV5HSCBJ","short_pith_number":"pith:ISGVJLMX","schema_version":"1.0","canonical_sha256":"448d54ad97dc9f3a0cb980ad5e9e420a7dde601fe43b1794528fe8d1a73eadd2","source":{"kind":"arxiv","id":"1708.06691","version":1},"attestation_state":"computed","paper":{"title":"Berge's Conjecture and Aharoni-Hartman-Hoffman's Conjecture for locally in-semicomplete digraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"C\\^andida Nunes da Silva, Carla Negri Lintzmayer, Maycon Sambinelli, Orlando Lee","submitted_at":"2017-08-22T16:07:52Z","abstract_excerpt":"Let $k$ be a positive integer and let $D$ be a digraph. A path partition $\\sP$ of $D$ is a set of vertex-disjoint paths which covers $V(D)$. Its $k$-norm is defined as $\\sum_{P \\in \\sP} \\Min{|V(P)|, k}$. A path partition is $k$-optimal if its $k$-norm is minimum among all path partitions of $D$. A partial $k$-coloring is a collection of $k$ disjoint stable sets. A partial $k$-coloring $\\sC$ is orthogonal to a path partition $\\sP$ if each path $P \\in \\sP$ meets $\\min\\{|P|,k\\}$ distinct sets of $\\sC$. Berge (1982) conjectured that every $k$-optimal path partition of $D$ has a partial $k$-colorin"},"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":"1708.06691","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-08-22T16:07:52Z","cross_cats_sorted":[],"title_canon_sha256":"ca99058a4a399b497970cefdad075c04f27cf65c32c413074574764ebfbb6a76","abstract_canon_sha256":"7b1788d2fe07eb35c5622c86f38bb270df9a16de4a7ada306efa906518e85b7d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:37:32.890961Z","signature_b64":"q6TzJmem+Hp5sdmevC6ex2GdXN+bN/sdYxyLc000sVpLQoCsXf/wZTHhL3zcRyNWKsUsNnagSIL+IF59V2gxAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"448d54ad97dc9f3a0cb980ad5e9e420a7dde601fe43b1794528fe8d1a73eadd2","last_reissued_at":"2026-05-18T00:37:32.890383Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:37:32.890383Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Berge's Conjecture and Aharoni-Hartman-Hoffman's Conjecture for locally in-semicomplete digraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"C\\^andida Nunes da Silva, Carla Negri Lintzmayer, Maycon Sambinelli, Orlando Lee","submitted_at":"2017-08-22T16:07:52Z","abstract_excerpt":"Let $k$ be a positive integer and let $D$ be a digraph. A path partition $\\sP$ of $D$ is a set of vertex-disjoint paths which covers $V(D)$. Its $k$-norm is defined as $\\sum_{P \\in \\sP} \\Min{|V(P)|, k}$. A path partition is $k$-optimal if its $k$-norm is minimum among all path partitions of $D$. A partial $k$-coloring is a collection of $k$ disjoint stable sets. A partial $k$-coloring $\\sC$ is orthogonal to a path partition $\\sP$ if each path $P \\in \\sP$ meets $\\min\\{|P|,k\\}$ distinct sets of $\\sC$. Berge (1982) conjectured that every $k$-optimal path partition of $D$ has a partial $k$-colorin"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.06691","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1708.06691","created_at":"2026-05-18T00:37:32.890448+00:00"},{"alias_kind":"arxiv_version","alias_value":"1708.06691v1","created_at":"2026-05-18T00:37:32.890448+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.06691","created_at":"2026-05-18T00:37:32.890448+00:00"},{"alias_kind":"pith_short_12","alias_value":"ISGVJLMX3SPT","created_at":"2026-05-18T12:31:21.493067+00:00"},{"alias_kind":"pith_short_16","alias_value":"ISGVJLMX3SPTUDFZ","created_at":"2026-05-18T12:31:21.493067+00:00"},{"alias_kind":"pith_short_8","alias_value":"ISGVJLMX","created_at":"2026-05-18T12:31:21.493067+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/ISGVJLMX3SPTUDFZQCWV5HSCBJ","json":"https://pith.science/pith/ISGVJLMX3SPTUDFZQCWV5HSCBJ.json","graph_json":"https://pith.science/api/pith-number/ISGVJLMX3SPTUDFZQCWV5HSCBJ/graph.json","events_json":"https://pith.science/api/pith-number/ISGVJLMX3SPTUDFZQCWV5HSCBJ/events.json","paper":"https://pith.science/paper/ISGVJLMX"},"agent_actions":{"view_html":"https://pith.science/pith/ISGVJLMX3SPTUDFZQCWV5HSCBJ","download_json":"https://pith.science/pith/ISGVJLMX3SPTUDFZQCWV5HSCBJ.json","view_paper":"https://pith.science/paper/ISGVJLMX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1708.06691&json=true","fetch_graph":"https://pith.science/api/pith-number/ISGVJLMX3SPTUDFZQCWV5HSCBJ/graph.json","fetch_events":"https://pith.science/api/pith-number/ISGVJLMX3SPTUDFZQCWV5HSCBJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ISGVJLMX3SPTUDFZQCWV5HSCBJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ISGVJLMX3SPTUDFZQCWV5HSCBJ/action/storage_attestation","attest_author":"https://pith.science/pith/ISGVJLMX3SPTUDFZQCWV5HSCBJ/action/author_attestation","sign_citation":"https://pith.science/pith/ISGVJLMX3SPTUDFZQCWV5HSCBJ/action/citation_signature","submit_replication":"https://pith.science/pith/ISGVJLMX3SPTUDFZQCWV5HSCBJ/action/replication_record"}},"created_at":"2026-05-18T00:37:32.890448+00:00","updated_at":"2026-05-18T00:37:32.890448+00:00"}