{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:PPRYGZZY447DS3KBBUHVTVV6IC","short_pith_number":"pith:PPRYGZZY","canonical_record":{"source":{"id":"2606.24739","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-06-23T16:01:43Z","cross_cats_sorted":[],"title_canon_sha256":"2455944c916cd17eb3c1b0e6fac75a309b3b2aea48a8684ba3e072ba516c8363","abstract_canon_sha256":"910dffb5082468f08ac72b4b2002835fdafe6fc3c5f21926d435d6e39deb48a5"},"schema_version":"1.0"},"canonical_sha256":"7be3836738e73e396d410d0f59d6be4086ec22f4eceeb6dc05ca796f196af53b","source":{"kind":"arxiv","id":"2606.24739","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.24739","created_at":"2026-06-24T01:15:40Z"},{"alias_kind":"arxiv_version","alias_value":"2606.24739v1","created_at":"2026-06-24T01:15:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.24739","created_at":"2026-06-24T01:15:40Z"},{"alias_kind":"pith_short_12","alias_value":"PPRYGZZY447D","created_at":"2026-06-24T01:15:40Z"},{"alias_kind":"pith_short_16","alias_value":"PPRYGZZY447DS3KB","created_at":"2026-06-24T01:15:40Z"},{"alias_kind":"pith_short_8","alias_value":"PPRYGZZY","created_at":"2026-06-24T01:15:40Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:PPRYGZZY447DS3KBBUHVTVV6IC","target":"record","payload":{"canonical_record":{"source":{"id":"2606.24739","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-06-23T16:01:43Z","cross_cats_sorted":[],"title_canon_sha256":"2455944c916cd17eb3c1b0e6fac75a309b3b2aea48a8684ba3e072ba516c8363","abstract_canon_sha256":"910dffb5082468f08ac72b4b2002835fdafe6fc3c5f21926d435d6e39deb48a5"},"schema_version":"1.0"},"canonical_sha256":"7be3836738e73e396d410d0f59d6be4086ec22f4eceeb6dc05ca796f196af53b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-24T01:15:40.620382Z","signature_b64":"0dLuXyGenhXwc/cHGOczjrNt3QxqOcb6qSR6wbL2g+ZoRDz9msMhUM7eExm4TiqIpbnK3T+yu8Fs3M0C3sGUBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7be3836738e73e396d410d0f59d6be4086ec22f4eceeb6dc05ca796f196af53b","last_reissued_at":"2026-06-24T01:15:40.619976Z","signature_status":"signed_v1","first_computed_at":"2026-06-24T01:15:40.619976Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2606.24739","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-06-24T01:15:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"J+xJOs2hNxSWddASog184txU067+IUOfhCWedz0jwIlHqJxpscTMTlGNXC3wrOsuhbv2jRYtxxbTRlRVGhWhDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-05T09:51:50.318197Z"},"content_sha256":"18b7c2a69a3fb783cc479624b3ca1d569745719362050def30264fcf052d9926","schema_version":"1.0","event_id":"sha256:18b7c2a69a3fb783cc479624b3ca1d569745719362050def30264fcf052d9926"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:PPRYGZZY447DS3KBBUHVTVV6IC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On converse invariant trees of diameter four","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Fernando Afonso, Lucas Colucci, T\\'assio Naia","submitted_at":"2026-06-23T16:01:43Z","abstract_excerpt":"Let $D$ be an oriented graph, and let $f_T(D)$ denote the number of copies of $D$ in a tournament $T$. We say that $D$ is \\emph{converse invariant} if $f_T(D)=f_T(\\overline D)$ for every tournament $T$, where $\\overline D$ is obtained from $D$ by reversing all arcs. Ai, Gutin, Lei, Yeo, and Zhou introduced a digraph polynomial for studying this property and conjectured that an orientation of a tree of maximum degree at least $3$ is converse invariant if and only if it is self-converse or can be obtained recursively by bridge-mirroring from an orientation of a path.\n  We disprove this conjectur"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.24739","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2606.24739/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-06-24T01:15:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XCbvArLQF1IhPog8y40olTqXn08UGocq9vMoqGhZCIoB2Rx2h/yyKDl0eVCM2L5qFrhPwJ+gO2QWCX9LPgMWAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-05T09:51:50.318583Z"},"content_sha256":"da2fca2e72a7c9212c9a1bc4205df4e9ed185fd943a7351a5f272c063d387750","schema_version":"1.0","event_id":"sha256:da2fca2e72a7c9212c9a1bc4205df4e9ed185fd943a7351a5f272c063d387750"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PPRYGZZY447DS3KBBUHVTVV6IC/bundle.json","state_url":"https://pith.science/pith/PPRYGZZY447DS3KBBUHVTVV6IC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PPRYGZZY447DS3KBBUHVTVV6IC/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-07-05T09:51:50Z","links":{"resolver":"https://pith.science/pith/PPRYGZZY447DS3KBBUHVTVV6IC","bundle":"https://pith.science/pith/PPRYGZZY447DS3KBBUHVTVV6IC/bundle.json","state":"https://pith.science/pith/PPRYGZZY447DS3KBBUHVTVV6IC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PPRYGZZY447DS3KBBUHVTVV6IC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:PPRYGZZY447DS3KBBUHVTVV6IC","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":"910dffb5082468f08ac72b4b2002835fdafe6fc3c5f21926d435d6e39deb48a5","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-06-23T16:01:43Z","title_canon_sha256":"2455944c916cd17eb3c1b0e6fac75a309b3b2aea48a8684ba3e072ba516c8363"},"schema_version":"1.0","source":{"id":"2606.24739","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.24739","created_at":"2026-06-24T01:15:40Z"},{"alias_kind":"arxiv_version","alias_value":"2606.24739v1","created_at":"2026-06-24T01:15:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.24739","created_at":"2026-06-24T01:15:40Z"},{"alias_kind":"pith_short_12","alias_value":"PPRYGZZY447D","created_at":"2026-06-24T01:15:40Z"},{"alias_kind":"pith_short_16","alias_value":"PPRYGZZY447DS3KB","created_at":"2026-06-24T01:15:40Z"},{"alias_kind":"pith_short_8","alias_value":"PPRYGZZY","created_at":"2026-06-24T01:15:40Z"}],"graph_snapshots":[{"event_id":"sha256:da2fca2e72a7c9212c9a1bc4205df4e9ed185fd943a7351a5f272c063d387750","target":"graph","created_at":"2026-06-24T01:15:40Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2606.24739/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Let $D$ be an oriented graph, and let $f_T(D)$ denote the number of copies of $D$ in a tournament $T$. We say that $D$ is \\emph{converse invariant} if $f_T(D)=f_T(\\overline D)$ for every tournament $T$, where $\\overline D$ is obtained from $D$ by reversing all arcs. Ai, Gutin, Lei, Yeo, and Zhou introduced a digraph polynomial for studying this property and conjectured that an orientation of a tree of maximum degree at least $3$ is converse invariant if and only if it is self-converse or can be obtained recursively by bridge-mirroring from an orientation of a path.\n  We disprove this conjectur","authors_text":"Fernando Afonso, Lucas Colucci, T\\'assio Naia","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-06-23T16:01:43Z","title":"On converse invariant trees of diameter four"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.24739","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:18b7c2a69a3fb783cc479624b3ca1d569745719362050def30264fcf052d9926","target":"record","created_at":"2026-06-24T01:15:40Z","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":"910dffb5082468f08ac72b4b2002835fdafe6fc3c5f21926d435d6e39deb48a5","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-06-23T16:01:43Z","title_canon_sha256":"2455944c916cd17eb3c1b0e6fac75a309b3b2aea48a8684ba3e072ba516c8363"},"schema_version":"1.0","source":{"id":"2606.24739","kind":"arxiv","version":1}},"canonical_sha256":"7be3836738e73e396d410d0f59d6be4086ec22f4eceeb6dc05ca796f196af53b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7be3836738e73e396d410d0f59d6be4086ec22f4eceeb6dc05ca796f196af53b","first_computed_at":"2026-06-24T01:15:40.619976Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-24T01:15:40.619976Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"0dLuXyGenhXwc/cHGOczjrNt3QxqOcb6qSR6wbL2g+ZoRDz9msMhUM7eExm4TiqIpbnK3T+yu8Fs3M0C3sGUBw==","signature_status":"signed_v1","signed_at":"2026-06-24T01:15:40.620382Z","signed_message":"canonical_sha256_bytes"},"source_id":"2606.24739","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:18b7c2a69a3fb783cc479624b3ca1d569745719362050def30264fcf052d9926","sha256:da2fca2e72a7c9212c9a1bc4205df4e9ed185fd943a7351a5f272c063d387750"],"state_sha256":"7091f29d8ca73438578325d2c23de93d316dc8014c04733c20591aed3da09c5d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tDgPwGBHIgr1NlvS7xbn9kd4hOcLTrjwBmsQwFZehoEBxS97IRKcfTf8oOHfaCeje4DlVzptmOaWDiEWbp5FDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-05T09:51:50.320586Z","bundle_sha256":"efdfc4f9ba1ef31f5354fe8749da7fe4f26fee5e2ea4ab5b77f9eed03f9d4c01"}}