{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:X36BECYSBWYBYU2BVLDRYOZOSM","short_pith_number":"pith:X36BECYS","schema_version":"1.0","canonical_sha256":"befc120b120db01c5341aac71c3b2e9317b6eb1b08abdac18ca7fdd3ac3d5d9b","source":{"kind":"arxiv","id":"1307.5509","version":2},"attestation_state":"computed","paper":{"title":"The double competition multigraph of a digraph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Jeongmi Park, Yoshio Sano","submitted_at":"2013-07-21T09:38:25Z","abstract_excerpt":"In this article, we introduce the notion of the double competition multigraph of a digraph. We give characterizations of the double competition multigraphs of arbitrary digraphs, loopless digraphs, reflexive digraphs, and acyclic digraphs in terms of edge clique partitions of the multigraphs."},"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":"1307.5509","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-07-21T09:38:25Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"7f1905f2063bae67d879126f41b2e362de2edf1b63904650edd1fd5f0a825003","abstract_canon_sha256":"cb35a0aaa2c58ff4349201a5fa43cbbbdb9a0416a9a9331c25ab2ebc558c5a33"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:21:38.272945Z","signature_b64":"Aat5Ets1mfEzSpQYPqxs56jBpS3HI8DopYjF9JvfkSThh+UfOhcUJ45xla8yvDAP/Z0J6Kgu0yoHbK2UUk8UCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"befc120b120db01c5341aac71c3b2e9317b6eb1b08abdac18ca7fdd3ac3d5d9b","last_reissued_at":"2026-05-18T01:21:38.272435Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:21:38.272435Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The double competition multigraph of a digraph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Jeongmi Park, Yoshio Sano","submitted_at":"2013-07-21T09:38:25Z","abstract_excerpt":"In this article, we introduce the notion of the double competition multigraph of a digraph. We give characterizations of the double competition multigraphs of arbitrary digraphs, loopless digraphs, reflexive digraphs, and acyclic digraphs in terms of edge clique partitions of the multigraphs."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1307.5509","kind":"arxiv","version":2},"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":"1307.5509","created_at":"2026-05-18T01:21:38.272516+00:00"},{"alias_kind":"arxiv_version","alias_value":"1307.5509v2","created_at":"2026-05-18T01:21:38.272516+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.5509","created_at":"2026-05-18T01:21:38.272516+00:00"},{"alias_kind":"pith_short_12","alias_value":"X36BECYSBWYB","created_at":"2026-05-18T12:28:06.772260+00:00"},{"alias_kind":"pith_short_16","alias_value":"X36BECYSBWYBYU2B","created_at":"2026-05-18T12:28:06.772260+00:00"},{"alias_kind":"pith_short_8","alias_value":"X36BECYS","created_at":"2026-05-18T12:28:06.772260+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/X36BECYSBWYBYU2BVLDRYOZOSM","json":"https://pith.science/pith/X36BECYSBWYBYU2BVLDRYOZOSM.json","graph_json":"https://pith.science/api/pith-number/X36BECYSBWYBYU2BVLDRYOZOSM/graph.json","events_json":"https://pith.science/api/pith-number/X36BECYSBWYBYU2BVLDRYOZOSM/events.json","paper":"https://pith.science/paper/X36BECYS"},"agent_actions":{"view_html":"https://pith.science/pith/X36BECYSBWYBYU2BVLDRYOZOSM","download_json":"https://pith.science/pith/X36BECYSBWYBYU2BVLDRYOZOSM.json","view_paper":"https://pith.science/paper/X36BECYS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1307.5509&json=true","fetch_graph":"https://pith.science/api/pith-number/X36BECYSBWYBYU2BVLDRYOZOSM/graph.json","fetch_events":"https://pith.science/api/pith-number/X36BECYSBWYBYU2BVLDRYOZOSM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/X36BECYSBWYBYU2BVLDRYOZOSM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/X36BECYSBWYBYU2BVLDRYOZOSM/action/storage_attestation","attest_author":"https://pith.science/pith/X36BECYSBWYBYU2BVLDRYOZOSM/action/author_attestation","sign_citation":"https://pith.science/pith/X36BECYSBWYBYU2BVLDRYOZOSM/action/citation_signature","submit_replication":"https://pith.science/pith/X36BECYSBWYBYU2BVLDRYOZOSM/action/replication_record"}},"created_at":"2026-05-18T01:21:38.272516+00:00","updated_at":"2026-05-18T01:21:38.272516+00:00"}