{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:ISGVJLMX3SPTUDFZQCWV5HSCBJ","short_pith_number":"pith:ISGVJLMX","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"},"canonical_sha256":"448d54ad97dc9f3a0cb980ad5e9e420a7dde601fe43b1794528fe8d1a73eadd2","source":{"kind":"arxiv","id":"1708.06691","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.06691","created_at":"2026-05-18T00:37:32Z"},{"alias_kind":"arxiv_version","alias_value":"1708.06691v1","created_at":"2026-05-18T00:37:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.06691","created_at":"2026-05-18T00:37:32Z"},{"alias_kind":"pith_short_12","alias_value":"ISGVJLMX3SPT","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_16","alias_value":"ISGVJLMX3SPTUDFZ","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_8","alias_value":"ISGVJLMX","created_at":"2026-05-18T12:31:21Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:ISGVJLMX3SPTUDFZQCWV5HSCBJ","target":"record","payload":{"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"},"canonical_sha256":"448d54ad97dc9f3a0cb980ad5e9e420a7dde601fe43b1794528fe8d1a73eadd2","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"},"source_kind":"arxiv","source_id":"1708.06691","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:37:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ajkRrgWrLZdQRzjPpC59vhQQDXUvR5NTlWi+LxB46VhYmxu5gCyI8WOGGTqG4RC6hvXfPuQpjIS+MIm9lAIZCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-22T19:27:22.075708Z"},"content_sha256":"d7a0799d5396c1eb55a8a8a7c33c24e7ff7b89a224773cb00f490a4c25dc3562","schema_version":"1.0","event_id":"sha256:d7a0799d5396c1eb55a8a8a7c33c24e7ff7b89a224773cb00f490a4c25dc3562"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:ISGVJLMX3SPTUDFZQCWV5HSCBJ","target":"graph","payload":{"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"},"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:37:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+OOQKUstqzsMVF4eoAl9+wpQM+tPPW8HXB1HysVa4JsgkPgbWhw4VJAgsaZP75Xo0lSDGKzTDVIMD3jGTVYYCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-22T19:27:22.076055Z"},"content_sha256":"1b89b003c778deff7c0d87617086b1297b254eb84b220eb7ae2e62bfb36fcf0e","schema_version":"1.0","event_id":"sha256:1b89b003c778deff7c0d87617086b1297b254eb84b220eb7ae2e62bfb36fcf0e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ISGVJLMX3SPTUDFZQCWV5HSCBJ/bundle.json","state_url":"https://pith.science/pith/ISGVJLMX3SPTUDFZQCWV5HSCBJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ISGVJLMX3SPTUDFZQCWV5HSCBJ/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-22T19:27:22Z","links":{"resolver":"https://pith.science/pith/ISGVJLMX3SPTUDFZQCWV5HSCBJ","bundle":"https://pith.science/pith/ISGVJLMX3SPTUDFZQCWV5HSCBJ/bundle.json","state":"https://pith.science/pith/ISGVJLMX3SPTUDFZQCWV5HSCBJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ISGVJLMX3SPTUDFZQCWV5HSCBJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:ISGVJLMX3SPTUDFZQCWV5HSCBJ","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":"7b1788d2fe07eb35c5622c86f38bb270df9a16de4a7ada306efa906518e85b7d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-08-22T16:07:52Z","title_canon_sha256":"ca99058a4a399b497970cefdad075c04f27cf65c32c413074574764ebfbb6a76"},"schema_version":"1.0","source":{"id":"1708.06691","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.06691","created_at":"2026-05-18T00:37:32Z"},{"alias_kind":"arxiv_version","alias_value":"1708.06691v1","created_at":"2026-05-18T00:37:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.06691","created_at":"2026-05-18T00:37:32Z"},{"alias_kind":"pith_short_12","alias_value":"ISGVJLMX3SPT","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_16","alias_value":"ISGVJLMX3SPTUDFZ","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_8","alias_value":"ISGVJLMX","created_at":"2026-05-18T12:31:21Z"}],"graph_snapshots":[{"event_id":"sha256:1b89b003c778deff7c0d87617086b1297b254eb84b220eb7ae2e62bfb36fcf0e","target":"graph","created_at":"2026-05-18T00:37:32Z","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":"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","authors_text":"C\\^andida Nunes da Silva, Carla Negri Lintzmayer, Maycon Sambinelli, Orlando Lee","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-08-22T16:07:52Z","title":"Berge's Conjecture and Aharoni-Hartman-Hoffman's Conjecture for locally in-semicomplete digraphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.06691","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:d7a0799d5396c1eb55a8a8a7c33c24e7ff7b89a224773cb00f490a4c25dc3562","target":"record","created_at":"2026-05-18T00:37:32Z","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":"7b1788d2fe07eb35c5622c86f38bb270df9a16de4a7ada306efa906518e85b7d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-08-22T16:07:52Z","title_canon_sha256":"ca99058a4a399b497970cefdad075c04f27cf65c32c413074574764ebfbb6a76"},"schema_version":"1.0","source":{"id":"1708.06691","kind":"arxiv","version":1}},"canonical_sha256":"448d54ad97dc9f3a0cb980ad5e9e420a7dde601fe43b1794528fe8d1a73eadd2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"448d54ad97dc9f3a0cb980ad5e9e420a7dde601fe43b1794528fe8d1a73eadd2","first_computed_at":"2026-05-18T00:37:32.890383Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:37:32.890383Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"q6TzJmem+Hp5sdmevC6ex2GdXN+bN/sdYxyLc000sVpLQoCsXf/wZTHhL3zcRyNWKsUsNnagSIL+IF59V2gxAw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:37:32.890961Z","signed_message":"canonical_sha256_bytes"},"source_id":"1708.06691","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d7a0799d5396c1eb55a8a8a7c33c24e7ff7b89a224773cb00f490a4c25dc3562","sha256:1b89b003c778deff7c0d87617086b1297b254eb84b220eb7ae2e62bfb36fcf0e"],"state_sha256":"6286b1379849e85b6aa6ebe2553f71f256b832b0fc7e824d26aeb05588902d13"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"r1AUTqM7J4JG6xktW5HX2iYQaiI6BC1ANvKNkPrCLVAdvNXdQuSz4VmVDknjkXGLG9zERw4pvMNZvT22XMxmBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-22T19:27:22.078384Z","bundle_sha256":"35c83d249fc436ce6c810cd0691b6eb0a250275c19102c84262cd9e4bc64226b"}}