{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:OCAI3D2THO52GBHAXHG4MYHJ5Z","short_pith_number":"pith:OCAI3D2T","canonical_record":{"source":{"id":"1202.6461","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-02-29T07:00:02Z","cross_cats_sorted":[],"title_canon_sha256":"59530a715826acaa8a2b87764c57bbcfa0aa3e0e5ed361481f85ddb8630d3ff3","abstract_canon_sha256":"3146a5b935a8f619f0a59633777414ea58a658020c121685c14229e25832791f"},"schema_version":"1.0"},"canonical_sha256":"70808d8f533bbba304e0b9cdc660e9ee6a2d167b2131ef09b2a4b513371d1ef0","source":{"kind":"arxiv","id":"1202.6461","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1202.6461","created_at":"2026-05-18T04:01:12Z"},{"alias_kind":"arxiv_version","alias_value":"1202.6461v1","created_at":"2026-05-18T04:01:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1202.6461","created_at":"2026-05-18T04:01:12Z"},{"alias_kind":"pith_short_12","alias_value":"OCAI3D2THO52","created_at":"2026-05-18T12:27:16Z"},{"alias_kind":"pith_short_16","alias_value":"OCAI3D2THO52GBHA","created_at":"2026-05-18T12:27:16Z"},{"alias_kind":"pith_short_8","alias_value":"OCAI3D2T","created_at":"2026-05-18T12:27:16Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:OCAI3D2THO52GBHAXHG4MYHJ5Z","target":"record","payload":{"canonical_record":{"source":{"id":"1202.6461","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-02-29T07:00:02Z","cross_cats_sorted":[],"title_canon_sha256":"59530a715826acaa8a2b87764c57bbcfa0aa3e0e5ed361481f85ddb8630d3ff3","abstract_canon_sha256":"3146a5b935a8f619f0a59633777414ea58a658020c121685c14229e25832791f"},"schema_version":"1.0"},"canonical_sha256":"70808d8f533bbba304e0b9cdc660e9ee6a2d167b2131ef09b2a4b513371d1ef0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:01:12.503226Z","signature_b64":"8Q88Vs8m6XQyTl/6Gsc+hh8UhgJMQiHkjwMsBX6LzlvK+/ldhi3NA878Ub38If5P+gJAFqXRFv2IaT3bHQEEBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"70808d8f533bbba304e0b9cdc660e9ee6a2d167b2131ef09b2a4b513371d1ef0","last_reissued_at":"2026-05-18T04:01:12.502677Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:01:12.502677Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1202.6461","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-18T04:01:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+L+HkGbfRQvu74Gyi815sLkrGnu7q9Ts8YJOeGCPJF8HG7w6lKdMm/9lnEGeAZRJglSKd6CAxVLHaD6Q5wtlBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T23:16:38.528589Z"},"content_sha256":"10e1fd4d39047e730e1df5de8815899967430f9f96c5a4b1a00c1d19578ac6a6","schema_version":"1.0","event_id":"sha256:10e1fd4d39047e730e1df5de8815899967430f9f96c5a4b1a00c1d19578ac6a6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:OCAI3D2THO52GBHAXHG4MYHJ5Z","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The Minimum Number of Dependent Arcs and a Related Parameter of Generalized Mycielski Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Hsin-Hao Lai, Ko-Wei Lih","submitted_at":"2012-02-29T07:00:02Z","abstract_excerpt":"Let D be an acyclic orientation of the graph G. An arc of D is dependent if its reversal creates a directed cycle. Let m(G) denote the minimum number of dependent arcs over all acyclic orientations of G. For any k > 0, a generalized Mycielski graph M_k(G) of G is defined. Note that M_1(G) is the usual Mycielskian of G. We generalize results concerning m(M_1(G)) in K. L. Collins, K. Tysdal, J. Graph Theory, 46 (2004), 285-296, to m(M_k(G)). The underlying graph of a Hasse diagram is called a cover graph. Let c(G) denote the the minimum number of edges to be deleted from a graph G to get a cover"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1202.6461","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-18T04:01:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"urbjuOz8fRsdU+3wcoKT4k9LWjhhBeVOXo5IJZMgqzjjnwg+rcWsPAlSgK4dhMD9uL7u3EVDc7X5qHoAeHR+CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T23:16:38.528950Z"},"content_sha256":"277a3758f21d194b6bb600a8996ad5580417f9d5f6c6e47cea6fa426ef50fa9a","schema_version":"1.0","event_id":"sha256:277a3758f21d194b6bb600a8996ad5580417f9d5f6c6e47cea6fa426ef50fa9a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OCAI3D2THO52GBHAXHG4MYHJ5Z/bundle.json","state_url":"https://pith.science/pith/OCAI3D2THO52GBHAXHG4MYHJ5Z/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OCAI3D2THO52GBHAXHG4MYHJ5Z/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-06-25T23:16:38Z","links":{"resolver":"https://pith.science/pith/OCAI3D2THO52GBHAXHG4MYHJ5Z","bundle":"https://pith.science/pith/OCAI3D2THO52GBHAXHG4MYHJ5Z/bundle.json","state":"https://pith.science/pith/OCAI3D2THO52GBHAXHG4MYHJ5Z/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OCAI3D2THO52GBHAXHG4MYHJ5Z/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:OCAI3D2THO52GBHAXHG4MYHJ5Z","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":"3146a5b935a8f619f0a59633777414ea58a658020c121685c14229e25832791f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-02-29T07:00:02Z","title_canon_sha256":"59530a715826acaa8a2b87764c57bbcfa0aa3e0e5ed361481f85ddb8630d3ff3"},"schema_version":"1.0","source":{"id":"1202.6461","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1202.6461","created_at":"2026-05-18T04:01:12Z"},{"alias_kind":"arxiv_version","alias_value":"1202.6461v1","created_at":"2026-05-18T04:01:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1202.6461","created_at":"2026-05-18T04:01:12Z"},{"alias_kind":"pith_short_12","alias_value":"OCAI3D2THO52","created_at":"2026-05-18T12:27:16Z"},{"alias_kind":"pith_short_16","alias_value":"OCAI3D2THO52GBHA","created_at":"2026-05-18T12:27:16Z"},{"alias_kind":"pith_short_8","alias_value":"OCAI3D2T","created_at":"2026-05-18T12:27:16Z"}],"graph_snapshots":[{"event_id":"sha256:277a3758f21d194b6bb600a8996ad5580417f9d5f6c6e47cea6fa426ef50fa9a","target":"graph","created_at":"2026-05-18T04:01:12Z","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 D be an acyclic orientation of the graph G. An arc of D is dependent if its reversal creates a directed cycle. Let m(G) denote the minimum number of dependent arcs over all acyclic orientations of G. For any k > 0, a generalized Mycielski graph M_k(G) of G is defined. Note that M_1(G) is the usual Mycielskian of G. We generalize results concerning m(M_1(G)) in K. L. Collins, K. Tysdal, J. Graph Theory, 46 (2004), 285-296, to m(M_k(G)). The underlying graph of a Hasse diagram is called a cover graph. Let c(G) denote the the minimum number of edges to be deleted from a graph G to get a cover","authors_text":"Hsin-Hao Lai, Ko-Wei Lih","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-02-29T07:00:02Z","title":"The Minimum Number of Dependent Arcs and a Related Parameter of Generalized Mycielski Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1202.6461","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:10e1fd4d39047e730e1df5de8815899967430f9f96c5a4b1a00c1d19578ac6a6","target":"record","created_at":"2026-05-18T04:01:12Z","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":"3146a5b935a8f619f0a59633777414ea58a658020c121685c14229e25832791f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-02-29T07:00:02Z","title_canon_sha256":"59530a715826acaa8a2b87764c57bbcfa0aa3e0e5ed361481f85ddb8630d3ff3"},"schema_version":"1.0","source":{"id":"1202.6461","kind":"arxiv","version":1}},"canonical_sha256":"70808d8f533bbba304e0b9cdc660e9ee6a2d167b2131ef09b2a4b513371d1ef0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"70808d8f533bbba304e0b9cdc660e9ee6a2d167b2131ef09b2a4b513371d1ef0","first_computed_at":"2026-05-18T04:01:12.502677Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:01:12.502677Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"8Q88Vs8m6XQyTl/6Gsc+hh8UhgJMQiHkjwMsBX6LzlvK+/ldhi3NA878Ub38If5P+gJAFqXRFv2IaT3bHQEEBg==","signature_status":"signed_v1","signed_at":"2026-05-18T04:01:12.503226Z","signed_message":"canonical_sha256_bytes"},"source_id":"1202.6461","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:10e1fd4d39047e730e1df5de8815899967430f9f96c5a4b1a00c1d19578ac6a6","sha256:277a3758f21d194b6bb600a8996ad5580417f9d5f6c6e47cea6fa426ef50fa9a"],"state_sha256":"c4d4464a7fbeced1b713a8a1d7a2eff4bb3ce0a597839fc09d300003304f069e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+iKxTL6X/H2lehPFeIhuuRjOZ+agQGI1F+No42iR0hetvwTIFgrGnLWrZwEPRX8AqxdACFxWEuzeSS3YHx5cDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-25T23:16:38.530942Z","bundle_sha256":"1af71df8d9124ab66ca6644293632ff165629db75556db963d6e428b90ef3669"}}