{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:5UE3THAXUWO45A2KSTXH6PANJW","short_pith_number":"pith:5UE3THAX","schema_version":"1.0","canonical_sha256":"ed09b99c17a59dce834a94ee7f3c0d4da07049d44ec6afbbc18a5f48ec862ed8","source":{"kind":"arxiv","id":"1603.09557","version":1},"attestation_state":"computed","paper":{"title":"Chromatic number of signed graphs with bounded maximum degree","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Sagnik Sen, Sandip Das, Soumen Nandi, Soumyajit Paul","submitted_at":"2016-03-31T12:36:29Z","abstract_excerpt":"A signed graph $ (G, \\Sigma)$ is a graph positive and negative ($\\Sigma $ denotes the set of negative edges). To re-sign a vertex $v$ of a signed graph $ (G, \\Sigma)$ is to switch the signs of the edges incident to $v$. If one can obtain $ (G, \\Sigma')$ by re-signing some vertices of $ (G, \\Sigma)$, then\n  $ (G, \\Sigma) \\equiv (G, \\Sigma')$.\n  A signed graphs $ (G, \\Sigma )$ admits an homomorphism to $ (H, \\Lambda )$ if there is a sign preserving vertex mapping from $(G,\\Sigma')$ to $(H, \\Lambda)$ for some $ (G, \\Sigma) \\equiv (G, \\Sigma')$.\n  The signed chromatic number $\\chi_{s}( (G, \\Sigma)"},"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":"1603.09557","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-03-31T12:36:29Z","cross_cats_sorted":[],"title_canon_sha256":"06806fcfe35d449b7266db70a71dc4bb3c214a4f3d8eb35c1196f69d7dec57a0","abstract_canon_sha256":"e436f766b491921d9ac2e6c94f824cda5d8d74b8cb0d41da68ae21849785d39c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:17:58.283627Z","signature_b64":"GwJe6j1V+4Sz6hbBgT0AdviVG9d/gU7inXYDpdMRWfUMGvWhIdl66OPWSiB+egJ7Bm1YdCperIPJ+mHz93NcCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ed09b99c17a59dce834a94ee7f3c0d4da07049d44ec6afbbc18a5f48ec862ed8","last_reissued_at":"2026-05-18T01:17:58.282885Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:17:58.282885Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Chromatic number of signed graphs with bounded maximum degree","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Sagnik Sen, Sandip Das, Soumen Nandi, Soumyajit Paul","submitted_at":"2016-03-31T12:36:29Z","abstract_excerpt":"A signed graph $ (G, \\Sigma)$ is a graph positive and negative ($\\Sigma $ denotes the set of negative edges). To re-sign a vertex $v$ of a signed graph $ (G, \\Sigma)$ is to switch the signs of the edges incident to $v$. If one can obtain $ (G, \\Sigma')$ by re-signing some vertices of $ (G, \\Sigma)$, then\n  $ (G, \\Sigma) \\equiv (G, \\Sigma')$.\n  A signed graphs $ (G, \\Sigma )$ admits an homomorphism to $ (H, \\Lambda )$ if there is a sign preserving vertex mapping from $(G,\\Sigma')$ to $(H, \\Lambda)$ for some $ (G, \\Sigma) \\equiv (G, \\Sigma')$.\n  The signed chromatic number $\\chi_{s}( (G, \\Sigma)"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.09557","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":"1603.09557","created_at":"2026-05-18T01:17:58.283001+00:00"},{"alias_kind":"arxiv_version","alias_value":"1603.09557v1","created_at":"2026-05-18T01:17:58.283001+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.09557","created_at":"2026-05-18T01:17:58.283001+00:00"},{"alias_kind":"pith_short_12","alias_value":"5UE3THAXUWO4","created_at":"2026-05-18T12:30:01.593930+00:00"},{"alias_kind":"pith_short_16","alias_value":"5UE3THAXUWO45A2K","created_at":"2026-05-18T12:30:01.593930+00:00"},{"alias_kind":"pith_short_8","alias_value":"5UE3THAX","created_at":"2026-05-18T12:30:01.593930+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/5UE3THAXUWO45A2KSTXH6PANJW","json":"https://pith.science/pith/5UE3THAXUWO45A2KSTXH6PANJW.json","graph_json":"https://pith.science/api/pith-number/5UE3THAXUWO45A2KSTXH6PANJW/graph.json","events_json":"https://pith.science/api/pith-number/5UE3THAXUWO45A2KSTXH6PANJW/events.json","paper":"https://pith.science/paper/5UE3THAX"},"agent_actions":{"view_html":"https://pith.science/pith/5UE3THAXUWO45A2KSTXH6PANJW","download_json":"https://pith.science/pith/5UE3THAXUWO45A2KSTXH6PANJW.json","view_paper":"https://pith.science/paper/5UE3THAX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1603.09557&json=true","fetch_graph":"https://pith.science/api/pith-number/5UE3THAXUWO45A2KSTXH6PANJW/graph.json","fetch_events":"https://pith.science/api/pith-number/5UE3THAXUWO45A2KSTXH6PANJW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5UE3THAXUWO45A2KSTXH6PANJW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5UE3THAXUWO45A2KSTXH6PANJW/action/storage_attestation","attest_author":"https://pith.science/pith/5UE3THAXUWO45A2KSTXH6PANJW/action/author_attestation","sign_citation":"https://pith.science/pith/5UE3THAXUWO45A2KSTXH6PANJW/action/citation_signature","submit_replication":"https://pith.science/pith/5UE3THAXUWO45A2KSTXH6PANJW/action/replication_record"}},"created_at":"2026-05-18T01:17:58.283001+00:00","updated_at":"2026-05-18T01:17:58.283001+00:00"}