{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:RUN3SG44EZUZGLOX7AZTLJMKX7","short_pith_number":"pith:RUN3SG44","schema_version":"1.0","canonical_sha256":"8d1bb91b9c2669932dd7f83335a58abfcabed715d6a0ef09dab5f7b4b1f8fda0","source":{"kind":"arxiv","id":"1702.05946","version":1},"attestation_state":"computed","paper":{"title":"Cartesian products of directed graphs with loops","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Iztok Peterin, Wilfried Imrich","submitted_at":"2017-02-20T12:29:40Z","abstract_excerpt":"We show that every nontrivial finite or infinite connected directed graph with loops and at least one vertex without a loop is uniquely representable as a Cartesian or weak Cartesian product of prime graphs. For finite graphs the factorization can be computed in linear time and space."},"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":"1702.05946","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-02-20T12:29:40Z","cross_cats_sorted":[],"title_canon_sha256":"cb8e574e50986feb0ab6e373c14ebe7a2729bd3f6e037fe4542ee6e832cb7389","abstract_canon_sha256":"d337802533514262642529fc3b14eac548dffde65f77c88e2508a21cc40f35a8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:50:24.811368Z","signature_b64":"PnWknwOtZJSr3Um9B9bhBpnx+oZsIq8N7KJ4ykX/Pz+YOZsJ8gp4NZ8cve6G1YQlAryFCd0O82u/hulwOq/vBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8d1bb91b9c2669932dd7f83335a58abfcabed715d6a0ef09dab5f7b4b1f8fda0","last_reissued_at":"2026-05-18T00:50:24.810647Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:50:24.810647Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Cartesian products of directed graphs with loops","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Iztok Peterin, Wilfried Imrich","submitted_at":"2017-02-20T12:29:40Z","abstract_excerpt":"We show that every nontrivial finite or infinite connected directed graph with loops and at least one vertex without a loop is uniquely representable as a Cartesian or weak Cartesian product of prime graphs. For finite graphs the factorization can be computed in linear time and space."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.05946","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":"1702.05946","created_at":"2026-05-18T00:50:24.810764+00:00"},{"alias_kind":"arxiv_version","alias_value":"1702.05946v1","created_at":"2026-05-18T00:50:24.810764+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.05946","created_at":"2026-05-18T00:50:24.810764+00:00"},{"alias_kind":"pith_short_12","alias_value":"RUN3SG44EZUZ","created_at":"2026-05-18T12:31:39.905425+00:00"},{"alias_kind":"pith_short_16","alias_value":"RUN3SG44EZUZGLOX","created_at":"2026-05-18T12:31:39.905425+00:00"},{"alias_kind":"pith_short_8","alias_value":"RUN3SG44","created_at":"2026-05-18T12:31:39.905425+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/RUN3SG44EZUZGLOX7AZTLJMKX7","json":"https://pith.science/pith/RUN3SG44EZUZGLOX7AZTLJMKX7.json","graph_json":"https://pith.science/api/pith-number/RUN3SG44EZUZGLOX7AZTLJMKX7/graph.json","events_json":"https://pith.science/api/pith-number/RUN3SG44EZUZGLOX7AZTLJMKX7/events.json","paper":"https://pith.science/paper/RUN3SG44"},"agent_actions":{"view_html":"https://pith.science/pith/RUN3SG44EZUZGLOX7AZTLJMKX7","download_json":"https://pith.science/pith/RUN3SG44EZUZGLOX7AZTLJMKX7.json","view_paper":"https://pith.science/paper/RUN3SG44","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1702.05946&json=true","fetch_graph":"https://pith.science/api/pith-number/RUN3SG44EZUZGLOX7AZTLJMKX7/graph.json","fetch_events":"https://pith.science/api/pith-number/RUN3SG44EZUZGLOX7AZTLJMKX7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RUN3SG44EZUZGLOX7AZTLJMKX7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RUN3SG44EZUZGLOX7AZTLJMKX7/action/storage_attestation","attest_author":"https://pith.science/pith/RUN3SG44EZUZGLOX7AZTLJMKX7/action/author_attestation","sign_citation":"https://pith.science/pith/RUN3SG44EZUZGLOX7AZTLJMKX7/action/citation_signature","submit_replication":"https://pith.science/pith/RUN3SG44EZUZGLOX7AZTLJMKX7/action/replication_record"}},"created_at":"2026-05-18T00:50:24.810764+00:00","updated_at":"2026-05-18T00:50:24.810764+00:00"}