{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:J2JMQJAOZ6LQ4EG3GHWGJRKOST","short_pith_number":"pith:J2JMQJAO","schema_version":"1.0","canonical_sha256":"4e92c8240ecf970e10db31ec64c54e94daded6cd3ff7664bcd737b4b7ee6096d","source":{"kind":"arxiv","id":"1103.0709","version":1},"attestation_state":"computed","paper":{"title":"Factors of disconnected graphs and polynomials with nonnegative integer coefficients","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.AC"],"primary_cat":"math.CO","authors_text":"Christiaan E. van de Woestijne","submitted_at":"2011-03-03T15:07:28Z","abstract_excerpt":"We investigate the uniqueness of factorisation of possibly disconnected finite graphs with respect to the Cartesian, the strong and the direct product. It is proved that if a graph has $n$ connected components, where $n$ is prime, or $n=1,4,8,9$, and satisfies some additional conditions, it factors uniquely under the given products. If, on the contrary, $n=6$ or 10, all cases of nonunique factorisation are described precisely."},"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":"1103.0709","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-03-03T15:07:28Z","cross_cats_sorted":["math.AC"],"title_canon_sha256":"719b8f4017eec5a83fb775093f0cad8afa95f76c1fb24fff76c41ef662d42235","abstract_canon_sha256":"3d776ab0d74a384398684909affd8d16a7e3059f33bd47e5748456a1c37a233b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:27:27.474080Z","signature_b64":"IzNsu1DDQGyukr2ZARVunJxZRgB5Rtcz1brq/rhWZIDbToeLmEnKs3TD//azdZlZzbm8i1V6lNiZKA4lp7F1AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4e92c8240ecf970e10db31ec64c54e94daded6cd3ff7664bcd737b4b7ee6096d","last_reissued_at":"2026-05-18T04:27:27.473586Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:27:27.473586Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Factors of disconnected graphs and polynomials with nonnegative integer coefficients","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.AC"],"primary_cat":"math.CO","authors_text":"Christiaan E. van de Woestijne","submitted_at":"2011-03-03T15:07:28Z","abstract_excerpt":"We investigate the uniqueness of factorisation of possibly disconnected finite graphs with respect to the Cartesian, the strong and the direct product. It is proved that if a graph has $n$ connected components, where $n$ is prime, or $n=1,4,8,9$, and satisfies some additional conditions, it factors uniquely under the given products. If, on the contrary, $n=6$ or 10, all cases of nonunique factorisation are described precisely."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1103.0709","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":"1103.0709","created_at":"2026-05-18T04:27:27.473655+00:00"},{"alias_kind":"arxiv_version","alias_value":"1103.0709v1","created_at":"2026-05-18T04:27:27.473655+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1103.0709","created_at":"2026-05-18T04:27:27.473655+00:00"},{"alias_kind":"pith_short_12","alias_value":"J2JMQJAOZ6LQ","created_at":"2026-05-18T12:26:32.869790+00:00"},{"alias_kind":"pith_short_16","alias_value":"J2JMQJAOZ6LQ4EG3","created_at":"2026-05-18T12:26:32.869790+00:00"},{"alias_kind":"pith_short_8","alias_value":"J2JMQJAO","created_at":"2026-05-18T12:26:32.869790+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/J2JMQJAOZ6LQ4EG3GHWGJRKOST","json":"https://pith.science/pith/J2JMQJAOZ6LQ4EG3GHWGJRKOST.json","graph_json":"https://pith.science/api/pith-number/J2JMQJAOZ6LQ4EG3GHWGJRKOST/graph.json","events_json":"https://pith.science/api/pith-number/J2JMQJAOZ6LQ4EG3GHWGJRKOST/events.json","paper":"https://pith.science/paper/J2JMQJAO"},"agent_actions":{"view_html":"https://pith.science/pith/J2JMQJAOZ6LQ4EG3GHWGJRKOST","download_json":"https://pith.science/pith/J2JMQJAOZ6LQ4EG3GHWGJRKOST.json","view_paper":"https://pith.science/paper/J2JMQJAO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1103.0709&json=true","fetch_graph":"https://pith.science/api/pith-number/J2JMQJAOZ6LQ4EG3GHWGJRKOST/graph.json","fetch_events":"https://pith.science/api/pith-number/J2JMQJAOZ6LQ4EG3GHWGJRKOST/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/J2JMQJAOZ6LQ4EG3GHWGJRKOST/action/timestamp_anchor","attest_storage":"https://pith.science/pith/J2JMQJAOZ6LQ4EG3GHWGJRKOST/action/storage_attestation","attest_author":"https://pith.science/pith/J2JMQJAOZ6LQ4EG3GHWGJRKOST/action/author_attestation","sign_citation":"https://pith.science/pith/J2JMQJAOZ6LQ4EG3GHWGJRKOST/action/citation_signature","submit_replication":"https://pith.science/pith/J2JMQJAOZ6LQ4EG3GHWGJRKOST/action/replication_record"}},"created_at":"2026-05-18T04:27:27.473655+00:00","updated_at":"2026-05-18T04:27:27.473655+00:00"}