{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:NWFBDIMMJQ36J52JIWTWDM5MCJ","short_pith_number":"pith:NWFBDIMM","canonical_record":{"source":{"id":"1805.08953","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-05-23T03:56:38Z","cross_cats_sorted":[],"title_canon_sha256":"2a0552666687c766210868845f005229829f5d91f9d4f2acd49d274d07c844fd","abstract_canon_sha256":"c52bedac8618afccb4e9dedacc4bbbd6f22907df9fc95a71aa2b66513af8a7af"},"schema_version":"1.0"},"canonical_sha256":"6d8a11a18c4c37e4f74945a761b3ac1279a3f072495216b12f7bdb53fa2fecb5","source":{"kind":"arxiv","id":"1805.08953","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.08953","created_at":"2026-05-18T00:15:08Z"},{"alias_kind":"arxiv_version","alias_value":"1805.08953v1","created_at":"2026-05-18T00:15:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.08953","created_at":"2026-05-18T00:15:08Z"},{"alias_kind":"pith_short_12","alias_value":"NWFBDIMMJQ36","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_16","alias_value":"NWFBDIMMJQ36J52J","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_8","alias_value":"NWFBDIMM","created_at":"2026-05-18T12:32:40Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:NWFBDIMMJQ36J52JIWTWDM5MCJ","target":"record","payload":{"canonical_record":{"source":{"id":"1805.08953","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-05-23T03:56:38Z","cross_cats_sorted":[],"title_canon_sha256":"2a0552666687c766210868845f005229829f5d91f9d4f2acd49d274d07c844fd","abstract_canon_sha256":"c52bedac8618afccb4e9dedacc4bbbd6f22907df9fc95a71aa2b66513af8a7af"},"schema_version":"1.0"},"canonical_sha256":"6d8a11a18c4c37e4f74945a761b3ac1279a3f072495216b12f7bdb53fa2fecb5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:15:08.964992Z","signature_b64":"bQtr71c6MYyNJlI3obGrJDVY6AeMKEzBzSRPn7ZcInCGSj61ifDgkZyuIXc5isH4nAvxaz3DHrON9l6hKDRmCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6d8a11a18c4c37e4f74945a761b3ac1279a3f072495216b12f7bdb53fa2fecb5","last_reissued_at":"2026-05-18T00:15:08.964487Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:15:08.964487Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1805.08953","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-18T00:15:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QjwDgkIx6IfPzMbTRSS3Cs39oXkZssjrQ62tjGkbXKpN9zivwnzwUbXVRijMATEESSpHEcufMHRngEurd9QyCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T05:23:00.273207Z"},"content_sha256":"474852491ae601a3e0e2d414c9086a3e7823a8582302bd900547723b4794a0ce","schema_version":"1.0","event_id":"sha256:474852491ae601a3e0e2d414c9086a3e7823a8582302bd900547723b4794a0ce"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:NWFBDIMMJQ36J52JIWTWDM5MCJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Maximal and maximum transitive relation contained in a given binary relation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Nitesh Jha, Sasanka Roy, Shamik Ghosh, Sourav Chakraborty","submitted_at":"2018-05-23T03:56:38Z","abstract_excerpt":"We study the problem of finding a \\textit{maximal} transitive relation contained in a given binary relation. Given a binary relation of size $m$ defined on a set of size $n$, we present a polynomial time algorithm that finds a maximal transitive sub-relation in time $O(n^2 + nm)$.\n  We also study the problem of finding a \\textit{maximum} transitive relation contained in a binary relation. This is the problem of computing a maximum transitive subgraph in a given digraph. For the class of directed graphs with the underlying graph being triangle-free, we present a $0.874$-approximation algorithm."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.08953","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-18T00:15:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WfjgGmPmv7CCJWCzz5m7v1HmMm+5M0uo2ZP82uTMnRnWqNkp10kOYw7GiqZsaM6dLy5b0BpCB5V1FFwKDV+RBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T05:23:00.273575Z"},"content_sha256":"063de12e3df9f2609f3e069a345e8ea322b5411d06e4e7848fd5bb61922dabbb","schema_version":"1.0","event_id":"sha256:063de12e3df9f2609f3e069a345e8ea322b5411d06e4e7848fd5bb61922dabbb"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NWFBDIMMJQ36J52JIWTWDM5MCJ/bundle.json","state_url":"https://pith.science/pith/NWFBDIMMJQ36J52JIWTWDM5MCJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NWFBDIMMJQ36J52JIWTWDM5MCJ/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-01T05:23:00Z","links":{"resolver":"https://pith.science/pith/NWFBDIMMJQ36J52JIWTWDM5MCJ","bundle":"https://pith.science/pith/NWFBDIMMJQ36J52JIWTWDM5MCJ/bundle.json","state":"https://pith.science/pith/NWFBDIMMJQ36J52JIWTWDM5MCJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NWFBDIMMJQ36J52JIWTWDM5MCJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:NWFBDIMMJQ36J52JIWTWDM5MCJ","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":"c52bedac8618afccb4e9dedacc4bbbd6f22907df9fc95a71aa2b66513af8a7af","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-05-23T03:56:38Z","title_canon_sha256":"2a0552666687c766210868845f005229829f5d91f9d4f2acd49d274d07c844fd"},"schema_version":"1.0","source":{"id":"1805.08953","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.08953","created_at":"2026-05-18T00:15:08Z"},{"alias_kind":"arxiv_version","alias_value":"1805.08953v1","created_at":"2026-05-18T00:15:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.08953","created_at":"2026-05-18T00:15:08Z"},{"alias_kind":"pith_short_12","alias_value":"NWFBDIMMJQ36","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_16","alias_value":"NWFBDIMMJQ36J52J","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_8","alias_value":"NWFBDIMM","created_at":"2026-05-18T12:32:40Z"}],"graph_snapshots":[{"event_id":"sha256:063de12e3df9f2609f3e069a345e8ea322b5411d06e4e7848fd5bb61922dabbb","target":"graph","created_at":"2026-05-18T00:15:08Z","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":"We study the problem of finding a \\textit{maximal} transitive relation contained in a given binary relation. Given a binary relation of size $m$ defined on a set of size $n$, we present a polynomial time algorithm that finds a maximal transitive sub-relation in time $O(n^2 + nm)$.\n  We also study the problem of finding a \\textit{maximum} transitive relation contained in a binary relation. This is the problem of computing a maximum transitive subgraph in a given digraph. For the class of directed graphs with the underlying graph being triangle-free, we present a $0.874$-approximation algorithm.","authors_text":"Nitesh Jha, Sasanka Roy, Shamik Ghosh, Sourav Chakraborty","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-05-23T03:56:38Z","title":"Maximal and maximum transitive relation contained in a given binary relation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.08953","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:474852491ae601a3e0e2d414c9086a3e7823a8582302bd900547723b4794a0ce","target":"record","created_at":"2026-05-18T00:15:08Z","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":"c52bedac8618afccb4e9dedacc4bbbd6f22907df9fc95a71aa2b66513af8a7af","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-05-23T03:56:38Z","title_canon_sha256":"2a0552666687c766210868845f005229829f5d91f9d4f2acd49d274d07c844fd"},"schema_version":"1.0","source":{"id":"1805.08953","kind":"arxiv","version":1}},"canonical_sha256":"6d8a11a18c4c37e4f74945a761b3ac1279a3f072495216b12f7bdb53fa2fecb5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6d8a11a18c4c37e4f74945a761b3ac1279a3f072495216b12f7bdb53fa2fecb5","first_computed_at":"2026-05-18T00:15:08.964487Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:15:08.964487Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"bQtr71c6MYyNJlI3obGrJDVY6AeMKEzBzSRPn7ZcInCGSj61ifDgkZyuIXc5isH4nAvxaz3DHrON9l6hKDRmCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:15:08.964992Z","signed_message":"canonical_sha256_bytes"},"source_id":"1805.08953","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:474852491ae601a3e0e2d414c9086a3e7823a8582302bd900547723b4794a0ce","sha256:063de12e3df9f2609f3e069a345e8ea322b5411d06e4e7848fd5bb61922dabbb"],"state_sha256":"ffbbc4ec02d87913aa2f0f52703a83f28e818d6d64a203bd783039a8e3059d4b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lKHmUh+qFO+xhZMdzawGZCFYDVold7ol4m0PzTXWgW/kriYLf7JGxSB7CBPXWF42KzPxh+pTC0ZtemeiiakJDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T05:23:00.275558Z","bundle_sha256":"3db90275cdb2869c35f8461b63ca6097c997057ff8d28cbc9247c6e3535bb27a"}}